Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narr...Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT^(*)-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT^(*),the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT^(*).Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications.展开更多
To address efficient operation scheduling of shipboard helicopter groups under multi-mission demands and limited deck space,a novel Flexible Operation Mode(FOM)was proposed.Mission grouping,deck operation processes,an...To address efficient operation scheduling of shipboard helicopter groups under multi-mission demands and limited deck space,a novel Flexible Operation Mode(FOM)was proposed.Mission grouping,deck operation processes,and mission time were flexibilized to construct a mission planning method.From the perspective of the deck operation lifecycle,the scheduling problem was modeled as a six-stage mixed-integer program.A bi-level optimization framework was introduced,prioritizing maximization of mission time window satisfaction and secondarily minimizing mean deck operation time.Spatial evolution during the transportation phase was managed via an offline trajectory library that converted high-dimensional constraints into low-dimensional parameter mappings,significantly reducing real-time solution complexity.A Leader-Follower Particle Swarm Optimization(LFPSO)algorithm was developed,featuring a three-stage stochastic priority encoding and a mission-chain-driven launch-re-covery decoupling strategy to reduce decision coupling.A hierarchical population structure enhanced co-evolution of global search and local refinement.The case simulation results show that the proposed model and algorithm can effectively solve the deck operation scheduling problem in complex mission scenarios,and are significantly superior to the Continuous Operation Mode(COM)and the Fixed-process FOM(FFOM)in key performance indicators such as mission time window satisfaction,average deck operation time,and average mission flight time.Its effectiveness in enhancing system scheduling capability and performance stability has been verified.This research provides systematic support for the flexible construction and intelligent decision-making of ship aviation operation systems.展开更多
Frequency planning is of great significance which can effectively dispatch the battlefield resources of radio equipment.To enhance the efficiency of scheduling,this paper investigates the frequency planning problem(FP...Frequency planning is of great significance which can effectively dispatch the battlefield resources of radio equipment.To enhance the efficiency of scheduling,this paper investigates the frequency planning problem(FPP)and puts forward a multiobjective approach.The proposed multi-objective model considers the coordination constraints of radio equipment alongside diverse resources,defining key points to delineate the cooperative interactions among radio equipment.The model integrates considerations of time,space,and energy,focusing on electromagnetic interference,frequency demand satisfaction and frequency occupancy as its primary optimization objectives.To improve the accuracy of the solution,this study proposes a multipopulation multi-objective memetic algorithm(MPMA).This algorithm employs a segment-based coding strategy and a specialized genetic operator to facilitate the integration of global and local search techniques.Additionally,chaos initialization and a multi-population-based scheduling approach are incorporated to enhance global search performance.The experimental results demonstrate the superiority of the proposed model and MPMA in meeting the diverse scheduling needs of radio equipment across various scenarios.展开更多
As carrier aircraft sortie frequency and flight deck operational density increase,autonomous dispatch trajectory planning for carrier-based vehicles demands efficient,safe,and kinematically feasible solutions.This pap...As carrier aircraft sortie frequency and flight deck operational density increase,autonomous dispatch trajectory planning for carrier-based vehicles demands efficient,safe,and kinematically feasible solutions.This paper presents an Iterative Safe Dispatch Corridor(iSDC)framework,addressing the suboptimality of the traditional SDC method caused by static corridor construction and redundant obstacle exploration.First,a Kinodynamic-Informed-Bidirectional Rapidly-exploring Random Tree Star(KIBRRT^(*))algorithm is proposed for the front-end coarse planning.By integrating bidirectional tree expansion,goal-biased elliptical sampling,and artificial potential field guidance,it reduces unnecessary exploration near concave obstacles and generates kinematically admissible paths.Secondly,the traditional SDC is implemented in an iterative manner,and the obtained trajectory in the current iteration is fed into the next iteration for corridor generation,thus progressively improving the quality of withincorridor constraints.For tractors,a reverse-motion penalty function is incorporated into the back-end optimizer to prioritize forward driving,aligning with mechanical constraints and human operational preferences.Numerical validations on the data of Gerald R.Ford-class carrier demonstrate that the KIBRRT^(*)reduces average computational time by 75%and expansion nodes by 25%compared to conventional RRT^(*)algorithms.Meanwhile,the iSDC framework yields more time-efficient trajectories for both carrier aircraft and tractors,with the dispatch time reduced by 31.3%and tractor reverse motion proportion decreased by 23.4%relative to traditional SDC.The presented framework offers a scalable solution for autonomous dispatch in confined and safety-critical environment,and an illustrative animation is available at bilibili.com/video/BV1tZ7Zz6Eyz.Moreover,the framework can be easily extended to three-dimension scenarios,and thus applicable for trajectory planning of aerial and underwater vehicles.展开更多
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.展开更多
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.展开更多
Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and miss...Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.展开更多
Electronic reconnaissance units commonly utilize an interferometer direction-finding system to measure the incoming direction of radar radiation signals.This approach enables the accurate determination of threat sourc...Electronic reconnaissance units commonly utilize an interferometer direction-finding system to measure the incoming direction of radar radiation signals.This approach enables the accurate determination of threat source locations,which is essential for devising route plans oriented toward flight path generation.When a frequency diverse array(FDA)system is adopted by ground radars,errors are introduced into the angle measurements of the passive direction finding system.To address this issue,this study starts with FDA model establishment and equiphasic surface characteristics analysis and analyzes the principles of FDA deception in identifying one-dimensional single-baseline interferometer directions.Additionally,the Cramer-Rao bounds of the signal carrier frequency estimation error and angle measurement error during the interferometer’s direction finding process are considered.The simulation results verify that the one-dimensional single-baseline interferometer direction finding system can be deceived by the FDA radar,and the FDA with a sine frequency offset exhibits the optimum deception effect.展开更多
The influence of ocean environment on navigation of autonomous underwater vehicle(AUV)cannot be ignored.In the marine environment,ocean currents,internal waves,and obstacles are usually considered in AUV path planning...The influence of ocean environment on navigation of autonomous underwater vehicle(AUV)cannot be ignored.In the marine environment,ocean currents,internal waves,and obstacles are usually considered in AUV path planning.In this paper,an improved particle swarm optimization(PSO)is proposed to solve three problems,traditional PSO algorithm is prone to fall into local optimization,path smoothing is always carried out after all the path planning steps,and the path fitness function is so simple that it cannot adapt to complex marine environment.The adaptive inertia weight and the“active”particle of the fish swarm algorithm are established to improve the global search and local search ability of the algorithm.The cubic spline interpolation method is combined with PSO to smooth the path in real time.The fitness function of the algorithm is optimized.Five evaluation indexes are comprehensively considered to solve the three-demensional(3D)path planning problem of AUV in the ocean currents and internal wave environment.The proposed method improves the safety of the path planning and saves energy.展开更多
The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a nove...The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a novel delivery mode.Spatiotemporal collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route planning.This paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and payload.To address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and UAV.Furthermore,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions efficiently.The effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.展开更多
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.展开更多
As battlefield scale enlarges,cross-platform collaborative combat provides an appealing paradigm for modern warfare.Complicated constraints and vast solution space pose great challenge for reasonable and efficient mis...As battlefield scale enlarges,cross-platform collaborative combat provides an appealing paradigm for modern warfare.Complicated constraints and vast solution space pose great challenge for reasonable and efficient mission planning,where path planning and target assignment are tightly coupled.In this paper,we focus on UAV mission planning under carrier delivery mode(e.g.,by aircraft carrier,ground vehicle,or transport aircraft) and design a three-layer hierarchical solution framework.In the first layer,we simultaneously determine delivery points and target set division by clustering.To address the safety concerns of radar risk and UAV endurance,an improved density peak clustering algorithm is developed by constraint fusio n.In the second layer,mission planning within each cluster is viewed as a coope rative multiple-task assignment problem.A hybrid heuristic algorithm that integrates a voting-based heuristic solution generation strategy(VHSG) and a stochastic variable neighborhood search(SVNS),called VHSG-SVNS,is proposed for rapid solution.Based on the results of the first two layers,the third layer transforms carrier path planning into a multiple-vehicle routing problem with time window.The cost between any two nodes is calculated by the A~* algorithm,and the genetic algorithm is then implemented to determine the global route.Finally,a practical mission scenario containing 200 targets is used to validate the effectiveness of the designed framework,where three layers cooperate well with each other to generate satisfactory combat scheduling.Comparisons are made in each layer to highlight optimum-seeking capability and efficiency of the proposed algorithms.Works done in this paper provide a simple but efficient solution framework for cross-platform cooperative mission planning problems,and can be potentially extended to other applications such as post-disaster search and rescue,forest surveillance and firefighting,logistics pick and delivery,etc.展开更多
Combat effectiveness of unmanned aerial vehicle(UAV)formations can be severely affected by the mission execution reliability.During the practical execution phase,there are inevitable risks where UAVs being destroyed o...Combat effectiveness of unmanned aerial vehicle(UAV)formations can be severely affected by the mission execution reliability.During the practical execution phase,there are inevitable risks where UAVs being destroyed or targets failed to be executed.To improve the mission reliability,a resilient mission planning framework integrates task pre-and re-assignment modules is developed in this paper.In the task pre-assignment phase,to guarantee the mission reliability,probability constraints regarding the minimum mission success rate are imposed to establish a multi-objective optimization model.And an improved genetic algorithm with the multi-population mechanism and specifically designed evolutionary operators is used for efficient solution.As in the task-reassignment phase,possible trigger events are first analyzed.A real-time contract net protocol-based algorithm is then proposed to address the corresponding emergency scenario.And the dual objective used in the former phase is adapted into a single objective to keep a consistent combat intention.Three cases of different scales demonstrate that the two modules cooperate well with each other.On the one hand,the pre-assignment module can generate high-reliability mission schedules as an elaborate mathematical model is introduced.On the other hand,the re-assignment module can efficiently respond to various emergencies and adjust the original schedule within a millisecond.The corresponding animation is accessible at bilibili.com/video/BV12t421w7EE for better illustration.展开更多
A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path...A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path-planning process into two layers is proposed by designing the velocityobstacle strategy for satisfying timeliness and effectiveness.The upper-level layer focuses on creating an efficient Dubins initial path considering the dynamic constraints of the fixed wing.Subsequently,the lower-level layer detects potential collisions and adjusts its flight paths to avoid collisions by using the threedimensional velocity obstacle method,which describes the maneuvering space of collision avoidance as the intersection space of half space.To further handle the dynamic and collisionavoidance constraints,a priority mechanism is designed to ensure that the adjusted path is still feasible for fixed-wing UAVs.Simulation experiments demonstrate the effectiveness of the proposed method.展开更多
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.展开更多
With the rapid development of low-altitude economy and unmanned aerial vehicles (UAVs) deployment technology, aerial-ground collaborative delivery (AGCD) is emerging as a novel mode of last-mile delivery, where the ve...With the rapid development of low-altitude economy and unmanned aerial vehicles (UAVs) deployment technology, aerial-ground collaborative delivery (AGCD) is emerging as a novel mode of last-mile delivery, where the vehicle and its onboard UAVs are utilized efficiently. Vehicles not only provide delivery services to customers but also function as mobile ware-houses and launch/recovery platforms for UAVs. This paper addresses the vehicle routing problem with UAVs considering time window and UAV multi-delivery (VRPU-TW&MD). A mixed integer linear programming (MILP) model is developed to mini-mize delivery costs while incorporating constraints related to UAV energy consumption. Subsequently, a micro-evolution aug-mented large neighborhood search (MEALNS) algorithm incor-porating adaptive large neighborhood search (ALNS) and micro-evolution mechanism is proposed. Numerical experiments demonstrate the effectiveness of both the model and algorithm in solving the VRPU-TW&MD. The impact of key parameters on delivery performance is explored by sensitivity analysis.展开更多
Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV...Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments.展开更多
Space emergency launching is to send a satellite into space by using a rapid responsive solid rocket in the bounded time to implement the emergency Earth observation mission.The key and difficult points mainly include...Space emergency launching is to send a satellite into space by using a rapid responsive solid rocket in the bounded time to implement the emergency Earth observation mission.The key and difficult points mainly include the business process construction of launching mission planning,validation of the effectiveness of the launching scheme,etc.This paper pro-poses the agile space emergency launching mission planning simulation and verification method,which systematically con-structs the overall technical framework of space emergency launching mission planning with multi-field area,multi-platform and multi-task parallel under the constraint of resource schedul-ing for the first time.It supports flexible reconstruction of mis-sion planning processes such as launching target planning,tra-jectory planning,path planning,action planning and launching time analysis,and can realize on-demand assembly of operation links under different mission scenarios and different plan condi-tions,so as to quickly modify and generate launching schemes.It supports the fast solution of rocket trajectory data and the accurate analysis of multi-point salvo time window recheck and can realize the fast conflict resolution of launching missions in the dimensions of launching position and launching window sequence.It supports lightweight scenario design,modular flexi-ble simulation,based on launching style,launching platform,launching rules,etc.,can realize the independent mapping of mission planning results to two-dimensional and three-dimen-sional visual simulation models,so as to achieve a smooth con-nection between mission planning and simulation.展开更多
以刊载景观规划研究论文的重要期刊Landscape and Urban Planning为研究对象,从论文来源地、撰稿人所属单位、文章属性、研究内容与研究对象等几个方面对该期刊刊载的1604篇文章进行分析,揭示出国际景观规划研究20年来的规律、特征、重...以刊载景观规划研究论文的重要期刊Landscape and Urban Planning为研究对象,从论文来源地、撰稿人所属单位、文章属性、研究内容与研究对象等几个方面对该期刊刊载的1604篇文章进行分析,揭示出国际景观规划研究20年来的规律、特征、重点和热点等,为国内学界了解与把握国际景观规划研究动态提供帮助。展开更多
The reentry trajectory planning for hypersonic vehicles is critical and challenging in the presence of numerous nonlinear equations of motion and path constraints, as well as guaranteed satisfaction of accuracy in mee...The reentry trajectory planning for hypersonic vehicles is critical and challenging in the presence of numerous nonlinear equations of motion and path constraints, as well as guaranteed satisfaction of accuracy in meeting all the specified boundary conditions. In the last ten years, many researchers have investigated various strategies to generate a feasible or optimal constrained reentry trajectory for hypersonic vehicles. This paper briefly reviews the new research efforts to promote the capability of reentry trajectory planning. The progress of the onboard reentry trajectory planning, reentry trajectory optimization, and landing footprint is summarized. The main challenges of reentry trajectory planning for hypersonic vehicles are analyzed, focusing on the rapid reentry trajectory optimization, complex geographic constraints, and coop- erative strategies.展开更多
基金National Natural Science Foundation of China(32301712)Natural Science Foundation of Jiangsu Province(BK20230548,BK20250876)+2 种基金Project of Faculty of Agricultural Equipment of Jiangsu University(NGXB20240203)A Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD-2023-87)Open Funding Project of the Key Laboratory of Modern Agricultural Equipment and Technology(Jiangsu University),Ministry of Education(MAET202101)。
文摘Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT^(*)-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT^(*),the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT^(*).Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications.
基金supported in part by the National Natural Sci-ence Foundation of China(No.62403486)in part by the Young Elite Scientists Sponsorship Program by CAST.
文摘To address efficient operation scheduling of shipboard helicopter groups under multi-mission demands and limited deck space,a novel Flexible Operation Mode(FOM)was proposed.Mission grouping,deck operation processes,and mission time were flexibilized to construct a mission planning method.From the perspective of the deck operation lifecycle,the scheduling problem was modeled as a six-stage mixed-integer program.A bi-level optimization framework was introduced,prioritizing maximization of mission time window satisfaction and secondarily minimizing mean deck operation time.Spatial evolution during the transportation phase was managed via an offline trajectory library that converted high-dimensional constraints into low-dimensional parameter mappings,significantly reducing real-time solution complexity.A Leader-Follower Particle Swarm Optimization(LFPSO)algorithm was developed,featuring a three-stage stochastic priority encoding and a mission-chain-driven launch-re-covery decoupling strategy to reduce decision coupling.A hierarchical population structure enhanced co-evolution of global search and local refinement.The case simulation results show that the proposed model and algorithm can effectively solve the deck operation scheduling problem in complex mission scenarios,and are significantly superior to the Continuous Operation Mode(COM)and the Fixed-process FOM(FFOM)in key performance indicators such as mission time window satisfaction,average deck operation time,and average mission flight time.Its effectiveness in enhancing system scheduling capability and performance stability has been verified.This research provides systematic support for the flexible construction and intelligent decision-making of ship aviation operation systems.
基金supported by the National Natural Science Foundation of China(61901486,U19A2058).
文摘Frequency planning is of great significance which can effectively dispatch the battlefield resources of radio equipment.To enhance the efficiency of scheduling,this paper investigates the frequency planning problem(FPP)and puts forward a multiobjective approach.The proposed multi-objective model considers the coordination constraints of radio equipment alongside diverse resources,defining key points to delineate the cooperative interactions among radio equipment.The model integrates considerations of time,space,and energy,focusing on electromagnetic interference,frequency demand satisfaction and frequency occupancy as its primary optimization objectives.To improve the accuracy of the solution,this study proposes a multipopulation multi-objective memetic algorithm(MPMA).This algorithm employs a segment-based coding strategy and a specialized genetic operator to facilitate the integration of global and local search techniques.Additionally,chaos initialization and a multi-population-based scheduling approach are incorporated to enhance global search performance.The experimental results demonstrate the superiority of the proposed model and MPMA in meeting the diverse scheduling needs of radio equipment across various scenarios.
基金support of the National Key Research and Development Plan(Grant No.2021YFB3302501)the financial support of the National Science Foundation of China(Grant No.12161076)the financial support of the Fundamental Research Funds for the Central Universities(Grant No.DUT24LAB129).
文摘As carrier aircraft sortie frequency and flight deck operational density increase,autonomous dispatch trajectory planning for carrier-based vehicles demands efficient,safe,and kinematically feasible solutions.This paper presents an Iterative Safe Dispatch Corridor(iSDC)framework,addressing the suboptimality of the traditional SDC method caused by static corridor construction and redundant obstacle exploration.First,a Kinodynamic-Informed-Bidirectional Rapidly-exploring Random Tree Star(KIBRRT^(*))algorithm is proposed for the front-end coarse planning.By integrating bidirectional tree expansion,goal-biased elliptical sampling,and artificial potential field guidance,it reduces unnecessary exploration near concave obstacles and generates kinematically admissible paths.Secondly,the traditional SDC is implemented in an iterative manner,and the obtained trajectory in the current iteration is fed into the next iteration for corridor generation,thus progressively improving the quality of withincorridor constraints.For tractors,a reverse-motion penalty function is incorporated into the back-end optimizer to prioritize forward driving,aligning with mechanical constraints and human operational preferences.Numerical validations on the data of Gerald R.Ford-class carrier demonstrate that the KIBRRT^(*)reduces average computational time by 75%and expansion nodes by 25%compared to conventional RRT^(*)algorithms.Meanwhile,the iSDC framework yields more time-efficient trajectories for both carrier aircraft and tractors,with the dispatch time reduced by 31.3%and tractor reverse motion proportion decreased by 23.4%relative to traditional SDC.The presented framework offers a scalable solution for autonomous dispatch in confined and safety-critical environment,and an illustrative animation is available at bilibili.com/video/BV1tZ7Zz6Eyz.Moreover,the framework can be easily extended to three-dimension scenarios,and thus applicable for trajectory planning of aerial and underwater vehicles.
基金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.
基金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.
文摘Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.
基金supported by the National Natural Science Foundation of China Youth Fund Support Project(61503408)Shaanxi Provincial Association for Science and Technology Youth Talent Support Program Project(20230137)Shaanxi Provincial Natural Science Basic Research Program General Project(2023JCYB509).
文摘Electronic reconnaissance units commonly utilize an interferometer direction-finding system to measure the incoming direction of radar radiation signals.This approach enables the accurate determination of threat source locations,which is essential for devising route plans oriented toward flight path generation.When a frequency diverse array(FDA)system is adopted by ground radars,errors are introduced into the angle measurements of the passive direction finding system.To address this issue,this study starts with FDA model establishment and equiphasic surface characteristics analysis and analyzes the principles of FDA deception in identifying one-dimensional single-baseline interferometer directions.Additionally,the Cramer-Rao bounds of the signal carrier frequency estimation error and angle measurement error during the interferometer’s direction finding process are considered.The simulation results verify that the one-dimensional single-baseline interferometer direction finding system can be deceived by the FDA radar,and the FDA with a sine frequency offset exhibits the optimum deception effect.
基金supported by the High-tech Ship Projects of the Ministry of Industry and Information Technology of China(2021-342).
文摘The influence of ocean environment on navigation of autonomous underwater vehicle(AUV)cannot be ignored.In the marine environment,ocean currents,internal waves,and obstacles are usually considered in AUV path planning.In this paper,an improved particle swarm optimization(PSO)is proposed to solve three problems,traditional PSO algorithm is prone to fall into local optimization,path smoothing is always carried out after all the path planning steps,and the path fitness function is so simple that it cannot adapt to complex marine environment.The adaptive inertia weight and the“active”particle of the fish swarm algorithm are established to improve the global search and local search ability of the algorithm.The cubic spline interpolation method is combined with PSO to smooth the path in real time.The fitness function of the algorithm is optimized.Five evaluation indexes are comprehensively considered to solve the three-demensional(3D)path planning problem of AUV in the ocean currents and internal wave environment.The proposed method improves the safety of the path planning and saves energy.
基金Fundamental Research Funds for the Central Universities(2024JBZX038)National Natural Science F oundation of China(62076023)。
文摘The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a novel delivery mode.Spatiotemporal collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route planning.This paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and payload.To address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and UAV.Furthermore,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions efficiently.The effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.
基金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.
文摘As battlefield scale enlarges,cross-platform collaborative combat provides an appealing paradigm for modern warfare.Complicated constraints and vast solution space pose great challenge for reasonable and efficient mission planning,where path planning and target assignment are tightly coupled.In this paper,we focus on UAV mission planning under carrier delivery mode(e.g.,by aircraft carrier,ground vehicle,or transport aircraft) and design a three-layer hierarchical solution framework.In the first layer,we simultaneously determine delivery points and target set division by clustering.To address the safety concerns of radar risk and UAV endurance,an improved density peak clustering algorithm is developed by constraint fusio n.In the second layer,mission planning within each cluster is viewed as a coope rative multiple-task assignment problem.A hybrid heuristic algorithm that integrates a voting-based heuristic solution generation strategy(VHSG) and a stochastic variable neighborhood search(SVNS),called VHSG-SVNS,is proposed for rapid solution.Based on the results of the first two layers,the third layer transforms carrier path planning into a multiple-vehicle routing problem with time window.The cost between any two nodes is calculated by the A~* algorithm,and the genetic algorithm is then implemented to determine the global route.Finally,a practical mission scenario containing 200 targets is used to validate the effectiveness of the designed framework,where three layers cooperate well with each other to generate satisfactory combat scheduling.Comparisons are made in each layer to highlight optimum-seeking capability and efficiency of the proposed algorithms.Works done in this paper provide a simple but efficient solution framework for cross-platform cooperative mission planning problems,and can be potentially extended to other applications such as post-disaster search and rescue,forest surveillance and firefighting,logistics pick and delivery,etc.
基金supported by the National Key Research and Development Plan(Grant No.2021YFB3302501)the National Natural Science Foundation of China(Grant Nos.12102077,12161076,U2241263).
文摘Combat effectiveness of unmanned aerial vehicle(UAV)formations can be severely affected by the mission execution reliability.During the practical execution phase,there are inevitable risks where UAVs being destroyed or targets failed to be executed.To improve the mission reliability,a resilient mission planning framework integrates task pre-and re-assignment modules is developed in this paper.In the task pre-assignment phase,to guarantee the mission reliability,probability constraints regarding the minimum mission success rate are imposed to establish a multi-objective optimization model.And an improved genetic algorithm with the multi-population mechanism and specifically designed evolutionary operators is used for efficient solution.As in the task-reassignment phase,possible trigger events are first analyzed.A real-time contract net protocol-based algorithm is then proposed to address the corresponding emergency scenario.And the dual objective used in the former phase is adapted into a single objective to keep a consistent combat intention.Three cases of different scales demonstrate that the two modules cooperate well with each other.On the one hand,the pre-assignment module can generate high-reliability mission schedules as an elaborate mathematical model is introduced.On the other hand,the re-assignment module can efficiently respond to various emergencies and adjust the original schedule within a millisecond.The corresponding animation is accessible at bilibili.com/video/BV12t421w7EE for better illustration.
基金supported by the National Science Fund for Distinguished Young Scholars(52425211)BIT Research Fund Program for Young Scholars(XSQD-202201005).
文摘A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path-planning process into two layers is proposed by designing the velocityobstacle strategy for satisfying timeliness and effectiveness.The upper-level layer focuses on creating an efficient Dubins initial path considering the dynamic constraints of the fixed wing.Subsequently,the lower-level layer detects potential collisions and adjusts its flight paths to avoid collisions by using the threedimensional velocity obstacle method,which describes the maneuvering space of collision avoidance as the intersection space of half space.To further handle the dynamic and collisionavoidance constraints,a priority mechanism is designed to ensure that the adjusted path is still feasible for fixed-wing UAVs.Simulation experiments demonstrate the effectiveness of the proposed method.
基金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.
基金supported by the Fundamental Research Funds for the Central Universities(2024JBZX038)the National Natural Science Foundation of China(62076023).
文摘With the rapid development of low-altitude economy and unmanned aerial vehicles (UAVs) deployment technology, aerial-ground collaborative delivery (AGCD) is emerging as a novel mode of last-mile delivery, where the vehicle and its onboard UAVs are utilized efficiently. Vehicles not only provide delivery services to customers but also function as mobile ware-houses and launch/recovery platforms for UAVs. This paper addresses the vehicle routing problem with UAVs considering time window and UAV multi-delivery (VRPU-TW&MD). A mixed integer linear programming (MILP) model is developed to mini-mize delivery costs while incorporating constraints related to UAV energy consumption. Subsequently, a micro-evolution aug-mented large neighborhood search (MEALNS) algorithm incor-porating adaptive large neighborhood search (ALNS) and micro-evolution mechanism is proposed. Numerical experiments demonstrate the effectiveness of both the model and algorithm in solving the VRPU-TW&MD. The impact of key parameters on delivery performance is explored by sensitivity analysis.
基金National Natural Science Foundation of China(Grant No.52472417)to provide fund for conducting experiments.
文摘Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments.
文摘Space emergency launching is to send a satellite into space by using a rapid responsive solid rocket in the bounded time to implement the emergency Earth observation mission.The key and difficult points mainly include the business process construction of launching mission planning,validation of the effectiveness of the launching scheme,etc.This paper pro-poses the agile space emergency launching mission planning simulation and verification method,which systematically con-structs the overall technical framework of space emergency launching mission planning with multi-field area,multi-platform and multi-task parallel under the constraint of resource schedul-ing for the first time.It supports flexible reconstruction of mis-sion planning processes such as launching target planning,tra-jectory planning,path planning,action planning and launching time analysis,and can realize on-demand assembly of operation links under different mission scenarios and different plan condi-tions,so as to quickly modify and generate launching schemes.It supports the fast solution of rocket trajectory data and the accurate analysis of multi-point salvo time window recheck and can realize the fast conflict resolution of launching missions in the dimensions of launching position and launching window sequence.It supports lightweight scenario design,modular flexi-ble simulation,based on launching style,launching platform,launching rules,etc.,can realize the independent mapping of mission planning results to two-dimensional and three-dimen-sional visual simulation models,so as to achieve a smooth con-nection between mission planning and simulation.
文摘以刊载景观规划研究论文的重要期刊Landscape and Urban Planning为研究对象,从论文来源地、撰稿人所属单位、文章属性、研究内容与研究对象等几个方面对该期刊刊载的1604篇文章进行分析,揭示出国际景观规划研究20年来的规律、特征、重点和热点等,为国内学界了解与把握国际景观规划研究动态提供帮助。
基金supported by the National Natural Science Foundation of China(6127334961203223+1 种基金61175109)the Innovation Foundation of BUAA for Ph.D.Graduates(YWF-14-YJSY-013)
文摘The reentry trajectory planning for hypersonic vehicles is critical and challenging in the presence of numerous nonlinear equations of motion and path constraints, as well as guaranteed satisfaction of accuracy in meeting all the specified boundary conditions. In the last ten years, many researchers have investigated various strategies to generate a feasible or optimal constrained reentry trajectory for hypersonic vehicles. This paper briefly reviews the new research efforts to promote the capability of reentry trajectory planning. The progress of the onboard reentry trajectory planning, reentry trajectory optimization, and landing footprint is summarized. The main challenges of reentry trajectory planning for hypersonic vehicles are analyzed, focusing on the rapid reentry trajectory optimization, complex geographic constraints, and coop- erative strategies.
