Application of Improved Moth-Flame Optimization Algorithm for Robot Path Planning

被引:10
|
作者
Dai, Xuefeng [1 ]
Wei, Yang [1 ]
机构
[1] Qiqihar Univ, Sch Comp & Control Engn, Qiqihar 161006, Peoples R China
关键词
Benchmark testing; Optimization; Statistics; Sociology; Path planning; Licenses; Fires; Moth-flame optimization; quasi-opposition-based learning; spotted hyena optimization; path planning;
D O I
10.1109/ACCESS.2021.3100628
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Path planning is the focus and difficulty of research in the field of mobile robots, and it is the basis for further research and applications of robots. In order to obtain the global optimal path of the mobile robot, an improved moth-flame optimization (IMFO) algorithm is proposed in this paper. The IMFO features the following two improvement. Firstly, referring to the spotted hyena optimization (SHO) algorithm, the concept of historical best flame average is introduced to improve the moth-flame optimization (MFO) algorithm update law to increase the ability of the algorithm to jump out of the local optimum; Secondly, the quasi-opposition-based learning (QOBL) is used to perturb the location, increase the population diversity and improve the convergence rate of the algorithm. In order to evaluate the performance of the proposed algorithm, the IMFO algorithm is compared with three existing algorithms on three groups of different types of benchmark functions. The comparative results show that the IMFO algorithm is effective and has good performance in terms of jumping out of local optimum, balancing exploitation ability and exploration ability. Finally, the IMFO algorithm is applied to the path planning of the mobile robot, and computer simulations confirmed the algorithm's effectiveness.
引用
收藏
页码:105914 / 105925
页数:12
相关论文
共 50 条
  • [1] Application of vision measurement model with an improved moth-flame optimization algorithm
    Li, Yaru
    Wang, Zhongyu
    Cheng, Yinbao
    Tang, Yingqi
    Shang, Zhendong
    [J]. OPTICS EXPRESS, 2019, 27 (15) : 20800 - 20815
  • [2] An Improved Moth-Flame Optimization Algorithm for Engineering Problems
    Li, Yu
    Zhu, Xinya
    Liu, Jingsen
    [J]. SYMMETRY-BASEL, 2020, 12 (08):
  • [3] Path planning of UAV low altitude penetration based on improved moth-flame optimization
    基于改进飞蛾扑火算法的无人机低空突防路径规划
    [J]. 1600, Editorial Department of Journal of Chinese Inertial Technology (29): : 256 - 263
  • [4] An Improved Moth-Flame Optimization algorithm with hybrid search phase
    Pelusi, Danilo
    Mascella, Raffaele
    Tallini, Luca
    Nayak, Janmenjoy
    Naik, Bighnaraj
    Deng, Yong
    [J]. KNOWLEDGE-BASED SYSTEMS, 2020, 191 (191)
  • [5] An Ameliorated Moth-flame Optimization Algorithm
    Zhao, Xiao-dong
    Fang, Yi-ming
    Ma, Zhuang
    Xu, Miao
    [J]. 2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 2372 - 2377
  • [6] An improved moth-flame optimization algorithm based on fusion mechanism
    Jiang, Luchao
    Hao, Kuangrong
    Tang, Xue-song
    Wang, Tong
    Liu, Xiaoyan
    [J]. IECON 2021 - 47TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, 2021,
  • [7] Optimization Improvement and Clustering Application Based on Moth-Flame Algorithm
    Ye, Lvyang
    Huang, Huajuan
    Wei, Xiuxi
    [J]. INTELLIGENT COMPUTING METHODOLOGIES, PT III, 2022, 13395 : 769 - 784
  • [8] Tent chaos and simulated annealing improved moth-flame optimization algorithm
    Yue, Longfei
    Yang, Rennong
    Zhang, Yijie
    Yu, Yang
    Zhang, Zhenxing
    [J]. Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, 2019, 51 (05): : 146 - 154
  • [9] Improved moth-flame optimization algorithm with multi-strategy integration
    He, Jiawen
    Xu, Xianze
    Gao, Bo
    [J]. Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 2024, 50 (09): : 2862 - 2871
  • [10] Application of Improved Whale Optimization Algorithm in Robot Path Planning
    Zhao, Jun-Tao
    Luo, Xiao-Chuan
    Liu, Jun-Mi
    [J]. Dongbei Daxue Xuebao/Journal of Northeastern University, 2023, 44 (08): : 1065 - 1071