Dynamic Adjustment Algorithm Research Articles

Addressing Constraint Coupling and Autonomous Decision-Making Challenges: An Analysis of Large-Scale UAV Trajectory-Planning Techniques

With the increase in UAV scale and mission diversity, trajectory planning systems faces more and more complex constraints, which are often conflicting and strongly coupled, placing higher demands on the real-time and response capabilities of the system. At the same time, conflicts and strong coupling pose challenges the autonomous decision-making capability of the system, affecting the accuracy and efficiency of the planning system in complex environments. However, recent research advances addressing these issues have not been fully summarized. An in-depth exploration of constraint handling techniques and autonomous decision-making issues will be of great significance to the development of large-scale UAV systems. Therefore, this paper aims to provide a comprehensive overview of this topic. Firstly, the functions and application scenarios of large-scale UAV trajectory planning are introduced and classified in detail according to the planning method, realization function and the presence or absence of constraints. Then, the constraint handling techniques are described in detail, focusing on the priority ranking of constraints and the principles of their fusion and transformation methods. Then, the importance of autonomous decision-making in large-scale UAV trajectory planning is described in depth, and related dynamic adjustment algorithms are introduced. Finally, the future research directions and challenges of large-scale UAV trajectory planning are outlooked, providing directions and references for future research in the fields of UAV clustering and UAV cooperative flight.

Dynamic Soft Sensor Model for Endpoint Carbon Content and Temperature in BOF Steelmaking Based on Adaptive Feature Matching Variational Autoencoder

The key to endpoint control in basic oxygen furnace (BOF) steelmaking lies in accurately predicting the endpoint carbon content and temperature. However, BOF steelmaking data are complex and change distribution due to variations in raw material batches, process adjustments, and equipment conditions, leading to concept drift and affecting model performance. In order to resolve these problems, this paper proposes a dynamic soft sensor model based on an adaptive feature matching variational autoencoder (VAE-AFM). Firstly, this paper innovatively proposes an adaptive feature matching (AFM) method. This method utilizes the maximum mean discrepancy to calculate the values of the marginal and conditional distributions. Based on the discrepancy between these two values, a dynamic adjustment algorithm is designed to adaptively assign different weights to the two distributions. This approach dynamically and quantitatively evaluates and adjusts the relative importance of different distributions in the domain adaptation process, thereby enhancing the effectiveness of cross-domain data alignment. Secondly, a variational autoencoder (VAE) is employed to process the data, as the VAE model can capture the complex data structures and latent features in the steelmaking process. Finally, the features extracted by the VAE are processed with the adaptive feature matching method, thereby constructing the VAE-AFM dynamic soft sensor model. Experimental studies on actual BOF steelmaking data validate the efficacy of the offered approach, offering a reliable solution to the challenges of high complexity and concept drift in BOF steelmaking data.

A master-slave teleoperation system control model based on model predictive control with fast dynamic response

Robot technology is advancing with constantly expanding applications. Teleoperation system demonstrates its potential to extend human capabilities in unstructured and hazardous environments as an important branch of robotics. However, there are still issues involving insufficient position tracking accuracy and dynamic response capabilities. This article proposes a master-slave teleoperation system control model based on model predictive control (MPC) with a real-time dynamic adaptive parameter adjustment algorithm. We establish a model based on the integral barrier Lyapunov function and construct a dynamic optimization model based on MPC. Then we carry out rolling optimization and feedback correction at each moment to feed the predicted values generated by MPC back to correct the actual tracking trajectories in real-time. Additionally, we utilize an adaptive neural network and robust term compensation to adjust dynamic parameters and eliminate the effects of time delays, external disturbances, and model uncertainties. Theoretical simulation experiments are conducted on the Simulink platform, analyzing position tracking error and dynamic response capabilities of the master-slave robot respectively to verify the proposed model. The results indicate a reduction in the position tracking errors of the master with 10% and slave with 11%, while also showing an improvement in their dynamic response capabilities. The speed error ranges of the master and slave are shortened with 6% and 7% respectively.

Incorporating ergonomic and psychosocial stressors: A comprehensive model for assessing miners’ work-related musculoskeletal disorders

Although the influence of ergonomic and psychosocial stressors on work-related musculoskeletal disorders (WMSDs) has been widely recognized, a risk assessment method that comprehensively considers these stressors is still lacking. As such, this study developed a fuzzy Bayesian network (FBN) model that incorporated a comprehensive set of ergonomic and psychosocial stressors to investigate how they interacted to affect frontline miners’ WMSDs risk. A methodology combining fuzzy set theory, Leaky Noisy-OR gate, and an expert weight dynamic adjustment algorithm was employed to deal with fuzziness, uncertainty, limited data, and conflicting judgments and to provide a probabilistic assessment. Meanwhile, the FBN was validated using 10-fold cross-validation through data collected from 542 frontline miners. Results indicated that the probability of frontline miners suffering from WMSDs is 79.7%. Vibration, awkward posture, inadequate organizational support, inadequate organizational justice, and bad organizational culture were the most influential stressors to frontline miners’ WMSDs. The proposed FBN model can be a powerful decision-support tool to improve frontline miners’ musculoskeletal health by managing a more targeted subset of ergonomic and psychosocial stressors.

Design and Analysis of Flexible Exoskeleton for the Elderly Based on Deep Learning: From Rehabilitation Needs to Technological Innovation

With the acceleration of the aging of the global population, the needs of the elderly for rehabilitation of movement disorders have become increasingly prominent. This paper aims to explore the potential of flexible exoskeleton design based on deep learning in meeting the rehabilitation needs of the elderly. By analyzing the limitations and challenges of existing technologies, this paper proposes a comprehensive solution and looks forward to its future development prospects. The article first introduces the background of population aging and the current situation and challenges of the rehabilitation of the elderly with motor disorders, and then expounds the social significance. In the working process of the device, the peripheral configuration and project implementation steps are introduced in detail. The discussion of key technologies focuses on the application of human intention recognition, dynamic adjustment algorithm. In addition, the paper also analyzes the existing problems of flexible exoskeleton equipment, and looks forward to the future development. Finally, the research results are summarized and the future development direction is prospected.

A cost and demand sensitive adjustment algorithm for service function chain in data center network

The introduction of Network Function Virtualization (NFV) and Software-Defined Network (SDN) architectures has significantly reduced the Operational Expenditure (OPEX) and Capital Expenditure (CAPEX) of network system. However, NFV orchestration management also brings about challenges. After the initial deployment of VNFs, due to the volatility of network requests, the original deployment may not be able to meet user resource demands. The key issue is how to readjust resources dynamically to accommodate more network requests without violating Quality of Service (QoS) for users. Several existing techniques can be used to achieve this goal, such as horizontal scaling, vertical scaling, and virtual network function (VNF) migration. However, these techniques inevitably incur some overhead, such as the cost of instantiating VNF and link rerouting. Additionally, resource adjustment may also result in unbalanced distribution of network resources. In this paper, an Intelligent Service Function Chain Dynamic Adjustment Algorithm (ISFCDAA) is proposed to address the above challenges. Firstly, an Integer Linear Programming (ILP) model is established with the objective of minimizing the long-term adjustment cost and reducing the imbalance of resource distribution. Then we transform the optimization process into a Markov Decision Process (MDP). Secondly, to solve the problems that the state and action space is too large and the state transition probability is uncertain in MDP, a SFC dynamic adjustment algorithm based on deep reinforcement learning is proposed. This algorithm can obtain an approximate optimal adjustment strategy for ILP model. The simulation results show that ISFCDAA can reduce the adjustment overhead and maintain a balanced distribution of network resources while ensuring the QoS. Compared with the existing algorithms, the average standard deviation of resource distribution of ISFCDAA is reduced by up to 9.90%, the average acceptance rate of ISFCDAA is improved by up to 39.57%, and the average long-term profit is improved by up to 42.92%. The incorporation of cost and demand-sensitive considerations into ISFCDAA enhances its responsiveness to fluctuating network demands, solidifying its effectiveness in dynamic resource management scenarios.

MTTEGDM: A Moving Target Evolutionary Game Defense Model Based on Three-Way Decisions

Aiming at the fact that the moving target defense game model fails to accurately portray attack and defense gains, resulting in bias in attack and defense games and the inability to select effective defense strategies, we construct the moving target three-way evolutionary game defense model (MTTEGDM). Firstly, the model is defined and analyzed theoretically under the premise of uncertainty and irrationality. Then, combined with the three-way decisions, the attack intention is introduced into the target network loss calculation, and a dynamic weight adjustment algorithm based on the three-way decisions is proposed to accurately characterize the attack and defense gains from a multi-attribute perspective. Finally, the evolutionary game model is used to analyze the evolution trend of the multi-stage defense strategy, so as to carry out feasible and effective defense behavior. The simulation results show that the model can accurately predict the optimal defense strategy of moving targets in different stages. Through a Monte Carlo simulation experiment, the proposed algorithm is compared with the traditional evolutionary game model, and the effectiveness and security of the proposed algorithm are verified.

A gamified cognitive behavioral therapy for Arabs to reduce symptoms of depression and anxiety: A case study research.

Depression and anxiety are prevalent mental health issues addressed by online cognitive behavioral therapy (CBT) via mobile applications. This study introduces Sokoon, a gamified CBT app tailored for Arabic individuals, focusing on alleviating depression and anxiety symptoms (DASDs). The objectives of this study were to: Evaluate the effectiveness of Sokoon in reducing symptoms of depression and anxiety. Assess the usability of the intervention through user engagement and adherence to CBT skills. A single-group pre-post design evaluated Sokoon's impact on adults with DASDs. In consultation with psychiatrists, Sokoon integrates evidence-based skills such as relaxation, gratitude, behavioral activation, and cognitive restructuring, represented by planets. Its design incorporates Hexad theory and gamification, supported by a dynamic difficulty adjustment algorithm. The study involves 30 participants aged 18-35 (86.7% female), specifically those with mild to moderate depression and anxiety. Based on a sample of 30 participants, Sokoon, a smartphone-based intervention, significantly reduced symptoms of depression and anxiety (d = 2.7, d = 3.6, p < 0.001). Over a two-week trial, participants experienced a notable decrease in anxiety and depressive symptoms, indicating the effectiveness of the model. Sokoon shows potential as a valuable tool for addressing DASDs. Sokoon, the gamified CBT application, offers an innovative approach to increasing CBT skills adherence and engagement. By leveraging Hexad theory and gamification, Sokoon provides an enjoyable and engaging user experience while maintaining the effectiveness of traditional CBT techniques. The study findings suggest that Sokoon has a positive impact on reducing symptoms of depression and anxiety.

Dynamic Adjustment and CAD Real-time Rendering Algorithm for Advertising Art Design based on Machine Vision

Dynamic Adjustment and CAD Real-time Rendering Algorithm for Advertising Art Design based on Machine Vision

Hierarchical energy-saving routing algorithm using fuzzy logic in wireless sensor networks

Currently, sensor energy assembly in wireless sensor networks is limited, and clustering methods are not effective to improve sensor energy consumption rate. Thus, a hierarchical energy-saving routing algorithm based on fuzzy logic was constructed by considering three aspects: residual energy value, centrality, and distance value between nodes and base stations. The remaining sensor nodes selected by fuzzy logic algorithm have a longer time to live and greater residual energy than those selected by low-power adaptive clustering hierarchical protocol algorithm, fuzzy unequal clustering algorithm, and fuzzy logic cluster head election algorithm. For network life cycle, the number of rounds in which the first dead node appears, in descending order, is studied: energy-saving routing algorithm (400 rounds) > new geographic cellular structure algorithm (300 rounds) > virtual grid based dynamic routes adjustment algorithm (100 rounds). Under the same experimental round, energy-saving routing algorithm’s remaining energy curve always reaches its maximum. The energy-saving routing algorithm by fuzzy logic constructed by this research institute can significantly improve network energy utilization, which has certain reference value.

Dynamic Performance Analysis and Control Parameter Adjustment Algorithm for Flywheel Batteries Considering Vehicle Direct Action

Traditional methods often ignore the direct influences of vehicle vibration on the flywheel battery system, which leads to an inaccurate analysis of the dynamic performance of the flywheel battery system and its control effect. Therefore, to make up for the deficiencies of existing studies, a more accurate dynamic performance analysis method and efficient control parameter adjustment algorithm for flywheel batteries based on automotive direct action are proposed in this study. First, the influence of road conditions and vehicle driving conditions on the stability of a vehicle is analyzed primarily. Then, the vibration signal generated by the vehicle is transmitted to the vehicle’s magnetic flywheel battery system for analysis, and the accuracy of the analysis process is realized. Then, according to the stability analysis results for the direct action of the vehicle and the actual PID controller, the control parameter adjustment algorithm is summarized using the curve-fitting method. Finally, a performance test is carried out on the mobile experimental platform. Good experimental results show that the flywheel can quickly return to its equilibrium position and effectively reduce the influence of interference from road conditions and different working conditions and improve the robustness. Therefore, the correctness of the theoretical analysis and parameter adjustment method proposed in this paper was effectively verified.

A collaborative approach to integrated energy systems that consider direct trading of multiple energy derivatives

The cooperative model of a multi-subject Regional Integrated Energy System (RIES) is no longer limited to the trading of traditional energy, but the trading of new energy derivatives such as Green Certificates (GC), Service Power (SP), and CO2 will be more involved in the energy allocation of the cooperative model. This study was conducted for the multi- entity RIES cooperative model considering the trading of electronics, GC, SP, and CO2. First, a cooperative framework including wind-photovoltaic generation system (WG), combined heat and power system (CHP), and power-carbon-hydrogen load (PCH) is proposed, and the mechanism of energy derivatives trading is also analyzed. Then, the sub-models of each agent in the cooperative model are established separately so that WG has the capability of GC generation, CHP has the capability of GC and CO2 absorption, and PCH can realize the effective utilization of CO2. Then, the WG–CHP–PCH cooperative model is established and equated into two sub-problems of cooperative benefit maximization and transaction payment negotiation, which are solved in a distributed manner by the alternating directed multiplier method (ADMM). Finally, the effectiveness of the proposed cooperative model and distributed solution is verified by simulation. The simulation results show that the WG–CHP–PCH cooperative model can substantially improve the operational efficiency of each agent and realize the efficient redistribution of energy and its derivatives. In addition, the dynamic parameter adjustment algorithm (DP) is further applied in the solving process to improve its convergence speed. By updating the step size during each iteration, the computational cost, the number of iterations, and the apparent oscillations are reduced, and the convergence performance of the algorithm is improved.

Water Quality Sampling and Multi-Parameter Monitoring System Based on Multi-Rotor UAV Implementation

Water quality sampling and monitoring are fundamental to water environmental protection. The purpose of this study was to develop a water quality sampling and multi-parameter monitoring system mounted on a multi-rotor unmanned aerial vehicle (UAV). The system consisted of the UAV, water sampling and multi-parameter detection device, and path planning algorithm. The water sampling device was composed of a rotating drum, a direct current (DC) reduction motor, water suction hose, high-pressure isolation pump, sampling bottles, and microcontroller. The multi-parameter detection device consisted of sensors for potential of hydrogen (pH), turbidity, total dissolved solids (TDS), and a microcontroller. The flight path of the UAV was optimized using the proposed layered hybrid improved particle swarm optimization (LHIPSO) and rapidly-exploring random trees (RRT) obstacle avoidance path planning algorithm, in order to improve the sampling efficiency. Simulation experiments were conducted that compared the LHIPSO algorithm with the particle swarm optimization (PSO) algorithm and the dynamic adjustment (DAPSO) algorithm. The simulation results showed that the LHIPSO algorithm had improved global optimization capability and stability compared to the other algorithms, validating the effectiveness of the proposed algorithm. Field experiments were conducted at an aquaculture fish farm, and the device achieved real-time monitoring of three water quality parameters (pH, TDS, turbidity) at depths of 1 m and 2 m. A rapid analysis of three parameters (ammonia nitrogen, nitrite, dissolved oxygen) was performed in the laboratory on the collected water samples, and validated the feasibility of this study.

Effective Selfish Mining Defense Strategies to Improve Bitcoin Dependability

Selfish mining is a typical malicious attack targeting the blockchain-based bitcoin system, an emerging crypto asset. Because of the non-incentive compatibility of the bitcoin mining protocol, the attackers are able to collect unfair mining rewards by intentionally withholding blocks. The existing works on selfish mining mostly focused on cryptography design, and malicious behavior detection based on different approaches, such as machine learning or timestamp. Most defense strategies show their effectiveness in the perspective of reward reduced. No work has been performed to design a defense strategy that aims to improve bitcoin dependability and provide a framework for quantitively evaluating the improvement. In this paper, we contribute by proposing two network-wide defensive strategies: the dynamic difficulty adjustment algorithm (DDAA) and the acceptance limitation policy (ALP). The DDAA increases the mining difficulty dynamically once a selfish mining behavior is detected, while the ALP incorporates a limitation to the acceptance rate when multiple blocks are broadcast at the same time. Both strategies are designed to disincentivize dishonest selfish miners and increase the system’s resilience to the selfish mining attack. A continuous-time Markov chain model is used to quantify the improvement in bitcoin dependability made by the proposed defense strategies. Statistical analysis is applied to evaluate the feasibility of the proposed strategies. The proposed DDAA and ALP methods are also compared to an existing timestamp-based defense strategy, revealing that the DDAA is the most effective in improving bitcoin’s dependability.

Virtual composite impedance circulating current suppression strategy with adaptive adjustment capability

AbstractIn the process of accessing distributed power sources in microgrid, there will be serious coupling between active power and reactive power, which will lead to significant changes in the inverter outlet voltage and impedance and increase the circulating current phenomenon. The generation of circulating current will accelerate the aging of devices, reduce the inverter efficiency, and threaten the stable operation of the system. In this paper, the mechanism of circulating current generation is analysed, the basic characteristics of circulating current are studied, and an inverter parallel circulating current suppression strategy with adaptive virtual composite impedance and droop control dynamic adjustment algorithm is proposed. The virtual impedance setting can weaken the influence of line difference on system stability, make the system equivalent output impedance resistive, weaken the inductive device characteristics and reduce the circulating current amplitude; the adaptive droop algorithm implantation dynamically correlates the control power with the droop coefficient, enhance the power decoupling accuracy and weaken the circulating current influenced by power changes. The simulation platform and experimental setup established by the large‐scale simulation software PSCAD/EMTDC are used to study the basic scenarios of the inverter under two conditions of equal and unequal capacity, and the rationality of the proposed control strategy is tested.

Cross-Corpus Speech Emotion Recognition Based on Transfer Learning and Multi-Loss Dynamic Adjustment.

In this paper, we do research on cross-corpus speech emotion recognition (SER), in which the training and testing speech signals come from different speech corpus. The mismatched feature distribution between the training and testing sets makes many classical algorithms unable to achieve better results. To deal with this issue, a transfer learning and multi-loss dynamic adjustment (TLMLDA) algorithm is initiatively proposed in this paper. The proposed algorithm first builds a novel deep network model based on a deep auto-encoder and fully connected layers to improve the representation ability of features. Subsequently, global domain and subdomain adaptive algorithms are jointly adopted to implement features transfer. Finally, dynamic weighting factors are constructed to adjust the contribution of different loss functions to prevent optimization offset of model training, which effectively improve the generalization ability of the whole system. The results of simulation experiments on Berlin, eNTERFACE, and CASIA speech corpora show that the proposed algorithm can achieve excellent recognition results, and it is competitive with most of the state-of-the-art algorithms.

CAMFuzz: Explainable Fuzzing with Local Interpretation

Grey-box fuzzing techniques have been widely used in software bug finding. In general, there are many decisions to make in the fuzzing process, including which code block in the target program should be explored first, which bytes of an input seed should be mutated to reach the target code block, and how to mutate the chosen input bytes. However, existing solutions usually rely on random exploration or certain heuristics to choose where and how to fuzz, which limits the efficiency of fuzzing. In this paper, we propose a novel solution CAMFuzz to guide the fuzzing process with explainable decisions in explainable artificial intelligence (XAI). First, we propose a dynamic weight adjustment algorithm, which considers both the difficulty of reaching a block and the number of unvisited blocks nearby, to find code blocks worthy to explore first. Second, we utilize a widely used local interpretation technique, i.e., class activation mapping (CAM), to recognize which part of an input seed should be mutated to reach a given target code block. Therefore, CAMFuzz can distinguish which part of code in the program is more important and which positions in the input file should be mutated first, in order to achieve a better code coverage and bug finding efficiency. Third, to further help the fuzzer increase fuzzing efficiency, we leverage a lightweight static program analysis to help the fuzzer identify magic values. We implement a prototype of CAMFuzz and evaluate it on 13 real-world programs (including 11 open source targets, 2 closed-source commercial products including a Microsoft component and Hancom Office) Results show that CAMFuzz outperforms state-of-the-art fuzzers in both code coverage and bug finding. To detail, CAMFuzz on average achieves 2.07times more bugs and 1.17times coverage improvements. In total, it found 19 previously unknown vulnerabilities, of which 6 have been assigned by CVE so far.

Design and implementation of dynamic I/O control scheme for large scale distributed file systems

In this work, we have analyzed the input/output (I/O) activities of Cori, which is a high-performance computing system at the National Energy Research Scientific Computing Center at Lawrence Berkeley National Laboratory. Our analysis results indicate that most users do not adjust storage configurations but rather use the default settings. In addition, owing to the interference from many applications running simultaneously, the performance varies based on the system status. To configure file systems autonomously in complex environments, we developed DCA-IO, a dynamic distributed file system configuration adjustment algorithm that utilizes the system log information to adjust storage configurations automatically. Our scheme aims to improve the application performance and avoid interference from other applications without user intervention. Moreover, DCA-IO uses the existing system logs and does not require code modifications, an additional library, or user intervention. To demonstrate the effectiveness of DCA-IO, we performed experiments using I/O kernels of real applications in both an isolated small-sized Lustre environment and Cori. Our experimental results shows that our scheme can improve the performance of HPC applications by up to 263% with the default Lustre configuration.

A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension

This paper studies a yard allocation problem at a container terminal, namely the 3D yard allocation problem with time dimension (3DYAPT), that determines the container storage locations in a given storage block to satisfy requirements from batches of arrived containers. The objective is to minimize the two-dimensional area of the storage block occupied for temporarily storing the containers within a given planning horizon (time dimension). The 3DYAPT is challenging and proved to be strongly NP-hard since it requires dynamically adjusting the shape of the allocated area when placing containers from the same request. We formulate the 3DYAPT as an integer linear programming model and develop a simulated annealing-based dynamic shape adjustment and placement algorithm (SA-DSAP). The simulated annealing-based algorithm comprises a novel dynamic programming procedure with several speed-up techniques that sequentially computes the storage space solution given a particular sequence of requests. Extensive computational experiments are conducted, showing that SA-DSAP is capable of finding optimal solutions very efficiently for nearly all small instances. For large instances, we also find that SA-DSAP produces significantly better heuristic solutions than the existing algorithm from the literature.

Optimal Allocation and Control of EV Energy Storage in Microgrids

Next Generation smart grid (SG) systems blend legacy power system networks and the latest state-of-the-art ICT technologies to ensure the efficiency, robustness as well as reliability of the former (power systems). The duplex flow of both information and energy enhances energy supply and de-mand response, as well as SG-related innovative business-oriented applications and services. Renewable generators (RGs) and Electric Vehicles (EVs) are becoming prominent in any SG setup as they promote environmental friendliness. The presence of both necessitates the optimal allocation of dis-tributed renewable generation (DRG) and energy storage sys-tems (ESS) at both SG and microgrid (MG) levels. In that way, grid stability will be always ensured. The paper describes and discusses an optimized ESS deployment approach for serving EVs (as they are one of the largest consumers of stored energy) and DRGs. Careful consideration of the state of the ESS is also considered by developing and applying a dynamic capacity adjustment algorithm to deal with the none-smooth cost func-tions. The proposed cost function takes into consideration the operation as well as investment cost minimization concurrently. The matrix real-coded genetic algorithm (MRCGA) is used to minimize the cost function of the system while constraining it to meet the customer demand, as well as the security of the system overall. The computational simulation results are presented to verify the effectiveness of the proposed method. The electricity network model is simplified using a virtual subnode concept to alleviate the computational load burden of a node's agent. Simulation results demonstrate the feasibility and stability of this dispatch strategy. Overall, our proposed framework and obtained results set a benchmark for the realization of agent-based coordination algorithms to solve the optimal dispatch problem