首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于航迹片段树的快速四维航迹规划方法
引用本文:张险峰,周其忠,王长青.基于航迹片段树的快速四维航迹规划方法[J].北京航空航天大学学报,2013,39(3):310-314.
作者姓名:张险峰  周其忠  王长青
作者单位:北京航空航天大学宇航学院,北京,100191;北京机电工程研究所,北京,100074
摘    要:为消除起飞时间误差以及飞行过程中各种干扰对无人飞行器到达指定地点时间的影响,提出了一种基于航迹片段树的快速四维航迹规划方法.结合现代无人飞行器特点,利用改进的稀疏A*算法,生成遍布规划空间的航迹片段树,根据指定目标位置直接从航迹片段树中寻求最优叶节点,通过回溯及速度优化设置,快速获得能消除各种时间误差的飞行航迹.试验结果表明,本算法能快速完成四维航迹规划,满足飞行器按指定时间达到指定地点的要求.

关 键 词:稀疏  A  *  航迹片段树  四维航迹  航迹规划
收稿时间:2012-03-02

4D route rapidly planning based on route-segment tree
Zhang XianfengSchool of Astronautics,Beijing University of Aeronautics and Astronautics,Beijing,China Zhou Qizhong Wang Changqing.4D route rapidly planning based on route-segment tree[J].Journal of Beijing University of Aeronautics and Astronautics,2013,39(3):310-314.
Authors:Zhang XianfengSchool of Astronautics  Beijing University of Aeronautics and Astronautics  Beijing  China Zhou Qizhong Wang Changqing
Institution:1. School of Astronautics, Beijing University of Aeronautics and Astronautics, Beijing 100191, China;
2. Beijing Electro-Mechanical Engineering Institute, Beijing 100074, China
Abstract:The launch time error and the random difference during flying will influence the arriving time of the unmaned combat aerial vehicles(UCAV). Based on the sparse A* algorithm, a route-segment tree was built with considerations of the moving characteristics of modern UCAV. The best leaf point was found according to the target position, and the route which can eliminate the arriving time error of the target was laid out by route backtracking and velocity optimizing. The 4D (four-dimensional) rapidly route planning algorithm was realized in a case, and the simulation result shows that the UCAV can arrive the target at the designed time.
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京航空航天大学学报》浏览原始摘要信息
点击此处可从《北京航空航天大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号