一种基于双动态生物地理的学习粒子群优化无人机路径规划算法

Y. Ji, Xinchao Zhao, Junling Hao
{"title":"一种基于双动态生物地理的学习粒子群优化无人机路径规划算法","authors":"Y. Ji, Xinchao Zhao, Junling Hao","doi":"10.1155/2022/8519708","DOIUrl":null,"url":null,"abstract":"Particle swarm optimization (PSO), one of the classical path planning algorithms, has been considered for unmanned aerial vehicle (UAV) path planning more frequently in recent years. A large amount of studies on UAV path planning based on modified PSO have been reported. However, most UAV path planning algorithms still optimize only one kind terrain problem which is mountain terrain. At the same time, many modified PSO algorithms also have some problems, such as insufficient convergence and unsatisfactory efficiency. In this paper, six kinds of terrain functions of UAV path planning are proposed to simulate real-world application. The terrain functions contain city, village without houses, village with houses, mountainous area without houses, mountainous area with houses, and mountainous area with a huge building. Inspired by CLPSO and BLPSO, we proposed a new double-dynamic biogeography-based learning particle swarm optimization (DDBLPSO) algorithm to solve these problems. The double-dynamic biogeography-based learning strategy replacing the traditional learning mechanism from the personal and global best particles is used to select the learning particles. In this strategy, each particle will learn from the better one of two selected particles which are not worse than itself. However, one random component of particle will replaced by corresponding component of other particle if all components of the particle only learn from itself. In this way, particles sufficiently learn from better objects and maintain the ability of jumping out of local optimality. The superiority of our algorithm is verified with four relevant algorithms, a PSO variant, and a BBO variant on the benchmark suite of CEC2015. Real-world application demonstrates that the algorithm we proposed outperforms four relevant algorithms, a PSO variant, and a BBO variant both in small-scale problems and large-scale problems. This paper shows a good application of our novel algorithm.","PeriodicalId":18790,"journal":{"name":"Mob. Inf. Syst.","volume":"7 1","pages":"8519708:1-8519708:23"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A Novel UAV Path Planning Algorithm Based on Double-Dynamic Biogeography-Based Learning Particle Swarm Optimization\",\"authors\":\"Y. Ji, Xinchao Zhao, Junling Hao\",\"doi\":\"10.1155/2022/8519708\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Particle swarm optimization (PSO), one of the classical path planning algorithms, has been considered for unmanned aerial vehicle (UAV) path planning more frequently in recent years. A large amount of studies on UAV path planning based on modified PSO have been reported. However, most UAV path planning algorithms still optimize only one kind terrain problem which is mountain terrain. At the same time, many modified PSO algorithms also have some problems, such as insufficient convergence and unsatisfactory efficiency. In this paper, six kinds of terrain functions of UAV path planning are proposed to simulate real-world application. The terrain functions contain city, village without houses, village with houses, mountainous area without houses, mountainous area with houses, and mountainous area with a huge building. Inspired by CLPSO and BLPSO, we proposed a new double-dynamic biogeography-based learning particle swarm optimization (DDBLPSO) algorithm to solve these problems. The double-dynamic biogeography-based learning strategy replacing the traditional learning mechanism from the personal and global best particles is used to select the learning particles. In this strategy, each particle will learn from the better one of two selected particles which are not worse than itself. However, one random component of particle will replaced by corresponding component of other particle if all components of the particle only learn from itself. In this way, particles sufficiently learn from better objects and maintain the ability of jumping out of local optimality. The superiority of our algorithm is verified with four relevant algorithms, a PSO variant, and a BBO variant on the benchmark suite of CEC2015. Real-world application demonstrates that the algorithm we proposed outperforms four relevant algorithms, a PSO variant, and a BBO variant both in small-scale problems and large-scale problems. This paper shows a good application of our novel algorithm.\",\"PeriodicalId\":18790,\"journal\":{\"name\":\"Mob. Inf. Syst.\",\"volume\":\"7 1\",\"pages\":\"8519708:1-8519708:23\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mob. Inf. Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2022/8519708\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mob. Inf. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2022/8519708","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

粒子群优化算法(PSO)是一种经典的无人机路径规划算法,近年来在无人机路径规划中得到越来越多的研究。基于改进粒子群算法的无人机路径规划研究已经有大量报道。然而,大多数无人机路径规划算法仍然只优化一种地形问题,即山地地形。同时,许多改进的粒子群算法也存在收敛性不足、效率不理想等问题。本文提出了六种用于无人机路径规划的地形函数,以模拟实际应用。地形功能分为城市、无房村、有房村、无房山区、有房山区、高楼山区。在CLPSO和BLPSO的启发下,我们提出了一种新的基于双动态生物地理的学习粒子群优化(DDBLPSO)算法来解决这些问题。采用基于生物地理的双动态学习策略,取代了传统的基于个体和全局最佳粒子的学习机制来选择学习粒子。在这个策略中,每个粒子将从两个不比自己差的粒子中选择一个更好的粒子学习。然而,如果粒子的所有成分都只向自身学习,则粒子的一个随机成分将被其他粒子的相应成分所取代。这样,粒子充分地从更好的对象中学习,并保持跳出局部最优的能力。在CEC2015的基准测试套件上,通过四种相关算法(PSO变体和BBO变体)验证了我们算法的优越性。实际应用表明,我们提出的算法在小规模问题和大规模问题上都优于四种相关算法,一种PSO变体和一种BBO变体。本文展示了该算法的良好应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel UAV Path Planning Algorithm Based on Double-Dynamic Biogeography-Based Learning Particle Swarm Optimization
Particle swarm optimization (PSO), one of the classical path planning algorithms, has been considered for unmanned aerial vehicle (UAV) path planning more frequently in recent years. A large amount of studies on UAV path planning based on modified PSO have been reported. However, most UAV path planning algorithms still optimize only one kind terrain problem which is mountain terrain. At the same time, many modified PSO algorithms also have some problems, such as insufficient convergence and unsatisfactory efficiency. In this paper, six kinds of terrain functions of UAV path planning are proposed to simulate real-world application. The terrain functions contain city, village without houses, village with houses, mountainous area without houses, mountainous area with houses, and mountainous area with a huge building. Inspired by CLPSO and BLPSO, we proposed a new double-dynamic biogeography-based learning particle swarm optimization (DDBLPSO) algorithm to solve these problems. The double-dynamic biogeography-based learning strategy replacing the traditional learning mechanism from the personal and global best particles is used to select the learning particles. In this strategy, each particle will learn from the better one of two selected particles which are not worse than itself. However, one random component of particle will replaced by corresponding component of other particle if all components of the particle only learn from itself. In this way, particles sufficiently learn from better objects and maintain the ability of jumping out of local optimality. The superiority of our algorithm is verified with four relevant algorithms, a PSO variant, and a BBO variant on the benchmark suite of CEC2015. Real-world application demonstrates that the algorithm we proposed outperforms four relevant algorithms, a PSO variant, and a BBO variant both in small-scale problems and large-scale problems. This paper shows a good application of our novel algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信