The air traffic control (ATC) systems are facing more and more serious congestive because of the increasing of air traffic flow in China. One of the most available ways to solve the problem is 'free flight' th...The air traffic control (ATC) systems are facing more and more serious congestive because of the increasing of air traffic flow in China. One of the most available ways to solve the problem is 'free flight' that the pilots may choose the air route and flight speed suitable for them. But this will lead to the difficulties for the controllers. This paper presents how ATC genetic algorithms can be used to detect and to solve air traffic control conflicts in free flight. And it also shows that this algorithm perfectly suits for solving flight conflicts resolution because of its short computing time.展开更多
This paper presents a study on the numerical simulation of planing crafts sailing in regular waves. This allows an accurate estimate of the seas keeping performance of the high speed craft. The simulation set in six-d...This paper presents a study on the numerical simulation of planing crafts sailing in regular waves. This allows an accurate estimate of the seas keeping performance of the high speed craft. The simulation set in six-degree of freedom motions is based on the Reynolds averaged Navier Stokes equations volume of fluid （RANSE VOF） solver. The trimming mesh technique and integral dynamic mesh method are used to guarantee the good accuracy of the hydrodynamic force and high efficiency of the numerical simulation. Incident head waves, oblique waves and beam waves are generated in the simulation with three different velocities （Fn =1.0, 1.5, 2.0）. The motions and sea keeping performance of the planing craft with waves coming from different directions are indicated in the flow solver. The ship designer placed an emphasis on the effects of waves on sailing amplitude and pressure distribution of planing craft in the configuration of building high speed crafts.展开更多
Four-dimensional trajectory based operation(4D-TBO)is believed to enhance the planning and execution of efficient flights,reduce potential conflicts and resolve upcoming tremendous flight demand.Most of the 4D traject...Four-dimensional trajectory based operation(4D-TBO)is believed to enhance the planning and execution of efficient flights,reduce potential conflicts and resolve upcoming tremendous flight demand.Most of the 4D trajectory planning related studies have focused on manned aircraft instead of unmanned aerial vehicles(UAVs).This paper focuses on planning conflict-free 4D trajectories for fixed-wing UAVs before the departure or during the flight planning.A 4D trajectory generation technique based on Tau theory is developed,which can incorporate the time constraints over the waypoint sequence in the flight plan.Then the 4D trajectory is optimized by the particle swarm optimization(PSO)algorithm.Further simulations are performed to demonstrate the effectiveness of the proposed method,which would offer a good chance for integrating UAV into civil airspace in the future.展开更多
Multiple UAVs are usually deployed to provide robustness through redundancy and to accomplish surveillance,search,attack and rescue missions.Formation reconfiguration was inevitable during the flight when the mission ...Multiple UAVs are usually deployed to provide robustness through redundancy and to accomplish surveillance,search,attack and rescue missions.Formation reconfiguration was inevitable during the flight when the mission was adjusted or the environment varied.Taking the typical formation reconfiguration from a triangular penetrating formation to a circular tracking formation for example,a path planning method based on Dubins trajectory and particle swarm optimization(PSO)algorithm is presented in this paper.The mathematic model of multiple UAVs formation reconfiguration was built firstly.According to the kinematic model of aerial vehicles,a process of dimensionality reduction was carried out to simplify the model based on Dubins trajectory.The PSO algorithm was adopted to resolve the optimization problem of formation reconfiguration path planning.Finally,the simulation and vehicles flight experiment are executed.Results show that the path planning method based on the Dubins trajectory and the PSO algorithm can generate feasible paths for vehicles on time,to guarantee the rapidity and effectiveness of formation reconfigurations.Furthermore,from the simulation results,the method is universal and could be extended easily to the path planning problem for different kinds of formation reconfigurations.展开更多
In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwa...In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwater vehicles were computed using a nnmerical solution of a nonlinear optimal control problem （NOCP）. An energy performance index as a cost function, which should be minimized, was defmed. The resulting problem was a two-point boundary value problem （TPBVP）. A genetic algorithm （GA）, particle swarm optimization （PSO）, and ant colony optimization （ACO） algorithms were applied to solve the resulting TPBVP. Applying an Euler-Lagrange equation to the NOCP, a conjugate gradient penalty method was also adopted to solve the TPBVP. The problem of energetic environments, involving some energy sources, was discussed. Some near-optimal paths were found using a GA, PSO, and ACO algorithms. Finally, the problem of collision avoidance in an energetic environment was also taken into account.展开更多
This paper proposes an optimization model for the airport ground movement problem(GMP)based on bilevel programming to address taxi conflicts on the airport ground and to improve the operating safety and efficiency.To ...This paper proposes an optimization model for the airport ground movement problem(GMP)based on bilevel programming to address taxi conflicts on the airport ground and to improve the operating safety and efficiency.To solve GMP,an iterative heuristic algorithm is designed.Instead of separately investigating each problem,this model simultaneously coordinates and optimizes the aircraft routing and scheduling.A simulation test is conducted on Nanjing Lukou International Airport(NKG)and the results show that the bilevel programming model can clearly outperform the widely used first-come-first-service(FCFS)scheduling scheme in terms of aircraft operational time under the precondition of none conflict.The research effort demonstrates that with the reduced operating cost and the improved overall efficiency,the proposed model can assist operations of the airports that are facing increasing traffic demand and working at almost maximum capacity.展开更多
Most of the traditional taxi path planning studies assume that the aircraft is in uniform speed,and the optimization goal is the shortest taxi time.Although it is easy to solve,it does not consider the changes in the ...Most of the traditional taxi path planning studies assume that the aircraft is in uniform speed,and the optimization goal is the shortest taxi time.Although it is easy to solve,it does not consider the changes in the speed profile of the aircraft when turning,and the shortest taxi time does not necessarily bring the best taxi fuel consumption.In this paper,the number of turns is considered,and the improved A*algorithm is used to obtain the P static paths with the shortest sum of the straight-line distance and the turning distance of the aircraft as the feasible taxi paths.By balancing taxi time and fuel consumption,a set of Pareto optimal speed profiles are generated for each preselected path to predict the 4-D trajectory of the aircraft.Based on the 4-D trajectory prediction results,the conflict by the occupied time window in the taxiing area is detected.For the conflict aircraft,based on the priority comparison,the waiting or changing path is selected to solve the taxiing conflict.Finally,the conflict free aircraft taxiing path is generated and the area occupation time window on the path is updated.The experimental results show that the total taxi distance and turn time of the aircraft are reduced,and the fuel consumption is reduced.The proposed method has high practical application value and is expected to be applied in real-time air traffic control decision-making in the future.展开更多
An on-line path planning algorithm based on Bezier curves is presented for underwater vehicles. Aiming at the special requirements of underwater vehicles and 3D enviromnent, the algorithm consists of two steps ： the ...An on-line path planning algorithm based on Bezier curves is presented for underwater vehicles. Aiming at the special requirements of underwater vehicles and 3D enviromnent, the algorithm consists of two steps ： the generation of spatial path and the processing of some constraints. A path for underwater vehicles is planned, which satisfies the velocity constraint and the centripetal acceleration constraint of underwater vehicles. The proposed path planning method can be used for the vehicle＇ s locomotion and navigation control.展开更多
An autonomous underwater vehicle (AUV) must use an algorithm to plan its path to distant, mobile offshore objects. Because of the uneven distribution of obstacles in the real world, the efficiency of the algorithm dec...An autonomous underwater vehicle (AUV) must use an algorithm to plan its path to distant, mobile offshore objects. Because of the uneven distribution of obstacles in the real world, the efficiency of the algorithm decreases if the global environment is represented by regular grids with all of them at the highest resolution. The framed quadtree data structure is able to more efficiently represent the environment. When planning the path, the dynamic object is expressed instead as several static objects which are used by the path planner to update the path. By taking account of the characteristics of the framed quadtree, objects can be projected on the frame nodes to increase the precision of the path. Analysis and simulations showed the proposed planner could increase efficiency while improving the ability of the AUV to follow an object.展开更多
文摘The air traffic control (ATC) systems are facing more and more serious congestive because of the increasing of air traffic flow in China. One of the most available ways to solve the problem is 'free flight' that the pilots may choose the air route and flight speed suitable for them. But this will lead to the difficulties for the controllers. This paper presents how ATC genetic algorithms can be used to detect and to solve air traffic control conflicts in free flight. And it also shows that this algorithm perfectly suits for solving flight conflicts resolution because of its short computing time.
基金Foundation item： Supported by the National Natural Science Foundation of China under Grant No. 551009038 and the specialized research fund for the doctoral program of higher education under Grant No. 200802170010
文摘This paper presents a study on the numerical simulation of planing crafts sailing in regular waves. This allows an accurate estimate of the seas keeping performance of the high speed craft. The simulation set in six-degree of freedom motions is based on the Reynolds averaged Navier Stokes equations volume of fluid （RANSE VOF） solver. The trimming mesh technique and integral dynamic mesh method are used to guarantee the good accuracy of the hydrodynamic force and high efficiency of the numerical simulation. Incident head waves, oblique waves and beam waves are generated in the simulation with three different velocities （Fn =1.0, 1.5, 2.0）. The motions and sea keeping performance of the planing craft with waves coming from different directions are indicated in the flow solver. The ship designer placed an emphasis on the effects of waves on sailing amplitude and pressure distribution of planing craft in the configuration of building high speed crafts.
文摘Four-dimensional trajectory based operation(4D-TBO)is believed to enhance the planning and execution of efficient flights,reduce potential conflicts and resolve upcoming tremendous flight demand.Most of the 4D trajectory planning related studies have focused on manned aircraft instead of unmanned aerial vehicles(UAVs).This paper focuses on planning conflict-free 4D trajectories for fixed-wing UAVs before the departure or during the flight planning.A 4D trajectory generation technique based on Tau theory is developed,which can incorporate the time constraints over the waypoint sequence in the flight plan.Then the 4D trajectory is optimized by the particle swarm optimization(PSO)algorithm.Further simulations are performed to demonstrate the effectiveness of the proposed method,which would offer a good chance for integrating UAV into civil airspace in the future.
基金Project (61703414) supported by the National Natural Science Foundation of ChinaProject (3101047) supported by the Defense Science and Technology Foundation of China+1 种基金Project (2017JJ3366) supported by the Natural Science Foundation of Hunan ChinaProject (2015M582881) supported by the China Postdoctoral Science Foundation
文摘Multiple UAVs are usually deployed to provide robustness through redundancy and to accomplish surveillance,search,attack and rescue missions.Formation reconfiguration was inevitable during the flight when the mission was adjusted or the environment varied.Taking the typical formation reconfiguration from a triangular penetrating formation to a circular tracking formation for example,a path planning method based on Dubins trajectory and particle swarm optimization(PSO)algorithm is presented in this paper.The mathematic model of multiple UAVs formation reconfiguration was built firstly.According to the kinematic model of aerial vehicles,a process of dimensionality reduction was carried out to simplify the model based on Dubins trajectory.The PSO algorithm was adopted to resolve the optimization problem of formation reconfiguration path planning.Finally,the simulation and vehicles flight experiment are executed.Results show that the path planning method based on the Dubins trajectory and the PSO algorithm can generate feasible paths for vehicles on time,to guarantee the rapidity and effectiveness of formation reconfigurations.Furthermore,from the simulation results,the method is universal and could be extended easily to the path planning problem for different kinds of formation reconfigurations.
文摘In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwater vehicles were computed using a nnmerical solution of a nonlinear optimal control problem （NOCP）. An energy performance index as a cost function, which should be minimized, was defmed. The resulting problem was a two-point boundary value problem （TPBVP）. A genetic algorithm （GA）, particle swarm optimization （PSO）, and ant colony optimization （ACO） algorithms were applied to solve the resulting TPBVP. Applying an Euler-Lagrange equation to the NOCP, a conjugate gradient penalty method was also adopted to solve the TPBVP. The problem of energetic environments, involving some energy sources, was discussed. Some near-optimal paths were found using a GA, PSO, and ACO algorithms. Finally, the problem of collision avoidance in an energetic environment was also taken into account.
基金supported by the National Natural Science Foundations of China(Nos.U1933118,U2033205)。
文摘This paper proposes an optimization model for the airport ground movement problem(GMP)based on bilevel programming to address taxi conflicts on the airport ground and to improve the operating safety and efficiency.To solve GMP,an iterative heuristic algorithm is designed.Instead of separately investigating each problem,this model simultaneously coordinates and optimizes the aircraft routing and scheduling.A simulation test is conducted on Nanjing Lukou International Airport(NKG)and the results show that the bilevel programming model can clearly outperform the widely used first-come-first-service(FCFS)scheduling scheme in terms of aircraft operational time under the precondition of none conflict.The research effort demonstrates that with the reduced operating cost and the improved overall efficiency,the proposed model can assist operations of the airports that are facing increasing traffic demand and working at almost maximum capacity.
基金supported by the National Key R&D Project(No.2020YFB1600101)National Natural Science Foundations of China(Nos.U1833103,71801215)Civil Aviation Flight Wide Area Surveillance and Safety Control Technology Key Laboratory Open Fund(No.202008)。
文摘Most of the traditional taxi path planning studies assume that the aircraft is in uniform speed,and the optimization goal is the shortest taxi time.Although it is easy to solve,it does not consider the changes in the speed profile of the aircraft when turning,and the shortest taxi time does not necessarily bring the best taxi fuel consumption.In this paper,the number of turns is considered,and the improved A*algorithm is used to obtain the P static paths with the shortest sum of the straight-line distance and the turning distance of the aircraft as the feasible taxi paths.By balancing taxi time and fuel consumption,a set of Pareto optimal speed profiles are generated for each preselected path to predict the 4-D trajectory of the aircraft.Based on the 4-D trajectory prediction results,the conflict by the occupied time window in the taxiing area is detected.For the conflict aircraft,based on the priority comparison,the waiting or changing path is selected to solve the taxiing conflict.Finally,the conflict free aircraft taxiing path is generated and the area occupation time window on the path is updated.The experimental results show that the total taxi distance and turn time of the aircraft are reduced,and the fuel consumption is reduced.The proposed method has high practical application value and is expected to be applied in real-time air traffic control decision-making in the future.
基金Supported by the National High Technology Research and Development Programme of China（No. 2006AAllZ225） and the National Natural Science Foundation of China （No. 60605026, 60635010）.
文摘An on-line path planning algorithm based on Bezier curves is presented for underwater vehicles. Aiming at the special requirements of underwater vehicles and 3D enviromnent, the algorithm consists of two steps ： the generation of spatial path and the processing of some constraints. A path for underwater vehicles is planned, which satisfies the velocity constraint and the centripetal acceleration constraint of underwater vehicles. The proposed path planning method can be used for the vehicle＇ s locomotion and navigation control.
基金Supported by the National Natural Science Foundation of China under Grant No. 60875071
文摘An autonomous underwater vehicle (AUV) must use an algorithm to plan its path to distant, mobile offshore objects. Because of the uneven distribution of obstacles in the real world, the efficiency of the algorithm decreases if the global environment is represented by regular grids with all of them at the highest resolution. The framed quadtree data structure is able to more efficiently represent the environment. When planning the path, the dynamic object is expressed instead as several static objects which are used by the path planner to update the path. By taking account of the characteristics of the framed quadtree, objects can be projected on the frame nodes to increase the precision of the path. Analysis and simulations showed the proposed planner could increase efficiency while improving the ability of the AUV to follow an object.
