A FUSION ALGORITHM FOR PATH PLANNING OF MOBILE ROBOTS IN ENVIRONMENTS WITH DYNAMIC OBSTACLES

被引:0
|
作者
Lv, Chongyang [1 ,2 ]
Fan, Xuejie [1 ,2 ]
Sun, Mingxiao [3 ]
机构
[1] Harbin Univ Sci & Technol, Coll Sci, Harbin 150080, Peoples R China
[2] Harbin Univ Sci & Technol, Heilongjiang Prov Key Lab Optimizat Control & Inte, Harbin 150080, Peoples R China
[3] Harbin Univ Sci & Technol, Coll Automat, Harbin 150080, Peoples R China
基金
美国国家科学基金会;
关键词
Mobile robot; fusion path planning; MAAPF; dynamic obstacle avoidance; VEHICLE;
D O I
10.2316/J.2024.206-0882
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To find a smooth, safe global path that avoids the local dynamic obstacle, this article proposes a method of integrating the improved A* algorithm and artificial potential field method, namely, MAAPF. Firstly, the multi-objective functions are introduced into the heuristic function of the A* algorithm to reduce the redundant points in the global path. When the robot detects dynamic obstacles, it searches the global path node as the local goal according to the robot's position and detecting range, meanwhile combining the dynamic obstacle trajectory predicted by the autoregressive model and static obstacles in the detection range to construct the local map, then through the artificial potential field method that is improved by adding the goal guidance factor and gravitational distance threshold to complete local dynamic obstacle avoidance, avoid the goal is unattainable and locally optimal. The simulation demonstrates that improving the A* algorithm within a 3D environment and the artificial potential field algorithm has better results than other algorithms. Besides, the MAAPF can obtain a safe optimal path in circumstances with dynamic obstacles.
引用
收藏
页码:94 / 105
页数:12
相关论文
共 50 条
  • [1] ON-LINE PATH PLANNING FOR MOBILE ROBOTS IN DYNAMIC ENVIRONMENTS
    Raja, P.
    Pugazhenthi, S.
    NEURAL NETWORK WORLD, 2012, 22 (01) : 67 - 83
  • [2] 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
  • [3] Effects of Heuristics in Path Planning for Mobile Robots in Uncertain and Dynamic Environments
    Ripon, Kazi Shah Nawaz
    Qaiduzzaman, Khandker M.
    Islam, Md. Aminul
    PROCEEDINGS OF THE 2016 19TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT), 2016, : 451 - 456
  • [4] 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
  • [5] 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)
  • [6] Asymptotical RRT-based Path Planning for Mobile Robots in Dynamic Environments
    Du, Zhuoyang
    Liu, Shan
    2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 5281 - 5286
  • [7] Path Planning for Mobile Robots in Dynamic Environments using Particle Swarm Optimization
    Raja, P.
    Pugazhenthi, S.
    2009 INTERNATIONAL CONFERENCE ON ADVANCES IN RECENT TECHNOLOGIES IN COMMUNICATION AND COMPUTING (ARTCOM 2009), 2009, : 401 - 405
  • [8] An Effective Dynamic Path Planning Approach for Mobile Robots Based on Ant Colony Fusion Dynamic Windows
    Yang, Liwei
    Fu, Lixia
    Li, Ping
    Mao, Jianlin
    Guo, Ning
    MACHINES, 2022, 10 (01)
  • [9] An Improved Global and Local Fusion Path-Planning Algorithm for Mobile Robots
    Shi, Yongliang
    Huang, Shucheng
    Li, Mingxing
    SENSORS, 2024, 24 (24)
  • [10] Path planning for mobile robots in complex environments based on improved ant colony algorithm
    Shi, Yuzhuo
    Zhang, Huijie
    Li, Zhisheng
    Hao, Kun
    Liu, Yonglei
    Zhao, Lu
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2023, 20 (09) : 15568 - 15602