首页 | 本学科首页   官方微博 | 高级检索  
     检索      

多无人机协同搜索区域划分与路径规划
引用本文:戴健,许菲,陈琪锋.多无人机协同搜索区域划分与路径规划[J].航空学报,2020,41(z1):723770-723770.
作者姓名:戴健  许菲  陈琪锋
作者单位:中南大学 航空航天学院, 长沙 410083
基金项目:无人装备体系建模与仿真装备预研基金;航天器设计优化与动态模拟技术教育部重点实验室(北京航空航天大学)开放基金
摘    要:针对多无人机广域协同搜索问题,研究无人机工作区间划分和全区域覆盖搜索路径规划2个子问题。采用按无人机来向均衡划分的方法和凹点凸分解的方法,开展了凸多边形和非凸多边形的区域划分研究,将多机协同搜索问题转化为子区域上的单机搜索问题;在此基础上采用"Z"型路径覆盖方法以及Dubins转弯路径,对各个无人机开展覆盖其子区域的搜索路径规划,从而建立了一个区域划分和路径规划的整体调用框架,能够对目标区域快速进行划分并生成飞行路线。最后,对凸多边形和非凸多边形区域搜索开展仿真计算,验证了该方法的有效性。

关 键 词:无人机  协同搜索  区域划分  路径规划  Dubins路径  
收稿时间:2019-12-13
修稿时间:2019-12-25

Multi-UAV cooperative search on region division and path planning
DAI Jian,XU Fei,CHEN Qifeng.Multi-UAV cooperative search on region division and path planning[J].Acta Aeronautica et Astronautica Sinica,2020,41(z1):723770-723770.
Authors:DAI Jian  XU Fei  CHEN Qifeng
Institution:School of Aeronautics and Astronautics, Central South University, Changsha 410083, China
Abstract:Aiming at the multi-UAV cooperative search, two sub-problems of UAV working region division and full-area coverage search path planning are discussed and analyzed. By adopting the parallel division method and the concave-convex decomposition method, the region division of convex polygons and non-convex polygons is carried out. Thus, the multi-UAV cooperative search problem is transformed into a single-UAV search problem on a sub-region. Based on this, the "Z"-type path coverage method and the Dubins turning path are used to implement the path planning on each small sub-region, establishing an overall invocation framework of regional division and path planning, which can quickly divide the target area and generate flight routes. Finally, the simulations of convex and non-convex polygons verify the validity of the proposed method in this study.
Keywords:unmanned aerial rehicle  cooperative search  region division  path planning  Dubins path  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《航空学报》浏览原始摘要信息
点击此处可从《航空学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号