A Fast-Convergent Hyperbolic Tangent PSO Algorithm for UAVs Path Planning

IF 5.3 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Muhammad Haris;Dost Muhammad Saqib Bhatti;Haewoon Nam
{"title":"A Fast-Convergent Hyperbolic Tangent PSO Algorithm for UAVs Path Planning","authors":"Muhammad Haris;Dost Muhammad Saqib Bhatti;Haewoon Nam","doi":"10.1109/OJVT.2024.3391380","DOIUrl":null,"url":null,"abstract":"Particle Swarm Optimization (PSO) stands as a cornerstone among population-based swarm intelligence algorithms, serving as a versatile tool to tackle diverse scientific and engineering optimization challenges due to its straightforward implementation and promising optimization capabilities. Nonetheless, PSO has its limitations, notably its propensity for slow convergence. Traditionally, PSO operates by guiding swarms through positions determined by their initial velocities and acceleration components, encompassing cognitive and social information. In pursuit of expedited convergence, we introduce a novel approach: the Cognitive and Social Information-Based Hyperbolic Tangent Particle Swarm Optimization (HT-PSO) algorithm. This innovation draws inspiration from the activation functions employed in neural networks, with the singular aim of accelerating convergence. To combat the issue of slow convergence, we reengineer the cognitive and social acceleration coefficients of the PSO algorithm, leveraging the power of the hyperbolic tangent function. This strategic adjustment fosters a dynamic balance between exploration and exploitation, unleashing PSO's full potential. Our experimental trials encompass thirteen benchmark functions spanning unimodal and multimodal landscapes. Besides that, the proposed algorithm is also applied to different UAV path planning scenarios, underscoring its real-world relevance. The outcomes underscore the prowess of HT-PSO, showcasing significantly better convergence rates compared to the state-of-the-art.","PeriodicalId":34270,"journal":{"name":"IEEE Open Journal of Vehicular Technology","volume":"5 ","pages":"681-694"},"PeriodicalIF":5.3000,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10505768","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of Vehicular Technology","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10505768/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Particle Swarm Optimization (PSO) stands as a cornerstone among population-based swarm intelligence algorithms, serving as a versatile tool to tackle diverse scientific and engineering optimization challenges due to its straightforward implementation and promising optimization capabilities. Nonetheless, PSO has its limitations, notably its propensity for slow convergence. Traditionally, PSO operates by guiding swarms through positions determined by their initial velocities and acceleration components, encompassing cognitive and social information. In pursuit of expedited convergence, we introduce a novel approach: the Cognitive and Social Information-Based Hyperbolic Tangent Particle Swarm Optimization (HT-PSO) algorithm. This innovation draws inspiration from the activation functions employed in neural networks, with the singular aim of accelerating convergence. To combat the issue of slow convergence, we reengineer the cognitive and social acceleration coefficients of the PSO algorithm, leveraging the power of the hyperbolic tangent function. This strategic adjustment fosters a dynamic balance between exploration and exploitation, unleashing PSO's full potential. Our experimental trials encompass thirteen benchmark functions spanning unimodal and multimodal landscapes. Besides that, the proposed algorithm is also applied to different UAV path planning scenarios, underscoring its real-world relevance. The outcomes underscore the prowess of HT-PSO, showcasing significantly better convergence rates compared to the state-of-the-art.
用于无人飞行器路径规划的快速收敛双曲切线 PSO 算法
粒子群优化(PSO)是基于种群的群集智能算法的基石,由于其简单易行和极具潜力的优化能力,它已成为应对各种科学和工程优化挑战的通用工具。然而,PSO 也有其局限性,尤其是收敛速度较慢。传统上,PSO 的运行方式是引导蜂群通过由其初始速度和加速分量决定的位置,其中包括认知信息和社会信息。为了加快收敛速度,我们引入了一种新方法:基于认知和社会信息的双曲切线粒子群优化算法(HT-PSO)。这一创新从神经网络中使用的激活函数中汲取灵感,其唯一目的就是加快收敛速度。为了解决收敛速度慢的问题,我们利用双曲正切函数的力量,重新设计了 PSO 算法的认知和社会加速系数。这一战略性调整促进了探索和利用之间的动态平衡,充分释放了 PSO 的潜力。我们的实验测试涵盖了 13 个基准函数,跨越了单模态和多模态景观。此外,我们还将所提出的算法应用于不同的无人飞行器路径规划场景,以强调其与现实世界的相关性。结果表明,HT-PSO 的收敛率明显优于最先进的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
9.60
自引率
0.00%
发文量
25
审稿时长
10 weeks
×
引用
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学术官方微信