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.展开更多
An optimal midcourse trajectory planning approach that considers the capture region（CR） of the terminal guidance is proposed in this article based on the Gauss pseudospectral method（GPM）. Firstly, the planar CR of...An optimal midcourse trajectory planning approach that considers the capture region（CR） of the terminal guidance is proposed in this article based on the Gauss pseudospectral method（GPM）. Firstly, the planar CR of the proportional navigation in terminal guidance is analyzed and innovatively introduced in the midcourse trajectory planning problems, with the collision triangle（CT） serving as the ideal terminal states parameters of the midcourse phase, and the CR area serving as the robustness against target maneuvers. Secondly, the midcourse trajectory planning problem that considers the path, terminal and control constraints is formulated and the well-developed GPM is used to generate the nominal trajectory that meets the CR demands. The interceptor will reshape the trajectory only when the former CR fails to cover the target, which has loosened the critical demand for frequent trajectory modification. Finally, the simulations of four different scenarios are carried out and the results prove the effectiveness and optimality of the proposed method.展开更多
This paper considers the problem of generating a flight trajectory for a single fixed-wing unmanned combat aerial vehicle （UCAV） performing an air-to-surface multi-target attack （A/SMTA） mission using satellite-gu...This paper considers the problem of generating a flight trajectory for a single fixed-wing unmanned combat aerial vehicle （UCAV） performing an air-to-surface multi-target attack （A/SMTA） mission using satellite-guided bombs. First, this problem is formulated as a variant of the traveling salesman problem （TSP）, called the dynamic-constrained TSP with neighborhoods （DCT- SPN）. Then, a hierarchical hybrid approach, which partitions the planning algorithm into a roadmap planning layer and an optimal control layer, is proposed to solve the DCTSPN. In the roadmap planning layer, a novel algorithm based on an updatable proba- bilistic roadmap （PRM） is presented, which operates by randomly sampling a finite set of vehicle states from continuous state space in order to reduce the complicated trajectory planning problem to planning on a finite directed graph. In the optimal control layer, a collision-free state-to-state trajectory planner based on the Gauss pseudospectral method is developed, which can generate both dynamically feasible and optimal flight trajectories. The entire process of solving a DCTSPN consists of two phases. First, in the offline preprocessing phase, the algorithm constructs a PRM, and then converts the original problem into a standard asymmet- ric TSP （ATSP）. Second, in the online querying phase, the costs of directed edges in PRM are updated first, and a fast heuristic searching algorithm is then used to solve the ATSP. Numerical experiments indicate that the algorithm proposed in this paper can generate both feasible and near-optimal solutions quickly for online purposes.展开更多
Homing trajectory planning is a core task of autonomous homing of parafoil system.This work analyzes and establishes a simplified kinematic mathematical model,and regards the homing trajectory planning problem as a ki...Homing trajectory planning is a core task of autonomous homing of parafoil system.This work analyzes and establishes a simplified kinematic mathematical model,and regards the homing trajectory planning problem as a kind of multi-objective optimization problem.Being different from traditional ways of transforming the multi-objective optimization into a single objective optimization by weighting factors,this work applies an improved non-dominated sorting genetic algorithm Ⅱ(NSGA Ⅱ) to solve it directly by means of optimizing multi-objective functions simultaneously.In the improved NSGA Ⅱ,the chaos initialization and a crowding distance based population trimming method were introduced to overcome the prematurity of population,the penalty function was used in handling constraints,and the optimal solution was selected according to the method of fuzzy set theory.Simulation results of three different schemes designed according to various practical engineering requirements show that the improved NSGA Ⅱ can effectively obtain the Pareto optimal solution set under different weighting with outstanding convergence and stability,and provide a new train of thoughts to design homing trajectory of parafoil system.展开更多
To ensure safe flight of multiple fixed-wing unmanned aerial vehicles(UAVs)formation,considering trajectory planning and formation control together,a leader trajectory planning method based on the sparse A*algorithm i...To ensure safe flight of multiple fixed-wing unmanned aerial vehicles(UAVs)formation,considering trajectory planning and formation control together,a leader trajectory planning method based on the sparse A*algorithm is introduced.Firstly,a formation controller based on prescribed performance theory is designed to control the transient and steady formation configuration,as well as the formation forming time,which not only can form the designated formation configuration but also can guarantee collision avoidance and terrain avoidance theoretically.Next,considering the constraints caused by formation controller on trajectory planning such as the safe distance,turn angle and step length,as well as the constraint of formation shape,a leader trajectory planning method based on sparse A^(*)algorithm is proposed.Simulation results show that the UAV formation can arrive at the destination safely with a short trajectory no matter keeping the formation or encountering formation transformation.展开更多
Based on trajectory planning with maximum velocity and acceleration constraints, a novel high-quality trajectory planning method was proposed for heterogeneous individuals in crowd simulation. The proposed method ensu...Based on trajectory planning with maximum velocity and acceleration constraints, a novel high-quality trajectory planning method was proposed for heterogeneous individuals in crowd simulation. The proposed method ensured that the individual’s path was smooth and its velocity was continuous. Based on the physiological constraints of humans with maximum velocity and acceleration, time-optimal trajectory and feasible region were derived by solving kinodynamic planning problem. Subsequently, a high-quality trajectory planning algorithm was designed to compute the trajectory with appropriate variation of velocity. The simulation results demonstrate that the proposed trajectory planning method has more authenticities and can generate high-quality trajectories for virtual humans in crowd simulation.展开更多
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.展开更多
This survey presents a comprehensive review of vari-ous methods and algorithms related to passing-through control of multi-robot systems in cluttered environments.Numerous studies have investigated this area,and we id...This survey presents a comprehensive review of vari-ous methods and algorithms related to passing-through control of multi-robot systems in cluttered environments.Numerous studies have investigated this area,and we identify several avenues for enhancing existing methods.This survey describes some models of robots and commonly considered control objec-tives,followed by an in-depth analysis of four types of algo-rithms that can be employed for passing-through control:leader-follower formation control,multi-robot trajectory planning,con-trol-based methods,and virtual tube planning and control.Fur-thermore,we conduct a comparative analysis of these tech-niques and provide some subjective and general evaluations.展开更多
基金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.
基金supported by the National Natural Science Foundation of China(6157337461503408)
文摘An optimal midcourse trajectory planning approach that considers the capture region（CR） of the terminal guidance is proposed in this article based on the Gauss pseudospectral method（GPM）. Firstly, the planar CR of the proportional navigation in terminal guidance is analyzed and innovatively introduced in the midcourse trajectory planning problems, with the collision triangle（CT） serving as the ideal terminal states parameters of the midcourse phase, and the CR area serving as the robustness against target maneuvers. Secondly, the midcourse trajectory planning problem that considers the path, terminal and control constraints is formulated and the well-developed GPM is used to generate the nominal trajectory that meets the CR demands. The interceptor will reshape the trajectory only when the former CR fails to cover the target, which has loosened the critical demand for frequent trajectory modification. Finally, the simulations of four different scenarios are carried out and the results prove the effectiveness and optimality of the proposed method.
文摘This paper considers the problem of generating a flight trajectory for a single fixed-wing unmanned combat aerial vehicle （UCAV） performing an air-to-surface multi-target attack （A/SMTA） mission using satellite-guided bombs. First, this problem is formulated as a variant of the traveling salesman problem （TSP）, called the dynamic-constrained TSP with neighborhoods （DCT- SPN）. Then, a hierarchical hybrid approach, which partitions the planning algorithm into a roadmap planning layer and an optimal control layer, is proposed to solve the DCTSPN. In the roadmap planning layer, a novel algorithm based on an updatable proba- bilistic roadmap （PRM） is presented, which operates by randomly sampling a finite set of vehicle states from continuous state space in order to reduce the complicated trajectory planning problem to planning on a finite directed graph. In the optimal control layer, a collision-free state-to-state trajectory planner based on the Gauss pseudospectral method is developed, which can generate both dynamically feasible and optimal flight trajectories. The entire process of solving a DCTSPN consists of two phases. First, in the offline preprocessing phase, the algorithm constructs a PRM, and then converts the original problem into a standard asymmet- ric TSP （ATSP）. Second, in the online querying phase, the costs of directed edges in PRM are updated first, and a fast heuristic searching algorithm is then used to solve the ATSP. Numerical experiments indicate that the algorithm proposed in this paper can generate both feasible and near-optimal solutions quickly for online purposes.
基金Project(61273138)supported by the National Natural Science Foundation of ChinaProject(14JCZDJC39300)supported by the Key Fund of Tianjin,China
文摘Homing trajectory planning is a core task of autonomous homing of parafoil system.This work analyzes and establishes a simplified kinematic mathematical model,and regards the homing trajectory planning problem as a kind of multi-objective optimization problem.Being different from traditional ways of transforming the multi-objective optimization into a single objective optimization by weighting factors,this work applies an improved non-dominated sorting genetic algorithm Ⅱ(NSGA Ⅱ) to solve it directly by means of optimizing multi-objective functions simultaneously.In the improved NSGA Ⅱ,the chaos initialization and a crowding distance based population trimming method were introduced to overcome the prematurity of population,the penalty function was used in handling constraints,and the optimal solution was selected according to the method of fuzzy set theory.Simulation results of three different schemes designed according to various practical engineering requirements show that the improved NSGA Ⅱ can effectively obtain the Pareto optimal solution set under different weighting with outstanding convergence and stability,and provide a new train of thoughts to design homing trajectory of parafoil system.
基金supported by the National Natural Science Foundation of China(11502019).
文摘To ensure safe flight of multiple fixed-wing unmanned aerial vehicles(UAVs)formation,considering trajectory planning and formation control together,a leader trajectory planning method based on the sparse A*algorithm is introduced.Firstly,a formation controller based on prescribed performance theory is designed to control the transient and steady formation configuration,as well as the formation forming time,which not only can form the designated formation configuration but also can guarantee collision avoidance and terrain avoidance theoretically.Next,considering the constraints caused by formation controller on trajectory planning such as the safe distance,turn angle and step length,as well as the constraint of formation shape,a leader trajectory planning method based on sparse A^(*)algorithm is proposed.Simulation results show that the UAV formation can arrive at the destination safely with a short trajectory no matter keeping the formation or encountering formation transformation.
基金Project(1708085QF158)supported by the Natural Science Foundation of Anhui Province,China
文摘Based on trajectory planning with maximum velocity and acceleration constraints, a novel high-quality trajectory planning method was proposed for heterogeneous individuals in crowd simulation. The proposed method ensured that the individual’s path was smooth and its velocity was continuous. Based on the physiological constraints of humans with maximum velocity and acceleration, time-optimal trajectory and feasible region were derived by solving kinodynamic planning problem. Subsequently, a high-quality trajectory planning algorithm was designed to compute the trajectory with appropriate variation of velocity. The simulation results demonstrate that the proposed trajectory planning method has more authenticities and can generate high-quality trajectories for virtual humans in crowd simulation.
文摘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.
文摘This survey presents a comprehensive review of vari-ous methods and algorithms related to passing-through control of multi-robot systems in cluttered environments.Numerous studies have investigated this area,and we identify several avenues for enhancing existing methods.This survey describes some models of robots and commonly considered control objec-tives,followed by an in-depth analysis of four types of algo-rithms that can be employed for passing-through control:leader-follower formation control,multi-robot trajectory planning,con-trol-based methods,and virtual tube planning and control.Fur-thermore,we conduct a comparative analysis of these tech-niques and provide some subjective and general evaluations.
