In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms...In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set.展开更多
In the parallel steering coordination control strategy for path tracking,it is difficult to match the current driver steering model using the fixed parameters with the actual driver,and the designed steering coordinat...In the parallel steering coordination control strategy for path tracking,it is difficult to match the current driver steering model using the fixed parameters with the actual driver,and the designed steering coordination control strategy under a single objective and simple conditions is difficult to adapt to the multi-dimensional state variables’input.In this paper,we propose a deep reinforcement learning algorithm-based multi-objective parallel human-machine steering coordination strategy for path tracking considering driver misoperation and external disturbance.Firstly,the driver steering mathematical model is constructed based on the driver preview characteristics and steering delay response,and the driver characteristic parameters are fitted after collecting the actual driver driving data.Secondly,considering that the vehicle is susceptible to the influence of external disturbances during the driving process,the Tube MPC(Tube Model Predictive Control)based path tracking steering controller is designed based on the vehicle system dynamics error model.After verifying that the driver steering model meets the driver steering operation characteristics,DQN(Deep Q-network),DDPG(Deep Deterministic Policy Gradient)and TD3(Twin Delayed Deep Deterministic Policy Gradient)deep reinforcement learning algorithms are utilized to design a multi-objective parallel steering coordination strategy which satisfies the multi-dimensional state variables’input of the vehicle.Finally,the tracking accuracy,lateral safety,human-machine conflict and driver steering load evaluation index are designed in different driver operation states and different road environments,and the performance of the parallel steering coordination control strategies with different deep reinforcement learning algorithms and fuzzy algorithms are compared by simulations and hardware in the loop experiments.The results show that the parallel steering collaborative strategy based on a deep reinforcement learning algorithm can more effectively assist the driver in tracking the target path under lateral wind interference and driver misoperation,and the TD3-based coordination control strategy has better overall performance.展开更多
Unmanned aerial vehicles(UAVs)are widely used in situations with uncertain and risky areas lacking network coverage.In natural disasters,timely delivery of first aid supplies is crucial.Current UAVs face risks such as...Unmanned aerial vehicles(UAVs)are widely used in situations with uncertain and risky areas lacking network coverage.In natural disasters,timely delivery of first aid supplies is crucial.Current UAVs face risks such as crashing into birds or unexpected structures.Airdrop systems with parachutes risk dispersing payloads away from target locations.The objective here is to use multiple UAVs to distribute payloads cooperatively to assigned locations.The civil defense department must balance coverage,accurate landing,and flight safety while considering battery power and capability.Deep Q-network(DQN)models are commonly used in multi-UAV path planning to effectively represent the surroundings and action spaces.Earlier strategies focused on advanced DQNs for UAV path planning in different configurations,but rarely addressed non-cooperative scenarios and disaster environments.This paper introduces a new DQN framework to tackle challenges in disaster environments.It considers unforeseen structures and birds that could cause UAV crashes and assumes urgent landing zones and winch-based airdrop systems for precise delivery and return.A new DQN model is developed,which incorporates the battery life,safe flying distance between UAVs,and remaining delivery points to encode surrounding hazards into the state space and Q-networks.Additionally,a unique reward system is created to improve UAV action sequences for better delivery coverage and safe landings.The experimental results demonstrate that multi-UAV first aid delivery in disaster environments can achieve advanced performance.展开更多
Aiming at the problem of low convergence efficiency of traditional multi-UAV path planning algorithms in unknown complex environments,this paper proposes a deep reinforcement learning algorithm incorporating the atten...Aiming at the problem of low convergence efficiency of traditional multi-UAV path planning algorithms in unknown complex environments,this paper proposes a deep reinforcement learning algorithm incorporating the attention mechanism.The method is based on the Soft Actor-Critic(SAC)framework,which introduces a multi-attention mechanism in the Critic network,dynamically learns the dependency relationship between intelligences,and realizes key information screening and conflict avoidance.An environment with multiple random obstacles is designed to simulate complex emergent situations.The results show that the proposed algorithm significantly improves the mission success rate and average reward,significantly extends the survival time and exploration range of the UAVs,and verifies the effectiveness of the attention mechanism in enhancing the efficiency,robustness,and long-term planning capability of multi-UAV collaboration,as compared to the baseline method that does not use attention.展开更多
Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threat...Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threaten flight safety and mission success.Traditional path planning methods typically depend solely on the distribution of static obstacles to generate collision-free paths,without accounting for constraints imposed by enemy detection and strike capabilities.Such a simplified approach can yield safety-compromising routes in highly complex urban airspace.To address these limitations,this study proposes a multi-parameter path planning method based on reachable airspace visibility graphs,which integrates UAV performance constraints,environmental limitations,and exposure risks.An innovative heuristic algorithm is developed to balance operational safety and efficiency by both exposure risks and path length.In the case study set in a typical mixed-use urban area,analysis of airspace visibility graphs reveals significant variations in exposure risk at different regions and altitudes due to building encroachments.Path optimization results indicate that the method can effectively generate covert and efficient flight paths by dynamically adjusting the exposure index,which represents the likelihood of enemy detection,and the path length,which corresponds to mission execution time.展开更多
Solving the path planning problem of Autonomous Underwater Vehicles(AUVs)is crucial for reducing energy waste and improving operational efficiency.However,two main challenges hinder further development:Firstly,existin...Solving the path planning problem of Autonomous Underwater Vehicles(AUVs)is crucial for reducing energy waste and improving operational efficiency.However,two main challenges hinder further development:Firstly,existing algorithms often treat this as a single-objective optimization problem,whereas in reality,it should be multi-objective,considering factors such as distance,safety,and smoothness simultaneously.Secondly,the limited availability of optimization results arises due to they are single-path,which fail to meet real-world conditions.To address these challenges,first of all,an improved AUV path planning model is proposed,in which the collisions of path and obstacles are classified more specifically.Subsequently,a novel Altruistic Nurturing Algorithm(ANA)inspired by natural altruism is introduced.In the algorithm,nurturing cost considering Pareto rank and crowd distance is introduced as guidance of evolution to avoid futile calculation,abandonment threshold is self-adaptive with descendant situation to help individuals escape from local optima and double selection strategy combining crowd and k-nearest neighbors selection helps to get a better-distributed Pareto front.Experimental results comparing ANA with existing algorithms in AUV path planning demonstrate its superiority.Finally,a user-friendly interface,the Multi-Objective AUV Path Planner,is designed to provide users with a group of paths for informed decisionmaking.展开更多
To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic ...To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.展开更多
To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO al...To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO algorithm utilizes a semi-rasterization environment modeling technique and inte-grates the geometric gradient law of ASMs which distinguishes itself from other collaborative path planning algorithms by fully considering the coupling between collaborative paths. Then, MRC-PSO algorithm conducts chunked stepwise recursive evo-lution of particles while incorporating circumvent, coordination, and smoothing operators which facilitates local selection opti-mization of paths, gradually reducing algorithmic space, accele-rating convergence, and enhances path cooperativity. Simula-tion experiments comparing the MRC-PSO algorithm with the PSO algorithm, genetic algorithm and operational area cluster real-time restriction (OACRR)-PSO algorithm, which demon-strate that the MRC-PSO algorithm has a faster convergence speed, and the average number of iterations is reduced by approximately 75%. It also proves that it is equally effective in resolving complex scenarios involving multiple obstacles. More-over it effectively addresses the problem of path crossing and can better satisfy the requirements of multi-platform collabora-tive path planning. The experiments are conducted in three col-laborative operation modes, namely, three-to-two, three-to-three, and four-to-two, and the outcomes demonstrate that the algorithm possesses strong universality.展开更多
Discussions on Chinese modernization are offering African countries both conceptual inspiration and practical references as they explore their own sustainable development paths.
Q-learning is a classical reinforcement learning method with broad applicability.It can respond effectively to environmental changes and provide flexible strategies,making it suitable for solving robot path-planning p...Q-learning is a classical reinforcement learning method with broad applicability.It can respond effectively to environmental changes and provide flexible strategies,making it suitable for solving robot path-planning problems.However,Q-learning faces challenges in search and update efficiency.To address these issues,we propose an improved Q-learning(IQL)algorithm.We use an enhanced Ant Colony Optimization(ACO)algorithmto optimizeQtable initialization.We also introduce the UCH mechanism to refine the reward function and overcome the exploration dilemma.The IQL algorithm is extensively tested in three grid environments of different scales.The results validate the accuracy of themethod and demonstrate superior path-planning performance compared to traditional approaches.The algorithm reduces the number of trials required for convergence,improves learning efficiency,and enables faster adaptation to environmental changes.It also enhances stability and accuracy by reducing the standard deviation of trials to zero.On grid maps of different sizes,IQL achieves higher expected returns.Compared with the original Q-learning algorithm,IQL improves performance by 12.95%,18.28%,and 7.98% on 10*10,20*20,and 30*30 maps,respectively.The proposed algorithm has promising applications in robotics,path planning,intelligent transportation,aerospace,and game development.展开更多
Topological phases are governed by lattice symmetries,yet how different symmetry-breaking paths(SBPs)affect topological transitions remains insufficiently understood.Most existing studies rely on a single SBP,and addr...Topological phases are governed by lattice symmetries,yet how different symmetry-breaking paths(SBPs)affect topological transitions remains insufficiently understood.Most existing studies rely on a single SBP,and address only one bandgap,limiting independent control of multiple gaps.Here,we investigate multiple isolated Dirac points in a trefoil-knot-modified honeycomb lattice,and show that a single SBP generally inverts all relevant Dirac points simultaneously,whereas the tailored combinations of SBPs enable selective and programmable band inversion at targeted gaps.The excitation-dependent responses reveal strong modal selectivity.This capability is exploited to realize independently controllable multi-channel signal splitting,which is unattainable with a single SBP.The results enable SBPs as an effective design degree of freedom for programmable and reconfigurable topological elastic devices.展开更多
Rapidly-exploring Random Tree(RRT)and its variants have become foundational in path-planning research,yet in complex three-dimensional off-road environments their uniform blind sampling and limited safety guarantees l...Rapidly-exploring Random Tree(RRT)and its variants have become foundational in path-planning research,yet in complex three-dimensional off-road environments their uniform blind sampling and limited safety guarantees lead to slow convergence and force an unfavorable trade-off between path quality and traversal safety.To address these challenges,we introduce HS-APF-RRT*,a novel algorithm that fuses layered sampling,an enhanced Artificial Potential Field(APF),and a dynamic neighborhood-expansion mechanism.First,the workspace is hierarchically partitioned into macro,meso,and micro sampling layers,progressively biasing random samples toward safer,lower-energy regions.Second,we augment the traditional APF by incorporating a slope-dependent repulsive term,enabling stronger avoidance of steep obstacles.Third,a dynamic expansion strategy adaptively switches between 8 and 16 connected neighborhoods based on local obstacle density,striking an effective balance between search efficiency and collision-avoidance precision.In simulated off-road scenarios,HS-APF-RRT*is benchmarked against RRT*,GoalBiased RRT*,and APF-RRT*,and demonstrates significantly faster convergence,lower path-energy consumption,and enhanced safety margins.展开更多
To address low learning efficiency and inadequate path safety in spraying robot navigation within complex obstacle-rich environments—with dense,dynamic,unpredictable obstacles challenging conventional methods—this p...To address low learning efficiency and inadequate path safety in spraying robot navigation within complex obstacle-rich environments—with dense,dynamic,unpredictable obstacles challenging conventional methods—this paper proposes a hybrid algorithm integrating Q-learning and improved A*-Artificial Potential Field(A-APF).Centered on theQ-learning framework,the algorithmleverages safety-oriented guidance generated byA-APF and employs a dynamic coordination mechanism that adaptively balances exploration and exploitation.The proposed system comprises four core modules:(1)an environment modeling module that constructs grid-based obstacle maps;(2)an A-APF module that combines heuristic search from A*algorithm with repulsive force strategies from APF to generate guidance;(3)a Q-learning module that learns optimal state-action values(Q-values)through spraying robot-environment interaction and a reward function emphasizing path optimality and safety;and(4)a dynamic optimization module that ensures adaptive cooperation between Q-learning and A-APF through exploration rate control and environment-aware constraints.Simulation results demonstrate that the proposed method significantly enhances path safety in complex underground mining environments.Quantitative results indicate that,compared to the traditional Q-learning algorithm,the proposed method shortens training time by 42.95% and achieves a reduction in training failures from 78 to just 3.Compared to the static fusion algorithm,it further reduces both training time(by 10.78%)and training failures(by 50%),thereby improving overall training efficiency.展开更多
Researchers are increasingly focused on enabling groups of multiple unmanned vehicles to operate cohesively in complex,real-world environments,where coordinated formation control and obstacle avoidance are essential f...Researchers are increasingly focused on enabling groups of multiple unmanned vehicles to operate cohesively in complex,real-world environments,where coordinated formation control and obstacle avoidance are essential for executing sophisticated collective tasks.This paper presents a Distributed Formation Control and Obstacle Avoidance(DFCOA)framework for multi-unmanned ground vehicles(UGV).DFCOA integrates a virtual leader structure for global guidance,an improved A^(*)path planning algorithm with an advanced cost function for efficient path planning,and a repulsive-force-based improved vector field histogram star(VFH^(*))technique for collision avoidance.The virtual leader generates a reference trajectory while enabling distributed execution;the improved A^(*)algorithm reduces planning time and number of nodes to determine the shortest path from the starting position to the goal;and the improved VFH^(*)uses 2D LiDAR data with inter-agent repulsive force to simultaneously avoid collision with obstacles and maintain safe inter-vehicle distances.The formation stability of the proposed DFCOA reaches 95.8%and 94.6%in two scenarios,with root mean square(RMS)centroid errors of 0.9516 and 1.0008 m,respectively.Velocity tracking is precise(velocity centroid error RMS of 0.2699 and 0.1700 m/s),and linear velocities closely match the desired 0.3 m/s.Safety metrics showed average collision risks of 0.7773 and 0.5143,with minimum inter-vehicle distances of 0.4702 and 0.8763 m,confirming collision-free navigation of four UGVs.DFCOA outperforms conventional methods in formation stability,path efficiency,and scalability,proving its suitability for decentralized multi-UGV applications.展开更多
This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japo...This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japonicus.The math-ematical model is developed by simulating various biological behaviors of the Gekko japonicus,such as hybrid loco-motion patterns,directional olfactory guidance,implicit group advantage tendencies,and the tail autotomy mechanism.By integrating multi-stage mutual constraints and dynamically adjusting parameters,GJA maintains an optimal balance between global exploration and local exploitation,thereby effectively solving complex optimization problems.To assess the performance of GJA,comparative analyses were performed against fourteen state-of-the-art metaheuristic algorithms using the CEC2017 and CEC2022 benchmark test sets.Additionally,a Friedman test was performed on the experimen-tal results to assess the statistical significance of differences between various algorithms.And GJA was evaluated using multiple qualitative indicators,further confirming its superiority in exploration and exploitation.Finally,GJA was utilized to solve four engineering optimization problems and further implemented in robotic path planning to verify its practical applicability.Experimental results indicate that,compared to other high-performance algorithms,GJA demonstrates excep-tional performance as a powerful optimization algorithm in complex optimization problems.We make the code publicly available at:https://github.com/zhy1109/Gekko-japonicusalgorithm.展开更多
Spectrum map construction,which is crucial in cognitive radio(CR)system,visualizes the invisible space of the electromagnetic spectrum for spectrum-resource management and allocation.Traditional reconstruction methods...Spectrum map construction,which is crucial in cognitive radio(CR)system,visualizes the invisible space of the electromagnetic spectrum for spectrum-resource management and allocation.Traditional reconstruction methods are generally for twodimensional(2D)spectrum map and driven by abundant sampling data.In this paper,we propose a data-model-knowledge-driven reconstruction scheme to construct the three-dimensional(3D)spectrum map under multi-radiation source scenarios.We firstly design a maximum and minimum path loss difference(MMPLD)clustering algorithm to detect the number of radiation sources in a 3D space.Then,we develop a joint location-power estimation method based on the heuristic population evolutionary optimization algorithm.Considering the variation of electromagnetic environment,we self-learn the path loss(PL)model based on the sampling data.Finally,the 3D spectrum is reconstructed according to the self-learned PL model and the extracted knowledge of radiation sources.Simulations show that the proposed 3D spectrum map reconstruction scheme not only has splendid adaptability to the environment,but also achieves high spectrum construction accuracy even when the sampling rate is very low.展开更多
With the rapid development of intelligent navigation technology,efficient and safe path planning for mobile robots has become a core requirement.To address the challenges of complex dynamic environments,this paper pro...With the rapid development of intelligent navigation technology,efficient and safe path planning for mobile robots has become a core requirement.To address the challenges of complex dynamic environments,this paper proposes an intelligent path planning framework based on grid map modeling.First,an improved Safe and Smooth A*(SSA*)algorithm is employed for global path planning.By incorporating obstacle expansion and cornerpoint optimization,the proposed SSA*enhances the safety and smoothness of the planned path.Then,a Partitioned Dynamic Window Approach(PDWA)is integrated for local planning,which is triggered when dynamic or sudden static obstacles appear,enabling real-time obstacle avoidance and path adjustment.A unified objective function is constructed,considering path length,safety,and smoothness comprehensively.Multiple simulation experiments are conducted on typical port grid maps.The results demonstrate that the improved SSA*significantly reduces the number of expanded nodes and computation time in static environmentswhile generating smoother and safer paths.Meanwhile,the PDWA exhibits strong real-time performance and robustness in dynamic scenarios,achieving shorter paths and lower planning times compared to other graph search algorithms.The proposedmethodmaintains stable performance across maps of different scales and various port scenarios,verifying its practicality and potential for wider application.展开更多
Efficient multiple unmanned aerial vehicles(UAVs)path planning is crucial for improving mission completion efficiency in UAV operations.However,during the actual flight of UAVs,the flight time between nodes is always ...Efficient multiple unmanned aerial vehicles(UAVs)path planning is crucial for improving mission completion efficiency in UAV operations.However,during the actual flight of UAVs,the flight time between nodes is always influenced by external factors,making the original path planning solution ineffective.In this paper,the multi-depot multi-UAV path planning problem with uncertain flight time is modeled as a robust optimization model with a budget uncertainty set.Then,the robust optimization model is transformed into a mixed integer linear programming model by the strong duality theorem,which makes the problem easy to solve.To effectively solve large-scale instances,a simulated annealing algorithm with a robust feasibility check(SA-RFC)is developed.The numerical experiment shows that the SA-RFC can find high-quality solutions within a few seconds.Moreover,the effect of the task location distribution,depot counts,and variations in robustness parameters on the robust optimization solution is analyzed by using Monte Carlo experiments.The results demonstrate that the proposed robust model can effectively reduce the risk of the UAV failing to return to the depot without significantly compromising the profit.展开更多
Shenzhen,a major city in southern China,has experienced rapid advancements in Unmanned Aerial Vehicle(UAV)technology,resulting in extensive logistics networks with thousands of daily flights.However,frequent disruptio...Shenzhen,a major city in southern China,has experienced rapid advancements in Unmanned Aerial Vehicle(UAV)technology,resulting in extensive logistics networks with thousands of daily flights.However,frequent disruptions due to its subtropical monsoon climate,including typhoons and gusty winds,present ongoing challenges.Despite the growing focus on operational costs and third-party risks,research on low-altitude urban wind fields remains scarce.This study addresses this gap by integrating wind field analysis into UAV path planning,introducing key innovations to the classical model.First,UAV wind resistance and turbulence constraints are analyzed,mapping high-wind-speed and turbulence-prone zones in the airspace.Second,wind dynamics are incorporated into path planning by considering airspeed and groundspeed variation,optimizing waypoint selection and flight speed adjustments to improve overall energy efficiency.Additionally,a wind-aware Theta*algorithm is proposed,leveraging wind vectors to expedite search process,while Computational Fluid Dynamics(CFD)techniques are employed to calculate wind fields.A case study of Shenzhen,examining wind patterns over the past decade,demonstrates a 6.23%improvement in groundspeed and a 7.69%reduction in energy consumption compared to wind-agnostic models.This framework advances UAV logistics by enhancing route safety and energy efficiency,contributing to more cost-effective operations.展开更多
A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles(USVs)to perform autonomous navigation tasks.However,a single global or local planning strategy cannot fully meet the requirement...A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles(USVs)to perform autonomous navigation tasks.However,a single global or local planning strategy cannot fully meet the requirements of complex maritime environments.Global planning alone cannot effectively handle dynamic obstacles,while local planning alone may fall into local optima.To address these issues,this paper proposes a multi-dynamic-obstacle avoidance path planning method that integrates an improved A^(*)algorithm with the dynamic window approach(DWA).The traditional A^(*)algorithm often generates paths that are too close to obstacle boundaries and contain excessive turning points,whereas the traditional DWA tends to skirt densely clustered obstacles,resulting in longer routes and insufficient dynamic obstacle avoidance.To overcome these limitations,improved versions of both algorithms are developed.Key points extracted from the optimized A^(*)path are used as intermediate start-destination pairs for the improved DWA,and the weights of the DWA evaluation function are adjusted to achieve effective fusion.Furthermore,a multi-dynamic-obstacle avoidance strategy is designed for complex navigation scenarios.Simulation results demonstrate that the USV can adaptively switch between dynamic obstacle avoidance and path tracking based on obstacle distribution,validating the effectiveness of the proposed method.展开更多
基金supported by the National Natural Science Foundation of China(No.62373027).
文摘In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set.
基金Supported by National Natural Science Foundation of China(Grant Nos.U22A20246,52372382)Hefei Municipal Natural Science Foundation(Grant No.2022008)+1 种基金the Open Fund of State Key Laboratory of Mechanical Behavior and System Safety of Traffic Engineering Structures(Grant No.KF2023-06)S&T Program of Hebei(Grant No.225676162GH).
文摘In the parallel steering coordination control strategy for path tracking,it is difficult to match the current driver steering model using the fixed parameters with the actual driver,and the designed steering coordination control strategy under a single objective and simple conditions is difficult to adapt to the multi-dimensional state variables’input.In this paper,we propose a deep reinforcement learning algorithm-based multi-objective parallel human-machine steering coordination strategy for path tracking considering driver misoperation and external disturbance.Firstly,the driver steering mathematical model is constructed based on the driver preview characteristics and steering delay response,and the driver characteristic parameters are fitted after collecting the actual driver driving data.Secondly,considering that the vehicle is susceptible to the influence of external disturbances during the driving process,the Tube MPC(Tube Model Predictive Control)based path tracking steering controller is designed based on the vehicle system dynamics error model.After verifying that the driver steering model meets the driver steering operation characteristics,DQN(Deep Q-network),DDPG(Deep Deterministic Policy Gradient)and TD3(Twin Delayed Deep Deterministic Policy Gradient)deep reinforcement learning algorithms are utilized to design a multi-objective parallel steering coordination strategy which satisfies the multi-dimensional state variables’input of the vehicle.Finally,the tracking accuracy,lateral safety,human-machine conflict and driver steering load evaluation index are designed in different driver operation states and different road environments,and the performance of the parallel steering coordination control strategies with different deep reinforcement learning algorithms and fuzzy algorithms are compared by simulations and hardware in the loop experiments.The results show that the parallel steering collaborative strategy based on a deep reinforcement learning algorithm can more effectively assist the driver in tracking the target path under lateral wind interference and driver misoperation,and the TD3-based coordination control strategy has better overall performance.
基金supported by the Committee of Science of the Ministry of Education and Science of the Republic of Kazakhstan under Grant No.249015/0224.
文摘Unmanned aerial vehicles(UAVs)are widely used in situations with uncertain and risky areas lacking network coverage.In natural disasters,timely delivery of first aid supplies is crucial.Current UAVs face risks such as crashing into birds or unexpected structures.Airdrop systems with parachutes risk dispersing payloads away from target locations.The objective here is to use multiple UAVs to distribute payloads cooperatively to assigned locations.The civil defense department must balance coverage,accurate landing,and flight safety while considering battery power and capability.Deep Q-network(DQN)models are commonly used in multi-UAV path planning to effectively represent the surroundings and action spaces.Earlier strategies focused on advanced DQNs for UAV path planning in different configurations,but rarely addressed non-cooperative scenarios and disaster environments.This paper introduces a new DQN framework to tackle challenges in disaster environments.It considers unforeseen structures and birds that could cause UAV crashes and assumes urgent landing zones and winch-based airdrop systems for precise delivery and return.A new DQN model is developed,which incorporates the battery life,safe flying distance between UAVs,and remaining delivery points to encode surrounding hazards into the state space and Q-networks.Additionally,a unique reward system is created to improve UAV action sequences for better delivery coverage and safe landings.The experimental results demonstrate that multi-UAV first aid delivery in disaster environments can achieve advanced performance.
文摘Aiming at the problem of low convergence efficiency of traditional multi-UAV path planning algorithms in unknown complex environments,this paper proposes a deep reinforcement learning algorithm incorporating the attention mechanism.The method is based on the Soft Actor-Critic(SAC)framework,which introduces a multi-attention mechanism in the Critic network,dynamically learns the dependency relationship between intelligences,and realizes key information screening and conflict avoidance.An environment with multiple random obstacles is designed to simulate complex emergent situations.The results show that the proposed algorithm significantly improves the mission success rate and average reward,significantly extends the survival time and exploration range of the UAVs,and verifies the effectiveness of the attention mechanism in enhancing the efficiency,robustness,and long-term planning capability of multi-UAV collaboration,as compared to the baseline method that does not use attention.
基金supported by the Ministry of Industry and Information Technology(No.23100002022102001)。
文摘Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threaten flight safety and mission success.Traditional path planning methods typically depend solely on the distribution of static obstacles to generate collision-free paths,without accounting for constraints imposed by enemy detection and strike capabilities.Such a simplified approach can yield safety-compromising routes in highly complex urban airspace.To address these limitations,this study proposes a multi-parameter path planning method based on reachable airspace visibility graphs,which integrates UAV performance constraints,environmental limitations,and exposure risks.An innovative heuristic algorithm is developed to balance operational safety and efficiency by both exposure risks and path length.In the case study set in a typical mixed-use urban area,analysis of airspace visibility graphs reveals significant variations in exposure risk at different regions and altitudes due to building encroachments.Path optimization results indicate that the method can effectively generate covert and efficient flight paths by dynamically adjusting the exposure index,which represents the likelihood of enemy detection,and the path length,which corresponds to mission execution time.
基金supported by the Guangzhou City School Joint Found Project(SL2022A03J01009)the National Nature Science Foundation of China(Grant No.51975135)the Natural Science Foundation of Guangdong Province(2018A030310063).
文摘Solving the path planning problem of Autonomous Underwater Vehicles(AUVs)is crucial for reducing energy waste and improving operational efficiency.However,two main challenges hinder further development:Firstly,existing algorithms often treat this as a single-objective optimization problem,whereas in reality,it should be multi-objective,considering factors such as distance,safety,and smoothness simultaneously.Secondly,the limited availability of optimization results arises due to they are single-path,which fail to meet real-world conditions.To address these challenges,first of all,an improved AUV path planning model is proposed,in which the collisions of path and obstacles are classified more specifically.Subsequently,a novel Altruistic Nurturing Algorithm(ANA)inspired by natural altruism is introduced.In the algorithm,nurturing cost considering Pareto rank and crowd distance is introduced as guidance of evolution to avoid futile calculation,abandonment threshold is self-adaptive with descendant situation to help individuals escape from local optima and double selection strategy combining crowd and k-nearest neighbors selection helps to get a better-distributed Pareto front.Experimental results comparing ANA with existing algorithms in AUV path planning demonstrate its superiority.Finally,a user-friendly interface,the Multi-Objective AUV Path Planner,is designed to provide users with a group of paths for informed decisionmaking.
文摘To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.
基金supported by Hunan Provincial Natural Science Foundation(2024JJ5173,2023JJ50047)Hunan Provincial Department of Education Scientific Research Project(23A0494)Hunan Provincial Innovation Foundation for Postgraduate(CX20231221).
文摘To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO algorithm utilizes a semi-rasterization environment modeling technique and inte-grates the geometric gradient law of ASMs which distinguishes itself from other collaborative path planning algorithms by fully considering the coupling between collaborative paths. Then, MRC-PSO algorithm conducts chunked stepwise recursive evo-lution of particles while incorporating circumvent, coordination, and smoothing operators which facilitates local selection opti-mization of paths, gradually reducing algorithmic space, accele-rating convergence, and enhances path cooperativity. Simula-tion experiments comparing the MRC-PSO algorithm with the PSO algorithm, genetic algorithm and operational area cluster real-time restriction (OACRR)-PSO algorithm, which demon-strate that the MRC-PSO algorithm has a faster convergence speed, and the average number of iterations is reduced by approximately 75%. It also proves that it is equally effective in resolving complex scenarios involving multiple obstacles. More-over it effectively addresses the problem of path crossing and can better satisfy the requirements of multi-platform collabora-tive path planning. The experiments are conducted in three col-laborative operation modes, namely, three-to-two, three-to-three, and four-to-two, and the outcomes demonstrate that the algorithm possesses strong universality.
文摘Discussions on Chinese modernization are offering African countries both conceptual inspiration and practical references as they explore their own sustainable development paths.
基金Financial supports from the National Natural Science Foundation of China(GrantNo.52374123&51974144)Project of Liaoning Provincial Department of Education(GrantNo.LJKZ0340)Liaoning Revitalization Talents Program(Grant No.XLYC2211085)are greatly acknowledged.
文摘Q-learning is a classical reinforcement learning method with broad applicability.It can respond effectively to environmental changes and provide flexible strategies,making it suitable for solving robot path-planning problems.However,Q-learning faces challenges in search and update efficiency.To address these issues,we propose an improved Q-learning(IQL)algorithm.We use an enhanced Ant Colony Optimization(ACO)algorithmto optimizeQtable initialization.We also introduce the UCH mechanism to refine the reward function and overcome the exploration dilemma.The IQL algorithm is extensively tested in three grid environments of different scales.The results validate the accuracy of themethod and demonstrate superior path-planning performance compared to traditional approaches.The algorithm reduces the number of trials required for convergence,improves learning efficiency,and enables faster adaptation to environmental changes.It also enhances stability and accuracy by reducing the standard deviation of trials to zero.On grid maps of different sizes,IQL achieves higher expected returns.Compared with the original Q-learning algorithm,IQL improves performance by 12.95%,18.28%,and 7.98% on 10*10,20*20,and 30*30 maps,respectively.The proposed algorithm has promising applications in robotics,path planning,intelligent transportation,aerospace,and game development.
基金Project supported by the National Natural Science Foundation of China(Nos.12232015 and12572106)the National Key R&D Program of China(Nos.2024YFB3408700,2024YFB3408701,2024YFB3408703)the Natural Science Foundation of Shaanxi Province of China(No.2023-JC-YB-073)。
文摘Topological phases are governed by lattice symmetries,yet how different symmetry-breaking paths(SBPs)affect topological transitions remains insufficiently understood.Most existing studies rely on a single SBP,and address only one bandgap,limiting independent control of multiple gaps.Here,we investigate multiple isolated Dirac points in a trefoil-knot-modified honeycomb lattice,and show that a single SBP generally inverts all relevant Dirac points simultaneously,whereas the tailored combinations of SBPs enable selective and programmable band inversion at targeted gaps.The excitation-dependent responses reveal strong modal selectivity.This capability is exploited to realize independently controllable multi-channel signal splitting,which is unattainable with a single SBP.The results enable SBPs as an effective design degree of freedom for programmable and reconfigurable topological elastic devices.
基金supported in part by 14th Five Year National Key R&D Program Project(Project Number:2023YFB3211001)the National Natural Science Foundation of China(62273339,U24A201397).
文摘Rapidly-exploring Random Tree(RRT)and its variants have become foundational in path-planning research,yet in complex three-dimensional off-road environments their uniform blind sampling and limited safety guarantees lead to slow convergence and force an unfavorable trade-off between path quality and traversal safety.To address these challenges,we introduce HS-APF-RRT*,a novel algorithm that fuses layered sampling,an enhanced Artificial Potential Field(APF),and a dynamic neighborhood-expansion mechanism.First,the workspace is hierarchically partitioned into macro,meso,and micro sampling layers,progressively biasing random samples toward safer,lower-energy regions.Second,we augment the traditional APF by incorporating a slope-dependent repulsive term,enabling stronger avoidance of steep obstacles.Third,a dynamic expansion strategy adaptively switches between 8 and 16 connected neighborhoods based on local obstacle density,striking an effective balance between search efficiency and collision-avoidance precision.In simulated off-road scenarios,HS-APF-RRT*is benchmarked against RRT*,GoalBiased RRT*,and APF-RRT*,and demonstrates significantly faster convergence,lower path-energy consumption,and enhanced safety margins.
基金supported by the National Natural Science Foundation of China(Grant No.52374156).
文摘To address low learning efficiency and inadequate path safety in spraying robot navigation within complex obstacle-rich environments—with dense,dynamic,unpredictable obstacles challenging conventional methods—this paper proposes a hybrid algorithm integrating Q-learning and improved A*-Artificial Potential Field(A-APF).Centered on theQ-learning framework,the algorithmleverages safety-oriented guidance generated byA-APF and employs a dynamic coordination mechanism that adaptively balances exploration and exploitation.The proposed system comprises four core modules:(1)an environment modeling module that constructs grid-based obstacle maps;(2)an A-APF module that combines heuristic search from A*algorithm with repulsive force strategies from APF to generate guidance;(3)a Q-learning module that learns optimal state-action values(Q-values)through spraying robot-environment interaction and a reward function emphasizing path optimality and safety;and(4)a dynamic optimization module that ensures adaptive cooperation between Q-learning and A-APF through exploration rate control and environment-aware constraints.Simulation results demonstrate that the proposed method significantly enhances path safety in complex underground mining environments.Quantitative results indicate that,compared to the traditional Q-learning algorithm,the proposed method shortens training time by 42.95% and achieves a reduction in training failures from 78 to just 3.Compared to the static fusion algorithm,it further reduces both training time(by 10.78%)and training failures(by 50%),thereby improving overall training efficiency.
文摘Researchers are increasingly focused on enabling groups of multiple unmanned vehicles to operate cohesively in complex,real-world environments,where coordinated formation control and obstacle avoidance are essential for executing sophisticated collective tasks.This paper presents a Distributed Formation Control and Obstacle Avoidance(DFCOA)framework for multi-unmanned ground vehicles(UGV).DFCOA integrates a virtual leader structure for global guidance,an improved A^(*)path planning algorithm with an advanced cost function for efficient path planning,and a repulsive-force-based improved vector field histogram star(VFH^(*))technique for collision avoidance.The virtual leader generates a reference trajectory while enabling distributed execution;the improved A^(*)algorithm reduces planning time and number of nodes to determine the shortest path from the starting position to the goal;and the improved VFH^(*)uses 2D LiDAR data with inter-agent repulsive force to simultaneously avoid collision with obstacles and maintain safe inter-vehicle distances.The formation stability of the proposed DFCOA reaches 95.8%and 94.6%in two scenarios,with root mean square(RMS)centroid errors of 0.9516 and 1.0008 m,respectively.Velocity tracking is precise(velocity centroid error RMS of 0.2699 and 0.1700 m/s),and linear velocities closely match the desired 0.3 m/s.Safety metrics showed average collision risks of 0.7773 and 0.5143,with minimum inter-vehicle distances of 0.4702 and 0.8763 m,confirming collision-free navigation of four UGVs.DFCOA outperforms conventional methods in formation stability,path efficiency,and scalability,proving its suitability for decentralized multi-UGV applications.
基金CHINA POSTDOCTORAL SCIENCE FOUNDATION(Grant No.2025M771925)Young Scientists Fund(C Class)(Grant No.32501636)Special Fund of Fundamental Scientific Research Business Expense for Higher School of Central Government(Grant No.2572025JT04).
文摘This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japonicus.The math-ematical model is developed by simulating various biological behaviors of the Gekko japonicus,such as hybrid loco-motion patterns,directional olfactory guidance,implicit group advantage tendencies,and the tail autotomy mechanism.By integrating multi-stage mutual constraints and dynamically adjusting parameters,GJA maintains an optimal balance between global exploration and local exploitation,thereby effectively solving complex optimization problems.To assess the performance of GJA,comparative analyses were performed against fourteen state-of-the-art metaheuristic algorithms using the CEC2017 and CEC2022 benchmark test sets.Additionally,a Friedman test was performed on the experimen-tal results to assess the statistical significance of differences between various algorithms.And GJA was evaluated using multiple qualitative indicators,further confirming its superiority in exploration and exploitation.Finally,GJA was utilized to solve four engineering optimization problems and further implemented in robotic path planning to verify its practical applicability.Experimental results indicate that,compared to other high-performance algorithms,GJA demonstrates excep-tional performance as a powerful optimization algorithm in complex optimization problems.We make the code publicly available at:https://github.com/zhy1109/Gekko-japonicusalgorithm.
基金National Key Scientific Instrument and Equipment Development Project under Grant No.61827801the open research fund of State Key Laboratory of Integrated Services Networks,No.ISN22-11+1 种基金Natural Science Foundation of Jiangsu Province,No.BK20211182open research fund of National Mobile Communications Research Laboratory,Southeast University,No.2022D04。
文摘Spectrum map construction,which is crucial in cognitive radio(CR)system,visualizes the invisible space of the electromagnetic spectrum for spectrum-resource management and allocation.Traditional reconstruction methods are generally for twodimensional(2D)spectrum map and driven by abundant sampling data.In this paper,we propose a data-model-knowledge-driven reconstruction scheme to construct the three-dimensional(3D)spectrum map under multi-radiation source scenarios.We firstly design a maximum and minimum path loss difference(MMPLD)clustering algorithm to detect the number of radiation sources in a 3D space.Then,we develop a joint location-power estimation method based on the heuristic population evolutionary optimization algorithm.Considering the variation of electromagnetic environment,we self-learn the path loss(PL)model based on the sampling data.Finally,the 3D spectrum is reconstructed according to the self-learned PL model and the extracted knowledge of radiation sources.Simulations show that the proposed 3D spectrum map reconstruction scheme not only has splendid adaptability to the environment,but also achieves high spectrum construction accuracy even when the sampling rate is very low.
文摘With the rapid development of intelligent navigation technology,efficient and safe path planning for mobile robots has become a core requirement.To address the challenges of complex dynamic environments,this paper proposes an intelligent path planning framework based on grid map modeling.First,an improved Safe and Smooth A*(SSA*)algorithm is employed for global path planning.By incorporating obstacle expansion and cornerpoint optimization,the proposed SSA*enhances the safety and smoothness of the planned path.Then,a Partitioned Dynamic Window Approach(PDWA)is integrated for local planning,which is triggered when dynamic or sudden static obstacles appear,enabling real-time obstacle avoidance and path adjustment.A unified objective function is constructed,considering path length,safety,and smoothness comprehensively.Multiple simulation experiments are conducted on typical port grid maps.The results demonstrate that the improved SSA*significantly reduces the number of expanded nodes and computation time in static environmentswhile generating smoother and safer paths.Meanwhile,the PDWA exhibits strong real-time performance and robustness in dynamic scenarios,achieving shorter paths and lower planning times compared to other graph search algorithms.The proposedmethodmaintains stable performance across maps of different scales and various port scenarios,verifying its practicality and potential for wider application.
基金supported by the National Natural Science Foundation of China(72571094,72271076,71871079)。
文摘Efficient multiple unmanned aerial vehicles(UAVs)path planning is crucial for improving mission completion efficiency in UAV operations.However,during the actual flight of UAVs,the flight time between nodes is always influenced by external factors,making the original path planning solution ineffective.In this paper,the multi-depot multi-UAV path planning problem with uncertain flight time is modeled as a robust optimization model with a budget uncertainty set.Then,the robust optimization model is transformed into a mixed integer linear programming model by the strong duality theorem,which makes the problem easy to solve.To effectively solve large-scale instances,a simulated annealing algorithm with a robust feasibility check(SA-RFC)is developed.The numerical experiment shows that the SA-RFC can find high-quality solutions within a few seconds.Moreover,the effect of the task location distribution,depot counts,and variations in robustness parameters on the robust optimization solution is analyzed by using Monte Carlo experiments.The results demonstrate that the proposed robust model can effectively reduce the risk of the UAV failing to return to the depot without significantly compromising the profit.
基金supported by the National Natural Science Foundation of China(No.U2433214)。
文摘Shenzhen,a major city in southern China,has experienced rapid advancements in Unmanned Aerial Vehicle(UAV)technology,resulting in extensive logistics networks with thousands of daily flights.However,frequent disruptions due to its subtropical monsoon climate,including typhoons and gusty winds,present ongoing challenges.Despite the growing focus on operational costs and third-party risks,research on low-altitude urban wind fields remains scarce.This study addresses this gap by integrating wind field analysis into UAV path planning,introducing key innovations to the classical model.First,UAV wind resistance and turbulence constraints are analyzed,mapping high-wind-speed and turbulence-prone zones in the airspace.Second,wind dynamics are incorporated into path planning by considering airspeed and groundspeed variation,optimizing waypoint selection and flight speed adjustments to improve overall energy efficiency.Additionally,a wind-aware Theta*algorithm is proposed,leveraging wind vectors to expedite search process,while Computational Fluid Dynamics(CFD)techniques are employed to calculate wind fields.A case study of Shenzhen,examining wind patterns over the past decade,demonstrates a 6.23%improvement in groundspeed and a 7.69%reduction in energy consumption compared to wind-agnostic models.This framework advances UAV logistics by enhancing route safety and energy efficiency,contributing to more cost-effective operations.
基金supported by the National Nature Science Foundation of China(62203299,62373246,62388101)the Research Fund of State Key Laboratory of Deep-Sea Manned Vehicles(2024SKLDMV04)+1 种基金the Oceanic Interdisciplinary Program of Shanghai Jiao Tong University(SL2023MS007)the Startup Fund for Young Faculty at SJTU(24X010502929)。
文摘A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles(USVs)to perform autonomous navigation tasks.However,a single global or local planning strategy cannot fully meet the requirements of complex maritime environments.Global planning alone cannot effectively handle dynamic obstacles,while local planning alone may fall into local optima.To address these issues,this paper proposes a multi-dynamic-obstacle avoidance path planning method that integrates an improved A^(*)algorithm with the dynamic window approach(DWA).The traditional A^(*)algorithm often generates paths that are too close to obstacle boundaries and contain excessive turning points,whereas the traditional DWA tends to skirt densely clustered obstacles,resulting in longer routes and insufficient dynamic obstacle avoidance.To overcome these limitations,improved versions of both algorithms are developed.Key points extracted from the optimized A^(*)path are used as intermediate start-destination pairs for the improved DWA,and the weights of the DWA evaluation function are adjusted to achieve effective fusion.Furthermore,a multi-dynamic-obstacle avoidance strategy is designed for complex navigation scenarios.Simulation results demonstrate that the USV can adaptively switch between dynamic obstacle avoidance and path tracking based on obstacle distribution,validating the effectiveness of the proposed method.
