Research on Path Planning for Robot Based on Improved Design of Non-Standard Environment Map With Ant Colony Algorithm

被引:1
|
作者
Li, Feng [1 ,2 ]
Kim, Young-Chul [1 ]
Lyu, Ziang [1 ]
Zhang, Han [1 ]
机构
[1] Kunsan Natl Univ, Dept Mech Engn, Gunsan 54150, Jeollabuk Do, South Korea
[2] Zhengzhou Univ Econ & Business, Coll Smart Mfg, Zhengzhou 450007, Peoples R China
来源
IEEE ACCESS | 2023年 / 11卷
关键词
Robot path planning; non-standard map; grid map; ant colony algorithm; intelligence; safety degree;
D O I
10.1109/ACCESS.2023.3312940
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The maps used for the path planning of mobile robots are mostly grid maps, which are generated through independent design or sensor measurement to obtain relevant information and then modeling. To obtain the robot motion planning path more quickly, this paper proposes a method of robot motion path planning through the ant colony algorithm under a non-standard environment map. The non-standard environment map is used for standard grid design, and the grid map is optimized by the method of no safety distance added obstacle box selected and safety distance added obstacle box selected, then the path planning is carried out through the ant colony algorithm. In addition, the mutual correspondence between grid maps and real environment maps was solved by adding calibration objects. The experimental results show that this method can not only effectively solve the problem of ant colony algorithms under a non-standard real environment map, show the planning path and pose on the non-standard real environment map, moreover, the safety degree of the planning path in the real environment is also increased by 29.51%, ensuring the safety degree of the whole planning path, which improves the intelligent degree of robot motion path planning.
引用
下载
收藏
页码:99776 / 99791
页数:16
相关论文
共 50 条
  • [1] Non-Standard Map Robot Path Planning Approach Based on Ant Colony Algorithms
    Li, Feng
    Kim, Young-Chul
    Xu, Boyin
    SENSORS, 2023, 23 (17)
  • [2] Research on path planning of mobile robot based on improved ant colony algorithm
    Qiang Luo
    Haibao Wang
    Yan Zheng
    Jingchang He
    Neural Computing and Applications, 2020, 32 : 1555 - 1566
  • [3] Research on path planning of cleaning robot based on an improved ant colony algorithm
    Wang, Zhidong
    Wu, Changhong
    Xu, Jing
    Ling, Hongjie
    2020 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE COMMUNICATION AND NETWORK SECURITY (CSCNS2020), 2021, 336
  • [4] Research on path planning of mobile robot based on improved ant colony algorithm
    Wang Rui
    Wang Jinguo
    Wang Na
    PROCEEDINGS OF THE 2015 JOINT INTERNATIONAL MECHANICAL, ELECTRONIC AND INFORMATION TECHNOLOGY CONFERENCE (JIMET 2015), 2015, 10 : 1085 - 1088
  • [5] Research on path planning of mobile robot based on improved ant colony algorithm
    Luo, Qiang
    Wang, Haibao
    Zheng, Yan
    He, Jingchang
    NEURAL COMPUTING & APPLICATIONS, 2020, 32 (06): : 1555 - 1566
  • [6] Research on path planning of mobile robot based on improved ant colony algorithm
    Jiang M.
    Wang F.
    Ge Y.
    Sun L.
    Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument, 2019, 40 (02): : 113 - 121
  • [7] Research on Robot Path Planning Based on Improved Adaptive Ant Colony Algorithm
    Shao Xiaoqiang
    Lv Zhichao
    Zhao Xuan
    Nie Xinchao
    PROCEEDINGS OF THE 2019 31ST CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2019), 2019, : 506 - 510
  • [8] Robot path planning based on improved ant colony algorithm
    Xue, Yang
    Chen, Yuefan
    Ding, Zilong
    Huang, Xincao
    Xi, Dongxiang
    2021 POWER SYSTEM AND GREEN ENERGY CONFERENCE (PSGEC), 2021, : 129 - 133
  • [9] Robot Path Planning Based on Improved Ant Colony Algorithm
    Wang, Tao
    Zhao, Lianyu
    Jia, Yunhui
    Wang, Jutao
    2018 WRC SYMPOSIUM ON ADVANCED ROBOTICS AND AUTOMATION (WRC SARA), 2018, : 70 - 76
  • [10] Path Planning of Robot Based on Improved Ant Colony Algorithm
    Zhang, Ying
    Wang, Changtao
    Xia, Xinghua
    Sun, Ying
    2011 INTERNATIONAL CONFERENCE ON FUTURE INFORMATION ENGINEERING (ICFIE 2011), 2011, 8 : 256 - 261