基于改进果蝇优化算法的飞行冲突解决模拟研究

Yulong Sun;Guoshen Ding;Yandong Zhao;Renchi Zhang;Wenjun Wang
{"title":"基于改进果蝇优化算法的飞行冲突解决模拟研究","authors":"Yulong Sun;Guoshen Ding;Yandong Zhao;Renchi Zhang;Wenjun Wang","doi":"10.1109/JMASS.2024.3429514","DOIUrl":null,"url":null,"abstract":"Due to the increasingly widespread application of unmanned aerial vehicle (UAV), the study of flight conflict resolution can effectively avoid the collision of different UAVs. First, describe flight conflict resolution as an optimization problem. Second, the improved fruit fly optimization algorithm (IFOA) is proposed. The smell concentration judgment is equal to the coordinate instead of the reciprocal of the distance in order to make the variable accessible to be negative and occur with equal probability in the defined domain. Next, introduce the limited number of searches of the Artificial Bee Colony Algorithm to avoid falling into the local optimum. Meanwhile, generate a direction and distance of the fruit fly individual through roulette. Finally, the effectiveness of the algorithm is demonstrated by computational experiments on 18 benchmark functions and the simulation of the flight conflict resolution of two and four UAVs. The results show that compared with the standard fruit fly optimization algorithm, the IFOA has superior global convergence ability and effectively reduces the delay distance, which has important potential in flight conflict resolution.","PeriodicalId":100624,"journal":{"name":"IEEE Journal on Miniaturization for Air and Space Systems","volume":"5 3","pages":"200-209"},"PeriodicalIF":0.0000,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Flight Conflict Resolution Simulation Study Based on the Improved Fruit Fly Optimization Algorithm\",\"authors\":\"Yulong Sun;Guoshen Ding;Yandong Zhao;Renchi Zhang;Wenjun Wang\",\"doi\":\"10.1109/JMASS.2024.3429514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the increasingly widespread application of unmanned aerial vehicle (UAV), the study of flight conflict resolution can effectively avoid the collision of different UAVs. First, describe flight conflict resolution as an optimization problem. Second, the improved fruit fly optimization algorithm (IFOA) is proposed. The smell concentration judgment is equal to the coordinate instead of the reciprocal of the distance in order to make the variable accessible to be negative and occur with equal probability in the defined domain. Next, introduce the limited number of searches of the Artificial Bee Colony Algorithm to avoid falling into the local optimum. Meanwhile, generate a direction and distance of the fruit fly individual through roulette. Finally, the effectiveness of the algorithm is demonstrated by computational experiments on 18 benchmark functions and the simulation of the flight conflict resolution of two and four UAVs. The results show that compared with the standard fruit fly optimization algorithm, the IFOA has superior global convergence ability and effectively reduces the delay distance, which has important potential in flight conflict resolution.\",\"PeriodicalId\":100624,\"journal\":{\"name\":\"IEEE Journal on Miniaturization for Air and Space Systems\",\"volume\":\"5 3\",\"pages\":\"200-209\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Journal on Miniaturization for Air and Space Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10601245/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Journal on Miniaturization for Air and Space Systems","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10601245/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于无人飞行器(UAV)的应用越来越广泛,研究飞行冲突解决方法可以有效避免不同无人飞行器之间的碰撞。首先,将飞行冲突解决描述为一个优化问题。其次,提出改进的果蝇优化算法(IFOA)。气味浓度判断等于坐标,而不是距离的倒数,以使变量的可访问性为负,并在定义域中以相等的概率出现。接下来,引入人工蜂群算法的有限搜索次数,以避免陷入局部最优。同时,通过轮盘赌生成果蝇个体的方向和距离。最后,通过对 18 个基准函数的计算实验以及对两架和四架无人机飞行冲突解决的仿真,证明了该算法的有效性。结果表明,与标准果蝇优化算法相比,IFOA 具有更优越的全局收敛能力,并能有效减少延迟距离,在飞行冲突解决中具有重要潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Flight Conflict Resolution Simulation Study Based on the Improved Fruit Fly Optimization Algorithm
Due to the increasingly widespread application of unmanned aerial vehicle (UAV), the study of flight conflict resolution can effectively avoid the collision of different UAVs. First, describe flight conflict resolution as an optimization problem. Second, the improved fruit fly optimization algorithm (IFOA) is proposed. The smell concentration judgment is equal to the coordinate instead of the reciprocal of the distance in order to make the variable accessible to be negative and occur with equal probability in the defined domain. Next, introduce the limited number of searches of the Artificial Bee Colony Algorithm to avoid falling into the local optimum. Meanwhile, generate a direction and distance of the fruit fly individual through roulette. Finally, the effectiveness of the algorithm is demonstrated by computational experiments on 18 benchmark functions and the simulation of the flight conflict resolution of two and four UAVs. The results show that compared with the standard fruit fly optimization algorithm, the IFOA has superior global convergence ability and effectively reduces the delay distance, which has important potential in flight conflict resolution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.40
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信