Enhancing Swarm Intelligence for Obstacle Avoidance with Multi-Strategy and Improved Dung Beetle Optimization Algorithm in Mobile Robot Navigation

被引:11
|
作者
Li, Longhai [1 ]
Liu, Lili [1 ]
Shao, Yuxuan [1 ]
Zhang, Xu [1 ]
Chen, Yue [1 ]
Guo, Ce [2 ]
Nian, Heng [3 ]
机构
[1] Xuzhou Univ Technol, Sch Mech & Elect Engn, Xuzhou 221018, Peoples R China
[2] Nanjing Univ Aeronaut & Astronaut, Inst Bioinspired Struct & Surface Engn, Nanjing 210016, Peoples R China
[3] Zhejiang Univ, Coll Elect Engn, Hangzhou 310027, Peoples R China
基金
中国国家自然科学基金;
关键词
dung beetle optimization (DBO) algorithm; multi-strategy and improved DBO (MSIDBO) algorithm; population diversity; convergence speed; global exploration; path planning; FRAMEWORK;
D O I
10.3390/electronics12214462
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Dung Beetle Optimization (DBO) algorithm is a powerful metaheuristic algorithm that is widely used for optimization problems. However, the DBO algorithm has limitations in balancing global exploration and local exploitation capabilities, often leading to getting stuck in local optima. To overcome these limitations and address global optimization problems, this study introduces the Multi-Strategy and Improved DBO (MSIDBO) Algorithm. The MSIDBO algorithm incorporates several advanced computational techniques to enhance its performance. Firstly, it introduces a random reverse learning strategy to improve population diversity and mitigate early convergence or local stagnation issues present in the DBO algorithm. Additionally, a fitness-distance balancing strategy is employed to better manage the trade-off between diversity and convergence within the population. Furthermore, the algorithm utilizes a spiral foraging strategy to enhance precision, promote strong exploratory capabilities, and prevent being trapped in local optima. To further enhance the global search ability and particle utilization of the MSIDBO algorithm, it combines the Optimal Dimension-Wise Gaussian Mutation strategy. By minimizing premature convergence, population diversity is increased, and the convergence of the algorithm is accelerated. This expansion of the search space reduces the likelihood of being trapped in local optima during the evolutionary process. To demonstrate the effectiveness of the MSIDBO algorithm, extensive experiments are conducted using benchmark test functions, comparing its performance against other well-known metaheuristic algorithms. The results highlight the feasibility and superiority of MSIDBO in solving optimization problems. Moreover, the MSIDBO algorithm is applied to path planning simulation experiments to showcase its practical application potential. A comparison with the DBO algorithm shows that MSIDBO generates shorter and faster paths, effectively addressing real-world application problems.
引用
收藏
页数:38
相关论文
共 50 条
  • [1] Multi-strategy cooperative enhancement dung beetle optimizer and its application in obstacle avoidance navigation
    Tang, Xiaojie
    He, Zhengyang
    Jia, Chengfen
    SCIENTIFIC REPORTS, 2024, 14 (01):
  • [2] Dung Beetle Optimization Algorithm Based on Improved Multi-Strategy Fusion
    Fang, Rencheng
    Zhou, Tao
    Yu, Baohua
    Li, Zhigang
    Ma, Long
    Zhang, Yongcai
    ELECTRONICS, 2025, 14 (01):
  • [3] Multi-Strategy Improved Dung Beetle Optimization Algorithm and Its Applications
    Ye, Mingjun
    Zhou, Heng
    Yang, Haoyu
    Hu, Bin
    Wang, Xiong
    BIOMIMETICS, 2024, 9 (05)
  • [4] A multi-strategy fusion dung beetle optimization algorithm
    Li, Yihang
    Lv, Zhimin
    2024 5TH INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKS AND INTERNET OF THINGS, CNIOT 2024, 2024, : 352 - 358
  • [5] Multi-Strategy Fusion Improved Dung Beetle Optimization Algorithm and Engineering Design Application
    Zhang, Daming
    Wang, Zijian
    Zhao, Yanqing
    Sun, Fangjin
    IEEE ACCESS, 2024, 12 : 97771 - 97786
  • [6] A multi-strategy improved dung beetle optimisation algorithm and its application
    Gu, WeiGuang
    Wang, Fang
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2025, 28 (01):
  • [7] Multi-strategy Improved Pelican Optimization Algorithm for Mobile Robot Path Planning
    Li, Chun Qing
    Jiang, Zheng Feng
    Huang, Yong Ping
    INFORMATION TECHNOLOGY AND CONTROL, 2024, 53 (02): : 372 - 389
  • [8] A Multi-Strategy Dung Beetle Optimization Algorithm for Optimizing Constrained Engineering Problems
    Wang, Zilong
    Shao, Peng
    IEEE ACCESS, 2023, 11 : 98805 - 98817
  • [9] Application of the Multi-Strategy Improved Walrus Optimization Algorithm in Mobile Robot Path Planning
    Ke, Yongfu
    Shi, Limei
    Ji, Weinan
    Luo, Peng
    Guo, Lei
    IEEE ACCESS, 2024, 12 : 184216 - 184229
  • [10] Odometry Algorithm with Obstacle Avoidance on Mobile Robot Navigation
    Khoswanto, Handry
    Santoso, Petrus
    Lim, Resmana
    PROCEEDINGS OF SECOND INTERNATIONAL CONFERENCE ON ELECTRICAL SYSTEMS, TECHNOLOGY AND INFORMATION 2015 (ICESTI 2015), 2016, 365 : 155 - 161