摘要
针对传统A*算法在飞行器航迹规划过程中产生节点较多,搜索时间较长等缺点,提出了一种改进的A*算法。该算法采用分层思想,将局部规划与全局规划相结合,并对代价函数进行了改进,在保证航迹优化的基础上,提高了搜索效率。仿真结果表明,运用该算法能够规划出符合工程应用的飞行器航迹。
There are some disadvantages for traditional A＊ algorithm in the aircraft path planning process,such as generating too much nodes and needing long time to search path,so an improved A＊ algorithm is put forward.The algorithm uses the thought of delamination,makes local planning and global planning combination,and improves cost function,finally with ensuring optimal trajectory increases search efficiency.Simulation results show that using this algorithm can plan aircraft path meeting engineering demand.
出处
《测控技术》
CSCD
北大核心
2011年第3期110-113,共4页
Measurement & Control Technology
关键词
分层规划
改进的A＊算法
局部规划
代价函数
delamination planning
improved A＊ algorithm
local planning
cost function
