摘要
伴随着城市化进程的迅速发展,无论在作战中还是民用,都对无人机自主协同能力提出了新的要求。以城市环境为背景,以无人机任务规划为研究对象,针对目前无人机任务规划算法普遍较为复杂、实时性较差的问题,提出一种新颖的任务规划算法。首先对城市中的建筑物建立简单的数学模型,针对模型的特点使用了改进通视图法计算出所有最短路径,然后使用背包算法完成任务分配。仿真结果表明该算法规划准确,满足实时性要求。
The rapid development of urbanization presents new requirements to autonomous collaborationcapability of UAVs both in military and civilian application.Considering that the current mission planningalgorithms for UAVs have the drawbacks of high complexity and poor real -time performance,we proposed anovel UAV mission planning method based on urban environment .Simple mathematical models were createdfor the urban buildings at first.Then,the improved visibility graph was applied to create all the shortest pathsbased on the models,and knapsack problem algorithm was used to allocate the missions .Simulations showthat the algorithm can make an accurate planning that satisfies the real -time requirements.
出处
《电光与控制》
北大核心
2014年第10期10-14,19,共6页
Electronics Optics & Control
基金
航空科学基金(20135896027)
关键词
多无人机
任务规划
通视图
背包算法
城市环境
multi-UAV
mission planning
visibility graph
knapsack problem algorithm
urban environment
