检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京航空航天大学自动化科学与电气工程学院,北京100191
出 处:《北京航空航天大学学报》2010年第4期474-477,共4页Journal of Beijing University of Aeronautics and Astronautics
基 金:国家863基金资助项目(2009AA01Z333)
摘 要:针对无人机在执行低空突防任务时最大生存概率以及自身飞行约束的要求,对传统的人工势场法进行改进,提出基于图像骨架和贪婪算法的航路规划方法.对可飞区域提取图像骨架生成赋权图,采用Dijkstra方法搜索最小代价路径实现航路初规划;提出了曲率可控的贪婪算法对初规划结果进行优化,使最终的路径同时满足最小转弯半径和最短航程的要求.仿真结果表明该方法是一种有效的航路规划方法.To ensure the mission success rate for low attitude penetration,a path to meet the restriction of the unmanned aerial vehicle's(UAV) capability with high survivability must be planned.By improved the traditional artificial potential field approach,a novel method was presented based on image skeleton and the greedy algorithm generating optimal UAV flight paths over hostile territory.A weighted graph was generated by skeletonizing the permitted area and calculating flight cost of the skeleton branches based on a threat model.The rough estimate of flight path was given by searching in the graph using Dijkstra algorithm.The flight path was dynamically estimated through minimization of an objective function.The minimization was done efficiently using an improved greedy algorithm with the curvature controllable for local optimization to meet the requirements of the minimum turning radius and the shortest range.The experimental results demonstrate the potential of the proposed method.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28