Optimal trajectory planning algorithm for autonomous flight of multiple UAVs in small areas

Yi Tang, Z. Wang
{"title":"Optimal trajectory planning algorithm for autonomous flight of multiple UAVs in small areas","authors":"Yi Tang, Z. Wang","doi":"10.3233/jcm-226800","DOIUrl":null,"url":null,"abstract":"The development of science and technology requires UAV to improve the accuracy of path planning to better apply in the military field and serve the people. The research proposes to use the social spider algorithm to optimize the ant colony algorithm, and jointly build an IACA to deal with the optimal selection problem of UAV path planning. Firstly, the swarm spider algorithm is used to make a reasonable division and planning of the UAV’s flight field. Secondly, the AC is used to adjust and control the UAV’s state and path. Then, the IACA is formed to carry out performance simulation and comparison experiments on the optimal path planning of the UAV to verify the superiority of the research algorithm. The results show that the maximum number of iterations of the original AC and the IACA is 100, but the IACA under the route planning optimization reaches the convergence state in 32 generations; Moreover, when the number of iterations is about 20 generations, there will be a stable fitness value, which saves time for the experiment to find the optimal path. In the simulation experiment, it is assumed that three UAVs will form a formation to conduct the experiment, and the multiple UAVs will be subject to global track planning and repeated rolling time domain track planning. The autonomous operation time of multiple UAVs through the assembly point is (5.30 s, 5.79 s, 9.29 s). The distance between UAVs during flight is predicted. It is found that the nearest distance is 2.3309 m near t= 6.65 s, which is in line with the safety distance standard. Under the improved algorithm, the speed in all directions is also relatively gentle. All the above results show that the improved algorithm can effectively improve the iteration speed and save time.","PeriodicalId":14668,"journal":{"name":"J. Comput. Methods Sci. Eng.","volume":"37 1","pages":"2193-2204"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Comput. Methods Sci. Eng.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/jcm-226800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The development of science and technology requires UAV to improve the accuracy of path planning to better apply in the military field and serve the people. The research proposes to use the social spider algorithm to optimize the ant colony algorithm, and jointly build an IACA to deal with the optimal selection problem of UAV path planning. Firstly, the swarm spider algorithm is used to make a reasonable division and planning of the UAV’s flight field. Secondly, the AC is used to adjust and control the UAV’s state and path. Then, the IACA is formed to carry out performance simulation and comparison experiments on the optimal path planning of the UAV to verify the superiority of the research algorithm. The results show that the maximum number of iterations of the original AC and the IACA is 100, but the IACA under the route planning optimization reaches the convergence state in 32 generations; Moreover, when the number of iterations is about 20 generations, there will be a stable fitness value, which saves time for the experiment to find the optimal path. In the simulation experiment, it is assumed that three UAVs will form a formation to conduct the experiment, and the multiple UAVs will be subject to global track planning and repeated rolling time domain track planning. The autonomous operation time of multiple UAVs through the assembly point is (5.30 s, 5.79 s, 9.29 s). The distance between UAVs during flight is predicted. It is found that the nearest distance is 2.3309 m near t= 6.65 s, which is in line with the safety distance standard. Under the improved algorithm, the speed in all directions is also relatively gentle. All the above results show that the improved algorithm can effectively improve the iteration speed and save time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多无人机小区域自主飞行的最优轨迹规划算法
科学技术的发展要求无人机提高路径规划的精度,以便更好地应用于军事领域,为人民服务。本研究提出利用社交蜘蛛算法对蚁群算法进行优化,共同构建IACA来处理无人机路径规划的最优选择问题。首先,利用群蜘蛛算法对无人机飞行场进行合理划分和规划;其次,利用交流系统对无人机的状态和路径进行调节和控制。然后,形成IACA,对无人机的最优路径规划进行性能仿真和对比实验,验证研究算法的优越性。结果表明:原AC和IACA的最大迭代次数为100次,但路由规划优化下的IACA在32代后才达到收敛状态;并且,当迭代次数在20代左右时,会有一个稳定的适应度值,节省了实验寻找最优路径的时间。在仿真实验中,假设三架无人机形成编队进行实验,多架无人机进行全局航迹规划和重复滚动时域航迹规划。多架无人机通过集合点的自主作业时间分别为(5.30 s, 5.79 s, 9.29 s),并预测了无人机在飞行过程中的距离。在t= 6.65 s附近,最近距离为2.3309 m,符合安全距离标准。在改进算法下,各个方向的速度也相对平缓。以上结果表明,改进后的算法可以有效地提高迭代速度,节省时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Retracted to: Design and dynamics simulation of vehicle active occupant restraint protection system Flip-OFDM Optical MIMO Based VLC System Using ML/DL Approach Using the Structure-Behavior Coalescence Method to Formalize the Action Flow Semantics of UML 2.0 Activity Diagrams Accurate Calibration and Scalable Bandwidth Sharing of Multi-Queue SSDs Looking to Personalize Gaze Estimation Using Transformers
×
引用
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