多无人机编队协同路径规划

Z. Zhen, Chen Gao, Q. Zhao, Ruyi Ding
{"title":"多无人机编队协同路径规划","authors":"Z. Zhen, Chen Gao, Q. Zhao, Ruyi Ding","doi":"10.1109/CYBER.2014.6917509","DOIUrl":null,"url":null,"abstract":"A systematic online path planning method based on the rapidly-exploring random tree (RRT) algorithm to solve the problem of cooperative path replanning for multiple UAVs under timing constraints is proposed in this paper. An improved RRT algorithm based on chaotic sequence is put forward to improve the ergodicity of the traditional RRT algorithm. The improved RRT algorithm is used to partly replan the path to avoid the unexpected threats detected on the way of pre-path. Moreover, a time cooperative reconstruction strategy is put forward to deal with the problem of time cooperativity being destroyed by path replanning. Finally, the simulations are carried out to verify the effectiveness of the proposed cooperative path planning method.","PeriodicalId":183401,"journal":{"name":"The 4th Annual IEEE International Conference on Cyber Technology in Automation, Control and Intelligent","volume":"49 8","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Cooperative path planning for multiple UAVs formation\",\"authors\":\"Z. Zhen, Chen Gao, Q. Zhao, Ruyi Ding\",\"doi\":\"10.1109/CYBER.2014.6917509\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A systematic online path planning method based on the rapidly-exploring random tree (RRT) algorithm to solve the problem of cooperative path replanning for multiple UAVs under timing constraints is proposed in this paper. An improved RRT algorithm based on chaotic sequence is put forward to improve the ergodicity of the traditional RRT algorithm. The improved RRT algorithm is used to partly replan the path to avoid the unexpected threats detected on the way of pre-path. Moreover, a time cooperative reconstruction strategy is put forward to deal with the problem of time cooperativity being destroyed by path replanning. Finally, the simulations are carried out to verify the effectiveness of the proposed cooperative path planning method.\",\"PeriodicalId\":183401,\"journal\":{\"name\":\"The 4th Annual IEEE International Conference on Cyber Technology in Automation, Control and Intelligent\",\"volume\":\"49 8\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 4th Annual IEEE International Conference on Cyber Technology in Automation, Control and Intelligent\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CYBER.2014.6917509\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 4th Annual IEEE International Conference on Cyber Technology in Automation, Control and Intelligent","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBER.2014.6917509","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

针对多架无人机在时间约束下的协同路径规划问题,提出了一种基于快速探索随机树(RRT)算法的系统在线路径规划方法。为了提高传统RRT算法的遍历性,提出了一种基于混沌序列的改进RRT算法。采用改进的RRT算法对路径进行部分重新规划,以避免在预路径上检测到的意外威胁。此外,提出了一种时间协同重建策略,以解决路径规划破坏时间协同性的问题。最后,通过仿真验证了所提出的协同路径规划方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cooperative path planning for multiple UAVs formation
A systematic online path planning method based on the rapidly-exploring random tree (RRT) algorithm to solve the problem of cooperative path replanning for multiple UAVs under timing constraints is proposed in this paper. An improved RRT algorithm based on chaotic sequence is put forward to improve the ergodicity of the traditional RRT algorithm. The improved RRT algorithm is used to partly replan the path to avoid the unexpected threats detected on the way of pre-path. Moreover, a time cooperative reconstruction strategy is put forward to deal with the problem of time cooperativity being destroyed by path replanning. Finally, the simulations are carried out to verify the effectiveness of the proposed cooperative path planning method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信