Computer Engineering and Applications ›› 2014, Vol. 50 ›› Issue (19): 58-60.

Previous Articles     Next Articles

A* algorithm based on improving validity of airline

XIONG Bangshu1, LI Teng1, ZHAO Pingjun2, SHI Shengxi1   

  1. 1.Key Laboratory of Nondestructive Test of Ministry of Education, Nanchang Hangkong University, Nanchang 330063, China
    2.Aircraft Design & Research Institute, Avic Hongdu Aviation Industry Group Co., Ltd., Nanchang 330024, China
  • Online:2014-10-01 Published:2014-09-29

基于航迹可飞性改善的A*算法

熊邦书1,李  腾1,赵平均2,史胜西1   

  1. 1.南昌航空大学 无损检测技术教育部重点实验室,南昌 330063
    2.中航工业洪都航空工业集团有限责任公司 飞机设计研究所,南昌 330024

Abstract: For the disadvantage in the validity of airline with traditional A* algorithm, A* algorithm based on improving the validity of airline is proposed. In order to ensure the validity of airline, reverse direction A* algorithm is used to obtain initial airline, and iterative algorithm is used to correct the waypoints which impact the validity of airline. The experimental results of two route planning tests under the flight environment of aircraft CGF show that the proposed method is effective for improving the validity of airline.

Key words: A* algorithm, airline planning, iterative algorithm, function of cost, validity of airline

摘要: 针对利用传统A*算法规划航迹时可飞性不好的问题,提出了一种可改善航迹可飞性的改进A*算法。在算法中采用逆序A*算法,获得代价最小的初始航迹,结合迭代算法对影响航迹可飞性的航点进行处理,保证了航迹的可飞性最优。通过模拟飞机CGF的飞行环境,进行两次航迹规划试验,其结果表明该方法在改善航迹可飞性方面具有良好效果。

关键词: A*算法, 航迹规划, 迭代算法, 代价函数, 可飞性