%0 Journal Article
%T Study of a path planning algorithm for unmanned helicopter
无人直升机路径规划算法研究
%A YU Xiang
%A WANG Xin-min
%A LI Yan
%A
余翔
%A 王新民
%A 李俨
%J 计算机应用
%D 2006
%I
%X 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.
%K unmanned helicopter
%K path planning
%K threat weighting
%K pop-up threat
%K path re-planning locally
无人直升机
%K 路径规划
%K 威胁加权
%K 突发威胁体
%K 局部重规划
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=F764C0A654573AC1&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=0B39A22176CE99FB&sid=3F419E61BD389CC8&eid=693AC5F1ADACA103&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=4