Path planning for the attack stage of a loitering unit

Yue Wang*, Dong Guang Li, Qiang Shen

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

2 引用 (Scopus)

摘要

To make the loitering unit fly from its current point to the target point in shortest way and meet the target finally on the attack stage, a disassemble planning method of three-dimensional ballistic trajectory is put forward. The problem of three-dimensional ballistic trajectory planning is separated to planar path planning and corresponding altitude. Quantity of computation is reduced, and the planning of planar path after separation is carried out. The result shows that the algorithm can effectively reduce the amount of computation and thus solve the contradiction of necessary precision and quantity of computation.

源语言英语
页(从-至)8-10
页数3
期刊Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
28
1
出版状态已出版 - 1月 2008

指纹

探究 'Path planning for the attack stage of a loitering unit' 的科研主题。它们共同构成独一无二的指纹。

引用此

Wang, Y., Li, D. G., & Shen, Q. (2008). Path planning for the attack stage of a loitering unit. Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology, 28(1), 8-10.