跳到主要导航 跳到搜索 跳到主要内容

The research of path planning for general aviation based on improved A∗ algorithm

  • Beihang University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

To solve the problem of large search space, large number of extended nodes, long searching time and large memory consumption for 3D path planning in general aviation(GA), this paper proposes an improved A∗ algorithm based on classical A∗ algorithm. The improved method first dynamically build 3D grid search space based on initial node and target node. Then nodes are extended by improving cost function, setting dynamic step length, and maintaining current flight state. Also optimize data structure to improve search efficiency. Finally, this paper has developed an application for real terrain that can be used to quickly and efficiently plan an optimized path.

源语言英语
主期刊名ICSESS 2017 - Proceedings of 2017 IEEE 8th International Conference on Software Engineering and Service Science
编辑Li Wenzheng, M. Surendra Prasad Babu, Lei Xiaohui
出版商IEEE Computer Society
391-394
页数4
ISBN(电子版)9781538645703
DOI
出版状态已出版 - 2 7月 2017
活动8th IEEE International Conference on Software Engineering and Service Science, ICSESS 2017 - Beijing, 中国
期限: 24 11月 201726 11月 2017

出版系列

姓名Proceedings of the IEEE International Conference on Software Engineering and Service Sciences, ICSESS
2017-November
ISSN(印刷版)2327-0586
ISSN(电子版)2327-0594

会议

会议8th IEEE International Conference on Software Engineering and Service Science, ICSESS 2017
国家/地区中国
Beijing
时期24/11/1726/11/17

学术指纹

探究 'The research of path planning for general aviation based on improved A∗ algorithm' 的科研主题。它们共同构成独一无二的学术指纹。

引用此