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 条
  • [41] Improved Artificial Potential Field and Dynamic Window Method for Amphibious Robot Fish Path Planning
    Yang, Wenlin
    Wu, Peng
    Zhou, Xiaoqi
    Lv, Haoliang
    Liu, Xiaokai
    Zhang, Gong
    Hou, Zhicheng
    Wang, Weijun
    APPLIED SCIENCES-BASEL, 2021, 11 (05): : 1 - 15
  • [42] Research on global path planning algorithm for mobile robots based on improved A
    Xu, Xing
    Zeng, Jiazhu
    Zhao, Yun
    Lu, Xiaoshu
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 243
  • [43] Particle Swarm Algorithm Path-Planning Method for Mobile Robots Based on Artificial Potential Fields
    Zheng, Li
    Yu, Wenjie
    Li, Guangxu
    Qin, Guangxu
    Luo, Yunchuan
    SENSORS, 2023, 23 (13)
  • [44] A Hybrid Path Planning Method for Mobile Robot Based on Artificial Potential Field Method
    Kong, Haiyi
    Yang, Chenguang
    Ju, Zhaojie
    Liu, Jinguo
    INTELLIGENT ROBOTICS AND APPLICATIONS, ICIRA 2019, PART VI, 2019, 11745 : 325 - 331
  • [45] Adaptive GA-based Potential Field Algorithm for Collision-free Path Planning of Mobile Robots in Dynamic Environments
    Germi, Saeed Bakhshi
    Khosravi, Mohammad A.
    FesharakiFard, Rasul
    2018 6TH RSI INTERNATIONAL CONFERENCE ON ROBOTICS AND MECHATRONICS (ICROM 2018), 2018, : 28 - 33
  • [46] A dynamic fusion path planning algorithm for mobile robots incorporating improved IB-RRT∗ and deep reinforcement learning
    Liu A.
    Zhang B.
    Cui Q.
    Zhang D.
    Ni H.
    High Technology Letters, 2023, 29 (04) : 365 - 376
  • [47] Flight path planning of agriculture UAV based on improved artificial potential field method
    Zhang Yingkun
    PROCEEDINGS OF THE 30TH CHINESE CONTROL AND DECISION CONFERENCE (2018 CCDC), 2018, : 1526 - 1530
  • [48] MULTI-UUV PATH PLANNING BASED ON IMPROVED ARTIFICIAL POTENTIAL FIELD METHOD
    Zhang, Wei
    Wei, Shilin
    Zeng, Jia
    Wang, Naixin
    INTERNATIONAL JOURNAL OF ROBOTICS & AUTOMATION, 2021, 36 (04) : 231 - 239
  • [49] Mobile Robot Path Planning Based on Improved Ant Colony Fusion Dynamic Window Approach
    Shao, Lei
    Li, Qi
    Li, Chao
    Sun, Wentao
    2021 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION (IEEE ICMA 2021), 2021, : 1100 - 1105
  • [50] A modified Artificial Potential Field Algorithm for Mobile Robot Path Planning
    Qi, Ningning
    Ma, Bojun
    Liu, Xian'en
    Zhang, Zhenxin
    Ren, Dongchun
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 2603 - +