Multi-UAV Task Allocation Based on Improved Algorithm of Multi-objective Particle Swarm Optimization

Yang Gao, Yingzhou Zhang, Shurong Zhu, Yi Sun
{"title":"Multi-UAV Task Allocation Based on Improved Algorithm of Multi-objective Particle Swarm Optimization","authors":"Yang Gao, Yingzhou Zhang, Shurong Zhu, Yi Sun","doi":"10.1109/CYBERC.2018.00086","DOIUrl":null,"url":null,"abstract":"With the development of the technology of unmanned aerial vehicle (UAV), the multi-UAV task allocation has become a hot topic in recent years. Recently, many classical intelligent optimization algorithms have been applied to this problem, because the multi-UAV task allocation problem can be formalized as a NP-hard issue. However, most research treat this problem as a single objective optimization problem. In view of this situation, we use an improved algorithm of multi-objective particle swarm optimization (MOPSO) to solve the task allocation problem of multiple UAVs. We will take two stages of SMC resampling to improve the disadvantages in the MOPSO algorithm. In the first stage, resampling is used to improve the slow convergence of the particle swarm optimization in the middle and late stages. In the second stage, resampling is used to expand the search area of the particle swarm optimization algorithm and to prevent the algorithm from falling into the local optimal solution. The simulation results show that the improved algorithm has a good performance in solving the task allocation problem of multiple UAVs.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBERC.2018.00086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

With the development of the technology of unmanned aerial vehicle (UAV), the multi-UAV task allocation has become a hot topic in recent years. Recently, many classical intelligent optimization algorithms have been applied to this problem, because the multi-UAV task allocation problem can be formalized as a NP-hard issue. However, most research treat this problem as a single objective optimization problem. In view of this situation, we use an improved algorithm of multi-objective particle swarm optimization (MOPSO) to solve the task allocation problem of multiple UAVs. We will take two stages of SMC resampling to improve the disadvantages in the MOPSO algorithm. In the first stage, resampling is used to improve the slow convergence of the particle swarm optimization in the middle and late stages. In the second stage, resampling is used to expand the search area of the particle swarm optimization algorithm and to prevent the algorithm from falling into the local optimal solution. The simulation results show that the improved algorithm has a good performance in solving the task allocation problem of multiple UAVs.
基于改进多目标粒子群优化算法的多无人机任务分配
随着无人机技术的发展,多无人机任务分配已成为近年来的研究热点。由于多无人机任务分配问题可以形式化为np困难问题,近年来,许多经典的智能优化算法被应用于该问题。然而,大多数研究将此问题视为单一目标优化问题。针对这种情况,采用改进的多目标粒子群优化算法(MOPSO)来解决多无人机的任务分配问题。我们将采用两阶段的SMC重采样来改进MOPSO算法的缺点。在第一阶段,采用重采样的方法改善粒子群优化算法中后期收敛缓慢的问题;第二阶段,利用重采样扩大粒子群优化算法的搜索范围,防止算法陷入局部最优解。仿真结果表明,改进算法在解决多无人机任务分配问题上具有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信