Simulation of Dynamic Path Planning of Symmetrical Trajectory of Mobile Robots Based on Improved A* and Artificial Potential Field Fusion for Natural Resource Exploration

被引:2
|
作者
Kozhubaev, Yuriy [1 ]
Yang, Ruide [2 ]
机构
[1] Empress Catherine II St Petersburg Min Univ, Dept Informat & Comp Technol, 2 21st Line, St Petersburg 199106, Russia
[2] Peter Great St Petersburg Polytech Univ, Inst Comp Sci & Technol, Higher Sch Cyberphys Syst & Control, Peter Great St, St Petersburg 195251, Russia
来源
SYMMETRY-BASEL | 2024年 / 16卷 / 07期
关键词
mobile robot; raster map optimization; A* algorithm; artificial potential field method; global path planning; dynamic obstacle avoidance; n-order B & eacute; zier curve; ALGORITHM;
D O I
10.3390/sym16070801
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
With the rapid development of new-generation artificial intelligence and Internet of Things technology, mobile robot technology has been widely used in various fields. Among them, the autonomous path-planning technology of mobile robots is one of the cores for realizing their autonomous driving and obstacle avoidance. This study conducts an in-depth discussion on the real-time and dynamic obstacle avoidance capabilities of mobile robot path planning. First, we proposed a preprocessing method for obstacles in the grid map, focusing on the closed processing of the internal space of concave obstacles to ensure the feasibility of the path while effectively reducing the number of grid nodes searched by the A* algorithm, thereby improving path search efficiency. Secondly, in order to achieve static global path planning, this study adopts the A algorithm. However, in practice, algorithm A has problems such as a large number of node traversals, low search efficiency, redundant path nodes, and uneven turning angles. To solve these problems, we optimized the A* algorithm, focusing on optimizing the heuristic function and weight coefficient to reduce the number of node traversals and improve search efficiency. In addition, we use the Bezier curve method to smooth the path and remove redundant nodes, thereby reducing the turning angle. Then, in order to achieve dynamic local path planning, this study adopts the artificial potential field method. However, the artificial potential field method has the problems of unreachable target points and local minima. In order to solve these problems, we optimized the repulsion field so that the target point is at the lowest point of the global energy of the gravitational field and the repulsive field and eliminated the local optimal point. Finally, for the path-planning problem of mobile robots in dynamic environments, this study proposes a hybrid path-planning method based on a combination of the improved A* algorithm and the artificial potential field method. In this study, we not only focus on the efficiency of mobile robot path planning and real-time dynamic obstacle avoidance capabilities but also pay special attention to the symmetry of the final path. By introducing symmetry, we can more intuitively judge whether the path is close to the optimal state. Symmetry is an important criterion for us to evaluate the performance of the final path.
引用
收藏
页数:23
相关论文
共 50 条
  • [1] Dynamic path planning of mobile robot based on artificial potential field
    He, Naifeng
    Su, Yifan
    Guo, Jilu
    Fan, Xiaoliang
    Liu, Zihong
    Wang, Bolun
    2020 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND HUMAN-COMPUTER INTERACTION (ICHCI 2020), 2020, : 259 - 264
  • [2] An Improved Path Planning Method Based on Artificial Potential Field for a Mobile Robot
    Chen, Wenbai
    Wu, Xibao
    Lu, Yang
    CYBERNETICS AND INFORMATION TECHNOLOGIES, 2015, 15 (02) : 181 - 191
  • [3] Improved Artificial Potential Field Method for Mobile Robots Path Planning in a Corridor Environment
    Zhang, Yuanyuan
    PROCEEDINGS OF 2022 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION (IEEE ICMA 2022), 2022, : 185 - 190
  • [4] Path Planning of Mobile Robots Based on A* Algorithm and Artificial Potential Field Algorithm
    Wang H.
    Hao C.
    Zhang P.
    Zhang M.
    Yin P.
    Zhang Y.
    Zhongguo Jixie Gongcheng/China Mechanical Engineering, 2019, 30 (20): : 2489 - 2496
  • [5] Mobile Robot Path Planning Based on Improved Artificial Potential Field Method
    Wang Siming
    Zhao Tiantian
    Li Weijie
    2018 IEEE INTERNATIONAL CONFERENCE OF INTELLIGENT ROBOTICS AND CONTROL ENGINEERING (IRCE), 2018, : 29 - 33
  • [6] Path Planning of Mobile Robot Based on Improved Artificial Potential Field Method
    Ni, Jianyun
    Du, Helei
    Wang, Tie
    Li, Hao
    Xue, Chenyang
    2023 35TH CHINESE CONTROL AND DECISION CONFERENCE, CCDC, 2023, : 2058 - 2063
  • [7] Research on path planning of mobile robot based on improved artificial potential field
    Wang Rui
    Wang Jinguo
    Wang Na
    PROCEEDINGS OF THE 2015 JOINT INTERNATIONAL MECHANICAL, ELECTRONIC AND INFORMATION TECHNOLOGY CONFERENCE (JIMET 2015), 2015, 10 : 660 - 663
  • [8] Mobile Robot Dynamic Path Planning Based on Artificial Potential Field Approach
    Shi, Pu
    Hua, Jianning
    MECHATRONICS AND INTELLIGENT MATERIALS II, PTS 1-6, 2012, 490-495 : 994 - 998
  • [9] Mobile Robot Path Planning Based on Artificial Potential Field Method
    Zhang, Baofeng
    Wang, Yachun
    Zhang, Xiaoling
    APPLIED DECISIONS IN AREA OF MECHANICAL ENGINEERING AND INDUSTRIAL MANUFACTURING, 2014, 577 : 350 - +
  • [10] Path Planning of Mobile Robots Based on Ant Colony Algorithm and Artificial Potential Field Algorithm
    Shi W.
    Ning N.
    Song C.
    Ning W.
    Nongye Jixie Xuebao/Transactions of the Chinese Society for Agricultural Machinery, 2023, 54 (12): : 407 - 416