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 条
  • [31] Path Planning for Mobile Robots Based on the Improved DAPF-QRRT* Strategy
    Liu, Wenhao
    Wu, Hongyuan
    Xiong, Wentao
    Li, Xiaopeng
    Cai, Bofan
    Yu, Shengdong
    Ma, Jinyu
    ELECTRONICS, 2024, 13 (21)
  • [32] An Improved Global and Local Fusion Path-Planning Algorithm for Mobile Robots
    Shi, Yongliang
    Huang, Shucheng
    Li, Mingxing
    SENSORS, 2024, 24 (24)
  • [33] Reliable Path Planning Algorithm Based on Improved Artificial Potential Field Method
    Luo, Jie
    Wang, Zhong-Xun
    Pan, Kang-Lu
    IEEE ACCESS, 2022, 10 : 108276 - 108284
  • [34] Dynamic Path Planning of Mobile Robots Based on ABC Algorithm
    Ma, Qianzhi
    Lei, Xiujuan
    ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, AICI 2010, PT II, 2010, 6320 : 267 - 274
  • [35] Online path planning of cooperative mobile robots in unknown environments using improved Q-Learning and adaptive artificial potential field
    Ataollahi, Melika
    Farrokhi, Mohammad
    JOURNAL OF ENGINEERING-JOE, 2023, 2023 (02):
  • [36] Genetic algorithm based path planning and dynamic obstacle avoidance of mobile robots
    Han, WG
    Baek, SM
    Kuc, TY
    SMC '97 CONFERENCE PROCEEDINGS - 1997 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: CONFERENCE THEME: COMPUTATIONAL CYBERNETICS AND SIMULATION, 1997, : 2747 - 2751
  • [37] Path Planning for Mobile Robots Based on a Modified Potential Model
    Jia, Qian
    Wang, Xingsong
    2009 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION, VOLS 1-7, CONFERENCE PROCEEDINGS, 2009, : 4946 - 4951
  • [38] Path Planning for Mobile Robots Based on Improved Ant Colony Optimization
    Hsu, Chen-Chien
    Hou, Ru-Yu
    Wang, Wei-Yen
    2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, : 2777 - 2782
  • [39] A Hybrid Algorithm Based on Artificial Potential Field and BUG for Path Planning of Mobile Robot
    Wang, Mei
    Su, Zhiyong
    Tu, Dawei
    Lu, Xichang
    PROCEEDINGS OF 2013 2ND INTERNATIONAL CONFERENCE ON MEASUREMENT, INFORMATION AND CONTROL (ICMIC 2013), VOLS 1 & 2, 2013, : 1393 - 1398
  • [40] Fusion Algorithm of the Improved A* Algorithm and Segmented Bezier Curves for the Path Planning of Mobile Robots
    Lai, Rongshen
    Wu, Zhiyong
    Liu, Xiangui
    Zeng, Nianyin
    SUSTAINABILITY, 2023, 15 (03)