Path planning for the attack stage of a loitering unit

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.