Study of a path planning algorithm for unmanned helicopter
无人直升机路径规划算法研究

Path Planning methods based on known threats for an unmanned helicopter were proposed, an initial shortest path of an unmanned helicopter was developed by Dijkstra Algorithm. The path was re-planning when minatory districts were divided through threat weighting, and the path was smoothed under the conditions of maneuverability characteristics of an unmanned helicopter. If there was a pop-up threat, the path will be re-planning locally, so as to get the best path. And the correctness of the algorithm proposed was proved by the simulation in Matlab 6.5.