基于RHC方法的动态任务环境下无人机群在线协同路径规划二维等步路径生成

Yue Shen, Guoliang Fan
{"title":"基于RHC方法的动态任务环境下无人机群在线协同路径规划二维等步路径生成","authors":"Yue Shen, Guoliang Fan","doi":"10.1145/3611450.3611451","DOIUrl":null,"url":null,"abstract":"This paper first mathematically models the UAV swarm online cooperative path planning problem based on the prerequisite assumptions of transparent posture and dynamic mission environment. Then the receding horizon control (RHC) and 2D-equal-step path generation method are briefly introduced and combined with the improved firefly optimization algorithm to solve the UAV swarm online cooperative path planning problem modeled in the previous. Simulations show that the improved firefly algorithm combining the RHC and 2D-equal-step path generation methods can be used to optimally solve the UAV swarm online cooperative path planning problem for moving mission targets in dynamic environments, and the improved firefly algorithm is more powerful and more efficient than the original algorithm in this process of application.","PeriodicalId":289906,"journal":{"name":"Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and Algorithms","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"RHC Method Based 2D-equal-step Path Generation for UAV Swarm Online Cooperative Path Planning in Dynamic Mission Environment\",\"authors\":\"Yue Shen, Guoliang Fan\",\"doi\":\"10.1145/3611450.3611451\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper first mathematically models the UAV swarm online cooperative path planning problem based on the prerequisite assumptions of transparent posture and dynamic mission environment. Then the receding horizon control (RHC) and 2D-equal-step path generation method are briefly introduced and combined with the improved firefly optimization algorithm to solve the UAV swarm online cooperative path planning problem modeled in the previous. Simulations show that the improved firefly algorithm combining the RHC and 2D-equal-step path generation methods can be used to optimally solve the UAV swarm online cooperative path planning problem for moving mission targets in dynamic environments, and the improved firefly algorithm is more powerful and more efficient than the original algorithm in this process of application.\",\"PeriodicalId\":289906,\"journal\":{\"name\":\"Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and Algorithms\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3611450.3611451\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3611450.3611451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文首先基于透明姿态和动态任务环境的前提假设,对无人机群在线协同路径规划问题进行数学建模。然后简要介绍了后退地平线控制(RHC)和二维等步路径生成方法,并结合改进的萤火虫优化算法解决了前面建模的无人机群在线协同路径规划问题。仿真结果表明,结合RHC和2d等步路径生成方法的改进萤火虫算法可以最优地解决动态环境下移动任务目标的无人机群在线协同路径规划问题,改进萤火虫算法在应用过程中比原算法更强大、更高效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RHC Method Based 2D-equal-step Path Generation for UAV Swarm Online Cooperative Path Planning in Dynamic Mission Environment
This paper first mathematically models the UAV swarm online cooperative path planning problem based on the prerequisite assumptions of transparent posture and dynamic mission environment. Then the receding horizon control (RHC) and 2D-equal-step path generation method are briefly introduced and combined with the improved firefly optimization algorithm to solve the UAV swarm online cooperative path planning problem modeled in the previous. Simulations show that the improved firefly algorithm combining the RHC and 2D-equal-step path generation methods can be used to optimally solve the UAV swarm online cooperative path planning problem for moving mission targets in dynamic environments, and the improved firefly algorithm is more powerful and more efficient than the original algorithm in this process of application.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Entropy-based Time-series Financial Distress Model Based on Attribute Selection and MetaCost Methods for Imbalance Class Joint Energy-Limited UAV Trajectory and Node Wake-Up Scheduling Optimization for Data Collection in Maritime Wireless Sensor Networks RHC Method Based 2D-equal-step Path Generation for UAV Swarm Online Cooperative Path Planning in Dynamic Mission Environment A Novel Control Scheme of Stable Electricity and High Efficiency Supply in SOFC-based DC Micro-grid Study on the fault diagnosis method of ship main engine unbalanced data based on improved DQN
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1