With the advancement of technology,the collaboration of multiple unmanned aerial vehicles(multi-UAVs)is a general trend,both in military and civilian domains.Path planning is a crucial step for multi-UAV mission execu...With the advancement of technology,the collaboration of multiple unmanned aerial vehicles(multi-UAVs)is a general trend,both in military and civilian domains.Path planning is a crucial step for multi-UAV mission execution,it is a nonlinear problem with constraints.Traditional optimization algorithms have difficulty in finding the optimal solution that minimizes the cost function under various constraints.At the same time,robustness should be taken into account to ensure the reliable and safe operation of the UAVs.In this paper,a self-adaptive sparrow search algorithm(SSA),denoted as DRSSA,is presented.During optimization,a dynamic population strategy is used to allocate the searching effort between exploration and exploitation;a t-distribution perturbation coefficient is proposed to adaptively adjust the exploration range;a random learning strategy is used to help the algorithm from falling into the vicinity of the origin and local optimums.The convergence of DRSSA is tested by 29 test functions from the Institute of Electrical and Electronics Engineers(IEEE)Congress on Evolutionary Computation(CEC)2017 benchmark suite.Furthermore,a stochastic optimization strategy is introduced to enhance safety in the path by accounting for potential perturbations.Two sets of simulation experiments on multi-UAV path planning in three-dimensional environments demonstrate that the algorithm exhibits strong optimization capabilities and robustness in dealing with uncertain situations.展开更多
In existing research,the optimization of algorithms applied to cloud manufacturing service composition based on the quality of service often suffers from decreased convergence rates and solution quality due to single-...In existing research,the optimization of algorithms applied to cloud manufacturing service composition based on the quality of service often suffers from decreased convergence rates and solution quality due to single-population searches in fixed spaces and insufficient information exchange.In this paper,we introduce an improved Sparrow Search Algorithm(ISSA)to address these issues.The fixed solution space is divided into multiple subspaces,allowing for parallel searches that expedite the discovery of target solutions.To enhance search efficiency within these subspaces and significantly improve population diversity,we employ multiple group evolution mechanisms and chaotic perturbation strategies.Furthermore,we incorporate adaptive weights and a global capture strategy based on the golden sine to guide individual discoverers more effectively.Finally,differential Cauchy mutation perturbation is utilized during sparrow position updates to strengthen the algorithm's global optimization capabilities.Simulation experiments on benchmark problems and service composition optimization problems show that the ISSA delivers superior optimization accuracy and convergence stability compared to other methods.These results demonstrate that our approach effectively balances global and local search abilities,leading to enhanced performance in cloud manufacturing service composition.展开更多
基金Foundation items:National Natural Science Foundation of China(No.62303108)Fundamental Research Funds for the Central Universities,China(No.CUSF-DH-T-2023065)。
文摘With the advancement of technology,the collaboration of multiple unmanned aerial vehicles(multi-UAVs)is a general trend,both in military and civilian domains.Path planning is a crucial step for multi-UAV mission execution,it is a nonlinear problem with constraints.Traditional optimization algorithms have difficulty in finding the optimal solution that minimizes the cost function under various constraints.At the same time,robustness should be taken into account to ensure the reliable and safe operation of the UAVs.In this paper,a self-adaptive sparrow search algorithm(SSA),denoted as DRSSA,is presented.During optimization,a dynamic population strategy is used to allocate the searching effort between exploration and exploitation;a t-distribution perturbation coefficient is proposed to adaptively adjust the exploration range;a random learning strategy is used to help the algorithm from falling into the vicinity of the origin and local optimums.The convergence of DRSSA is tested by 29 test functions from the Institute of Electrical and Electronics Engineers(IEEE)Congress on Evolutionary Computation(CEC)2017 benchmark suite.Furthermore,a stochastic optimization strategy is introduced to enhance safety in the path by accounting for potential perturbations.Two sets of simulation experiments on multi-UAV path planning in three-dimensional environments demonstrate that the algorithm exhibits strong optimization capabilities and robustness in dealing with uncertain situations.
基金Supported by the National Natural Science Foundation of China(62272214)。
文摘In existing research,the optimization of algorithms applied to cloud manufacturing service composition based on the quality of service often suffers from decreased convergence rates and solution quality due to single-population searches in fixed spaces and insufficient information exchange.In this paper,we introduce an improved Sparrow Search Algorithm(ISSA)to address these issues.The fixed solution space is divided into multiple subspaces,allowing for parallel searches that expedite the discovery of target solutions.To enhance search efficiency within these subspaces and significantly improve population diversity,we employ multiple group evolution mechanisms and chaotic perturbation strategies.Furthermore,we incorporate adaptive weights and a global capture strategy based on the golden sine to guide individual discoverers more effectively.Finally,differential Cauchy mutation perturbation is utilized during sparrow position updates to strengthen the algorithm's global optimization capabilities.Simulation experiments on benchmark problems and service composition optimization problems show that the ISSA delivers superior optimization accuracy and convergence stability compared to other methods.These results demonstrate that our approach effectively balances global and local search abilities,leading to enhanced performance in cloud manufacturing service composition.
