Adaptive Optimization Method Research Articles

Enhancing Long-Term Robustness of Inter-Space Laser Links in Space Gravitational Wave Detection: An Adaptive Weight Optimization Method for Multi-Attitude Sensors Data Fusion

The stable and high-precision acquisition of attitude data is crucial for sustaining the long-term robustness of laser links to detect gravitational waves in space. We introduce an effective method that utilizes an adaptive weight optimization approach for the fusion of attitude data obtained from charge-coupled device (CCD) spot-positioning-based attitude measurements, differential power sensing (DPS), and differential wavefront sensing (DWS). This approach aims to obtain more robust and lower-noise-level attitude data. A system is designed based on the Michelson interferometer for link simulations; validation experiments are also conducted. The experimental results demonstrate that the fused data exhibit higher robustness. Even in the case of a single sensor failure, valid attitude data can still be obtained. Additionally, the fused data have lower noise levels, with root mean square errors of 9.5%, 37.4%, and 93.4% for the single CCD, DPS, and DWS noise errors, respectively.

Optimal adaptive heuristic algorithm based energy optimization with flexible loads using demand response in smart grid.

Demand response-based load scheduling in smart power grids is currently one of the most important topics in energy optimization. There are several benefits to utility companies and their customers from this strategy. The main goal of this work is to employ a load scheduling controller (LSC) to model and solve the scheduling issue for household appliances. The LSC offers a solution to the primary problems faced during implementing demand response. The goal is to minimize peak-to-average demand ratios (PADR) and electricity bills while preserving customer satisfaction. Time-varying pricing, intermittent renewable energy, domestic appliance energy demand, storage battery, and grid constraints are all incorporated into the model. The optimal adaptive wind-driven optimization (OAWDO) method is a stochastic optimization technique designed to manage supply, demand, and power price uncertainties. LSC creates the ideal schedule for home appliance running periods using the OAWDO algorithm. This guarantees that every appliance runs as economically as possible on its own. Most appliances run the risk of functioning during low-price hours if just the real time-varying price system is used, which could result in rebound peaks. We combine an inclined block tariff with a real-time-varying price to alleviate this problem. MATLAB is used to do a load scheduling simulation for home appliances based on the OAWDO algorithm. By contrasting it with other algorithms, including the genetic algorithm (GA), the whale optimization algorithm (WOA), the fire-fly optimization algorithm (FFOA), and the wind-driven optimization (WDO) algorithms, the effectiveness of the OAWDO technique is supported. Results indicate that OAWDO works better than current algorithms in terms of reducing power costs, PADR, and rebound peak formation without sacrificing user comfort.

Simulation-based adaptive optimization for passenger flow control measures at metro stations

Effective passenger flow control measures are essential for the safe operation of metro stations. Existing in-station control measures include adjusting the operation mode of escalators and setting up temporary fences. However, in practice, metro operators often adopt fixed operation modes during fixed periods, indicating that the current passenger flow control measures at metro stations are overly rigidified. Therefore, developing an adaptive control strategy to constantly balance the wildly fluctuating passenger flow and optimize the operation performance is a key issue in current research. In this study, transportation efficiency and congestion risk are selected as evaluation objectives for passenger transportation risk, and passenger flow feature, station structure, and passenger flow control measures are considered key influential factors. Subsequently, an adaptive optimization method integrating simulation and data interpolation is proposed. The software Legion is used to conduct 150 orthogonal simulations, and prediction models for passenger transportation risk are obtained by performing data interpolation on the simulation results. Finally, taking a certain metro station as a case study, the optimal passenger flow control strategy under any passenger flow composition is obtained by scenario acquisition, risk identification, and adaptive decision-making. The results show that setting up temporary fences can reduce the passenger density near the fare gates, while adjusting the running direction of escalators can reduce overcrowding on the platform. Under varying passenger flow composition, the optimal strategy for the current scenario can be obtained, controlling passenger transportation risk within an acceptable range and providing assistance for metro operators in decision-making.

The optimization algorithm of intelligent transportation systems based on reinforcement learning

With the acceleration of urbanization and the increase in traffic load, traditional traffic management methods struggle to cope with the complexity of modern traffic conditions. Intelligent Transportation Systems (ITS), utilizing modern information technology and artificial intelligence, have improved the efficiency and safety of transportation systems. Reinforcement Learning (RL), as an adaptive optimization method, can dynamically adjust traffic signals and flow control strategies through trial and error and reward mechanisms, optimizing traffic flow management and signal control. This paper investigates the optimization algorithms of intelligent transportation systems based on reinforcement learning, including their design, application, and performance evaluation. Research indicates that RL optimization algorithms can significantly enhance the organizational performance of transportation systems, increasing the efficiency and flexibility of traffic management. Empirical analysis verifies the effectiveness of the algorithm, and future improvement directions are proposed.

Underwater image restoration via spatially adaptive polarization imaging and color correction

Polarization imaging is extensively employed in underwater image restoration owing to its effectiveness in eliminating backscattered light. However, the existing polarization-based imaging methods rely on the strong assumption that the degrees of polarization (DoPs) of the target and backscattered light remain constant. Additionally, these methods ignore wavelength-specific absorption phenomena. To address these challenges, we propose an underwater image restoration method via spatially adaptive polarization imaging and color correction. First, based on optimal polarization difference images, we propose a method for calculating the spatial DoP of the target. In this method, the polarization characteristics of the target and background are fully exploited, and a scoring function is designed to achieve an optimal differential image. Second, we propose an adaptive local optimization method to estimate the spatial DoP of backscattering, which involves dividing the image into multiple local regions, and then employing improved particle swarm optimization (IPSO) algorithms to obtain the optimal value of DoP for each region. Finally, we introduce an adaptive compensation method based on the channel with minimal color absorption to correct color shifts during underwater polarization imaging. Extensive experiments demonstrate that our method exhibits superior generalization capability and outstanding restoration performance compared to existing methods.

Adaptive optimization of thermal energy and information management in intelligent green manufacturing process based on neural network

The study of thermal energy adaptive optimization has important theoretical and practical significance. The deep learning neural network model is used to monitor and analyze the thermal energy data in the manufacturing process in real time. Through the construction of adaptive optimization algorithm, the heat input and output are systematically evaluated and adjusted, and the heat distribution scheme is dynamically optimized according to environmental changes and production needs. At the same time, information management system is introduced to realize data summary, feedback and decision support. The experimental results show that the proposed method can effectively reduce the heat energy loss, optimize the heat energy utilization, and significantly reduce the overall energy consumption compared with traditional management methods. With real-time data updates, the system improves the flexibility and responsiveness of the production process, significantly improving manufacturing efficiency. The thermal energy adaptive optimization method based on neural network provides an effective solution for intelligent green manufacturing, which can not only optimize thermal energy management, but also provide a reference for other resource conservation and environmental protection.

An innovative deep reinforcement learning-driven cutting parameters adaptive optimization method taking tool wear into account

Tool wear is critically important for the optimization of cutting parameters. However, the increasing nature of tool wear presents challenges to traditional meta-heuristic cutting parameter optimization methods. To address this issue, we propose an innovative deep reinforcement learning-driven cutting parameters adaptive optimization method taking tool wear into account. More specifically, we use the Markov Decision Process to simulate the optimization process of cutting parameters. Firstly, an innovative deep transfer learning algorithm is used for monitoring tool wear. With the progress of tool wear, the proximal policy optimization method of the transformer with multi-head attention mechanism interacts with the processing environment through a process of trial and error, and accumulates a wealth of experience in selecting cutting parameters through the reward function. The deep reinforcement learning model has quickly discern the best cutting parameters, relying on real-time tool wear value. The experimental results show that the proposed method outperforms other algorithms.

An adaptive multi-objective optimization method for structure-connection-performance design of commercial vehicle cab

A variable screening-approximate model-adaptive multi-optimization algorithm integrated method is proposed to solve the high-dimensional nonlinear problems for lightweight optimization of cabs. Firstly, a full-parametric body-in-white model of the cab is established using implicit parameterization technology, and the simulation analysis of the bending and torsional stiffness, natural modal characteristics, and passive safety are established. Then, considering the structure and connection process parameters, the design variables are screened based on a gray relational analysis-TOPSIS (GRA-TOPSIS). Finally, integrated multi-objective optimization of cab structure-connection-performance is carried out by an adaptive RBF neural network optimization method, and the optimal solution is determined by the GRA-TOPSIS method. Compared with the initial model, the mass of cab is reduced by 3.28% after optimization design. It provides guidance for the lightweight design of body.

An adaptive operation planning and EBO-BPNN optimization method for decision support systems

Formulating a course of action (COA) before a combat is crucial for operational command. Research in command and control (C2) artificial intelligence is currently focused on using intelligent auxiliary decision-making methods to implement COA. This paper proposes a COA planning method based on line of operation (LOO) and uses planning domain definition language (PDDL) to describe combat scenarios and COA. Following the effect-based optimization (EBO) principle, an effect evaluation model for COA was constructed, and dynamic bayesian networks (DBNs) was used to determine the reasoning and calculate the results of the effect evaluation network. To further improve the execution efficiency of the effect evaluation model in practical applications, the network was optimized through a back propagation neural network (BPNN). Relevant experiments based on the coordinated distributed air defense and anti-missile scenario were carried out using the LOO model to complete the planning of COA. A BPNN evaluation model based on the DBNs evaluation model was built. After training and fine-tuning, it achieved similar evaluation results, with a mean absolute percentage error (MAPE) of less than 0.02%. Compared with the DBNs model, the BPNN model achieved an efficiency improvement of no less than 65%, effectively reducing the consumption of computing resources. This research is the first time to realize the modeled description of COA planning, automatic evaluation, and calculation optimization of COA effects. It can support the development of decision support systems (DSS) and has the potential for practical application.

Efficient Federated Learning Using Dynamic Update and Adaptive Pruning with Momentum on Shared Server Data

Despite achieving remarkable performance, Federated Learning (FL) encounters two important problems, i.e., low training efficiency and limited computational resources. In this paper, we propose a new FL framework, i.e., FedDUMAP, with three original contributions, to leverage the shared insensitive data on the server in addition to the distributed data in edge devices so as to efficiently train a global model. First, we propose a simple dynamic server update algorithm, which takes advantage of the shared insensitive data on the server while dynamically adjusting the update steps on the server in order to speed up the convergence and improve the accuracy. Second, we propose an adaptive optimization method with the dynamic server update algorithm to exploit the global momentum on the server and each local device for superior accuracy. Third, we develop a layer-adaptive model pruning method to carry out specific pruning operations, which is adapted to the diverse features of each layer so as to attain an excellent trade-off between effectiveness and efficiency. Our proposed FL model, FedDUMAP, combines the three original techniques and has a significantly better performance compared with baseline approaches in terms of efficiency (up to 16.9 times faster), accuracy (up to 20.4% higher), and computational cost (up to 62.6% smaller).

Trapezoidal neutrosophic teaching learning-based optimization in enhancing accuracy of diabetes prognosis

Diabetes is one of chronic diseases in which blood glucose (sugar) level soar up high where human body are incapable to absorb it properly. It is important to have an appropriate diagnosis for proper management and treatment. The aim of this manuscript is to provide a more accurate diabetes prediction model through the new adaptive Trapezoidal Neutrosophic Teaching Learning-Based Optimization (TLBO) method. In order to address the inherent uncertainties and imprecisions in medical data, the suggested model makes use of the resilience of Trapezoidal Neutrosophic sets. The Trapezoidal Neutrosophic set theory provides a suitable basis for developing rule/knowledge-based systems in the medical field. The present investigation makes use of the dataset acquired from the Pima Indians Diabetes Database (PIDD) website, which has an extensive global collection of diabetes datasets. The performance of our model is evaluated against several existing methodologies, including Intuitionistic Neuro-Fuzzy System (INFS) Structure, Fuzzy Logic based Diabetes Diagnosis System (FLDDS), Fuzzy Verdict Mechanism (FVM) for Diabetes Decision, (Fuzzy Expert System) FES, and Hierarchical Neuro-Fuzzy Binary space partitioning System (HNFB-1). Quantitative analysis validates that proposed methodology achieves an exceptional predictive accuracy of 99.89 %, which is substantially higher than the comparative methodologies, namely INFS Structure (88.76 %), FLDDS (87.2 %), FVM for Diabetes Decision (85.03 %), FES (81.7 %), and HNFB-1 (78.26 %). These enhancements demonstrate show how well the suggested model works to lower diagnostic errors and increase dependability.

Adaptive Finite-Time-Based Neural Optimal Control of Time-Delayed Wheeled Mobile Robotics Systems.

For nonlinear systems with uncertain state time delays, an adaptive neural optimal tracking control method based on finite time is designed. With the help of the appropriate LKFs, the time-delay problem is handled. A novel nonquadratic Hamilton-Jacobi-Bellman (HJB) function is defined, where finite time is selected as the upper limit of integration. This function contains information on the state time delay, while also maintaining the basic information. To meet specific requirements, the integral reinforcement learning method is employed to solve the ideal HJB function. Then, a tracking controller is designed to ensure finite-time convergence and optimization of the controlled system. This involves the evaluation and execution of gradient descent updates of neural network weights based on a reinforcement learning architecture. The semi-global practical finite-time stability of the controlled system and the finite-time convergence of the tracking error are guaranteed.

Enhancing the Transferability of Adversarial Patch via Alternating Minimization

Adversarial patches, a type of adversarial example, pose serious security threats to deep neural networks (DNNs) by inducing erroneous outputs. Existing gradient stabilization methods aim to stabilize the optimization direction of adversarial examples through accumulating gradient momentum to enhance attack transferability on black-box models. However, they are not fully effective for adversarial patches. The accumulated momentum during optimization often misaligns with the optimization direction, reducing their efficacy in black-box scenarios. We introduce an optimization method called Alternating Minimization for Adversarial Patch (AMAP). This method decomposes the original AP into multiple sub-patches and utilizes their update direction to stabilize the optimization of the original AP. Additionally, we propose an adaptive step size optimization method that accelerates convergence and boosts the attack performance. In face recognition tasks, AMAP outperforms baseline methods by a remarkable 5.21% and exceeds the second-best method by 1.4%. Furthermore, AMAP demonstrates practical feasibility in the physical domain, highlighting its potential for robust computer security testing applications.

Research on time-energy optimal trajectory planning of articulated heavy-duty robot

Articulated heavy-duty robots are more and more widely used in the construction environment. Aiming at the problems of low working efficiency and high energy consumption of this kind of robot, a multi-objective adaptive trajectory planning method combining path optimization and trajectory optimization is proposed to improve the working efficiency of the robot and reduce energy consumption. Firstly, based on kinematics and dynamic analysis considering friction, the energy consumption model of robot trajectory is constructed. Then, according to the posture of the key points in the known workspace, the optimal path points in the joint space are obtained by a path point solution method considering the joint load characteristics. On this basis, a multi-objective model considering running time and energy consumption is established to plan the interpolation trajectory of the joint space of the quintic B-spline curve. Finally, constrained by the velocity, acceleration and torque of the joint of the manipulator, the optimal solution is obtained by using the elite non-dominated sorting genetic algorithm (NSGA-II), and the optimal weight factor is selected by a multi-objective adaptive optimization method to obtain the optimal position-time series. The experimental results show that compared with the quintic polynomial trajectory optimization method, the energy consumption of the proposed method is reduced by 10.90% under the same working efficiency. The research results of this paper provide a new optimization idea for other target trajectory planning.

Adaptive Kriging-Based Heat Production Performance Optimization for a Two-Horizontal-Well Geothermal System

Optimizing heat generation capacity is crucial for geothermal system design and evaluation. Computer simulation is a valuable approach for determining the influence of various parameter combinations on a geothermal system’s ability to produce heat. However, computer simulation evaluations are often computationally demanding since all potential parameter combinations must be examined, posing significant hurdles for heat generation performance evaluation and optimization. This research proposes an adaptive Kriging-based heat generation performance optimization method. Firstly, a two-horizontal-well geothermal system with rectangular multi-parallel fractures is constructed. The heat production performance optimization problem is then established, and the temperature and enthalpy of the outlet water are calculated using computer simulation and Kriging. A parameterized lower confidence bounding sampling scheme (PLCB) is developed to adaptively update Kriging in order to strike a compromise between optimization accuracy and computation burden. The outcomes of the optimization are compared to those of the Kriging-based optimization approach and other common infill options to demonstrate the efficiency of the proposed method. The outlet temperature curve obtained with PLCB-AKO-1 rose for a longer time and the heat generation power curve reached a stable output without a downward trend. According to the Friedman and Wilcoxon signed ranks tests, the PLCB-1-AKO technique is statistically superior to alternative strategies.

Voronoi-based adaptive area optimal coverage control for multiple manipulator systems with uncertain kinematics and dynamics

This paper studies an adaptive area optimal coverage control method for multi-manipulator systems under the presence of both uncertain kinematics and dynamics. Initially, an objective cost function associating the voronoi tessellation is utilized to transform the optimal coverage control into the tracking control problem. Consequently, an adaptive area optimal coverage control strategy is designed by using the adaptive dynamic and kinematic programming. In this control strategy, the sliding mode control technology for each robot manipulator system is created to pursue control optimality and prescribed coverage performance simultaneously. The adaptive control algorithm using the parameter linearization properties is further deployed to directly cope with the influence caused by the parameter uncertainties of manipulator dynamics and kinematics. Theoretical analysis is given to guarantee the stability and convergence of the proposed optimal area converge controller, subject to optimal cost. Illustrative example is provided to validate the performance of the proposed framework.

Computationally efficient adaptive optimization of vector-method parameters for phase-sensitive strain estimation in optical coherence elastography

A new method for automatic adaptive optimization of strain estimation in phase-sensitive optical coherence tomography (OCT) is introduced. More specifically, this paper focuses on optimizing the estimation of strain using the vector method, in which OCT signals are treated as vectors in the complex plane. In phase-sensitive optical coherence elastography, the tissue strain is extracted from the interframe phase variation between the complex-valued scans acquired for the initial and deformed tissue. This phase variation is proportional to interframe displacements of scatterers and corresponds to the argument of the pixel-by-pixel product of the initial OCT scan and complex-conjugate deformed scan. Measurement noises and the so-called ‘speckle noise’ that are intrinsic to OCT scans cause degradation of the derived scan obtained by such multiplication. To mitigate the noise influence, complex-valued pixel amplitudes in the derived scan are usually averaged over a certain window. The interframe strain is found by estimating the gradient of the interframe phase difference. The noise influence on the strain estimation can also be reduced by increasing the scale over which the phase-variation gradient is estimated. However, choosing a too large window for preliminary averaging may significantly distort the reconstructed strain distribution. Similarly, a too large scale for gradient estimation may also cause errors in the estimated-strain magnitude and even its sign (because of possible phase wrapping). Therefore, appropriately performed adaptive choice of the strain-estimation parameters can greatly improve the quality of strain estimation. Here, we present a unified approach for adaptive choice of both the averaging-window size and gradient-estimation scale that were initially considered separately. The new method is computationally simplified but enables approximately the same strain-estimation quality, as demonstrated using both simulated and experimental OCT data.

Research on optimizing the controller configuration for high-power supply control system in nuclear fusion based on hybrid algorithm WOA-IAPSO

With the development of nuclear fusion technology, the high power supply control system plays a crucial role in the operation of nuclear fusion, and the PID controller is widely used in the field of power supply control. In this research, a novel hybrid algorithm is proposed that combines whale optimization algorithm (WOA) and the improved adaptive particle swarm optimization (IAPSO) to tune PID parameters in high-power supply. This organically combines the two methods into a new optimization strategy that is different from the simple weighted average method. By comparing the performance of WOA, IAPSO,SA,GA,SVM, and the hybrid WOA-IAPSO in step response under different working conditions, the simulation results show that the proposed algorithm can achieve more sensitive, stable and efficient response in high-power operation. This research is not only of great significance for the further development nuclear fusion technology, but also provides a useful reference for the application of adaptive optimization methods in other fields.

RL-ANC: Reinforcement Learning-Based Adaptive Network Coding in the Ocean Mobile Internet of Things

As the demand for sensing and monitoring the marine environment increases, the Ocean Mobile Internet of Things (OM-IoT) has gradually attracted the interest of researchers. However, the unreliability of communication links represents a significant challenge to data transmission in the OM-IoT, given the complex and dynamic nature of the marine environment, the mobility of nodes, and other factors. Consequently, it is necessary to enhance the reliability of underwater data transmission. To address this issue, this paper proposes a reinforcement learning-based adaptive network coding (RL-ANC) approach. Firstly, the channel conditions are estimated based on the reception acknowledgment, and a feedback-independent decoding state estimation method is proposed. Secondly, the sliding coding window is dynamically adjusted based on the estimates of the channel erasure probability and decoding probability, and the sliding rule is adaptively determined using a reinforcement learning algorithm and an enhanced greedy strategy. Subsequently, an adaptive optimization method for coding coefficients based on reinforcement learning is proposed to enhance the reliability of the underwater data transmission and underwater network coding while reducing the redundancy in the coding. Finally, the sampling period and time slot table are updated using the enhanced simulated annealing algorithm to optimize the accuracy and timeliness of the channel estimation. Simulation experiments demonstrate that the proposed method effectively enhances the data transmission reliability in unreliable communication links, improves the performance of underwater network coding in terms of the packet delivery rate, retransmission, and redundancy transmission ratios, and accelerates the convergence speed of the decoding probability.

Fourier Domain Robust Denoising Decomposition and Adaptive Patch MRI Reconstruction.

The sparsity of the Fourier transform domain has been applied to magnetic resonance imaging (MRI) reconstruction in k -space. Although unsupervised adaptive patch optimization methods have shown promise compared to data-driven-based supervised methods, the following challenges exist in MRI reconstruction: 1) in previous k -space MRI reconstruction tasks, MRI with noise interference in the acquisition process is rarely considered. 2) Differences in transform domains should be resolved to achieve the high-quality reconstruction of low undersampled MRI data. 3) Robust patch dictionary learning problems are usually nonconvex and NP-hard, and alternate minimization methods are often computationally expensive. In this article, we propose a method for Fourier domain robust denoising decomposition and adaptive patch MRI reconstruction (DDAPR). DDAPR is a two-step optimization method for MRI reconstruction in the presence of noise and low undersampled data. It includes the low-rank and sparse denoising reconstruction model (LSDRM) and the robust dictionary learning reconstruction model (RDLRM). In the first step, we propose LSDRM for different domains. For the optimization solution, the proximal gradient method is used to optimize LSDRM by singular value decomposition and soft threshold algorithms. In the second step, we propose RDLRM, which is an effective adaptive patch method by introducing a low-rank and sparse penalty adaptive patch dictionary and using a sparse rank-one matrix to approximate the undersampled data. Then, the block coordinate descent (BCD) method is used to optimize the variables. The BCD optimization process involves valid closed-form solutions. Extensive numerical experiments show that the proposed method has a better performance than previous methods in image reconstruction based on compressed sensing or deep learning.