Essential Site Maintenance: Authorea-powered sites will be updated circa 15:00-17:00 Eastern on Tuesday 5 November.
There should be no interruption to normal services, but please contact us at help@authorea.com in case you face any issues.

loading page

3D path planning problem for fighter Aircraft with multiple constraints
  • +1
  • Ping Yang,
  • Bing Xiao,
  • Xin Chen,
  • LiangLiang Guo
Ping Yang
People's Liberation Army Air Force Early Warning Academy

Corresponding Author:vip_zzz@163.com

Author Profile
Bing Xiao
People's Liberation Army Air Force Early Warning Academy
Author Profile
Xin Chen
People's Liberation Army Air Force Early Warning Academy
Author Profile
LiangLiang Guo
Chief of the PLA an aviation brigade ammunition Brigade
Author Profile

Abstract

Abstract: Path planning is a crucial component for ensuring the safety and efficiency of flight missions, especially for fighter aircraft. To enhance the combat effectiveness of fighter aircraft, it is important to consider how to avoid danger sources and terrain obstacles, reduce fuel consumption, and utilize the aircraft’s own performance to accomplish the mission objectives. In the modern battlefield environment, the shortest path is not the only criterion for planning, but also other factors such as the threat level to the aircraft, fuel consumption, mission completion time, and minimum turning radius. In this paper, we propose a multi-constraint path planning method for fighter aircraft that incorporates these factors into an improved particle swarm algorithm. We transform the constraints of three-dimensional terrain, threat source, fuel consumption, and mission time into an aggregated fitness function. We construct a limit curvature matrix to evaluate the feasibility of the generated path. We also introduce an adaptive adjustment strategy based on the activation function for the parameters in the particle swarm algorithm. The weights of each constraint are determined according to the actual demand. The experiment results show that our method can efficiently plan the optimal path that satisfies the requirements. Compared with other improved particle swarm algorithms, our method has higher optimal search efficiency and better convergence effect. We also provide optimal values for important parameters such as mission energy consumption, mission time, flight speed and others to support the overall mission planning. Our method has certain practical application value.
27 Mar 2023Submitted to The Journal of Engineering
29 Mar 2023Submission Checks Completed
29 Mar 2023Assigned to Editor
26 Apr 2023Reviewer(s) Assigned
23 Aug 2023Editorial Decision: Revise Minor
31 Aug 20231st Revision Received
06 Sep 2023Submission Checks Completed
06 Sep 2023Assigned to Editor
25 Oct 2023Review(s) Completed, Editorial Evaluation Pending
25 Oct 2023Editorial Decision: Accept