Hybrid Path Planning Based on Safe A* Algorithm and Adaptive Window Approach for Mobile Robot in Large-Scale Dynamic Environment

被引:148
作者
Zhong, Xunyu [1 ]
Tian, Jun [1 ]
Hu, Huosheng [2 ]
Peng, Xiafu [1 ]
机构
[1] Xiamen Univ, Sch Aerosp Engn, Xiamen, Fujian, Peoples R China
[2] Univ Essex, Sch Comp Sci & Elect Engn, Colchester, Essex, England
基金
中国国家自然科学基金;
关键词
Mobile robot; Hybrid path planning; Safe A* algorithm; Adaptive window approach; Key path points;
D O I
10.1007/s10846-019-01112-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
When mobile robot used in large-scale dynamic environments, it face more challenging problems in real-time path planning and collision-free path tracking. This paper presents a new hybrid path planning method that combines A* algorithm with adaptive window approach to conduct global path planning, real-time tracking and obstacles avoidance for mobile robot in large-scale dynamic environments. Firstly, a safe A* algorithm is designed to simplify the calculation of risk cost function and distance cost. Secondly, key path points are extracted from the planned path which generated by the safe A* to reduce the number of the grid nodes for smooth path tracking. Finally, the real-time motion planning based on adaptive window approach is adopted to achieve the simultaneous path tracking and obstacle avoidance (SPTaOA) together the switching of the key path points. The simulation and practical experiments are conducted to verify the feasibility and performance of the proposed method. The results show that the proposed hybrid path planning method, used for global path planning, tracking and obstacles avoidance, can meet the application needs of mobile robots in complex dynamic environments.
引用
收藏
页码:65 / 77
页数:13
相关论文
共 31 条
[1]   Multi-Heuristic A* [J].
Aine, Sandip ;
Swaminathan, Siddharth ;
Narayanan, Venkatraman ;
Hwang, Victor ;
Likhachev, Maxim .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2016, 35 (1-3) :224-243
[2]   Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments [J].
Ammar, Adel ;
Bennaceur, Hachemi ;
Chaari, Imen ;
Koubaa, Anis ;
Alajlan, Maram .
SOFT COMPUTING, 2016, 20 (10) :4149-4171
[3]  
Aykut Z., 2018, INT J SEMANT COMPUT, V12, P43
[4]   Limited-Damage A*: A path search algorithm that considers damage as a feasibility criterion [J].
Bayili, Serhat ;
Polat, Faruk .
KNOWLEDGE-BASED SYSTEMS, 2011, 24 (04) :501-512
[5]   Persistent Homology for Path Planning in Uncertain Environments [J].
Bhattacharya, Subhrajit ;
Ghrist, Robert ;
Kumar, Vijay .
IEEE TRANSACTIONS ON ROBOTICS, 2015, 31 (03) :578-590
[6]  
CHEN WJ, 2018, J MOD ONCOL, V15, P1
[7]  
Chen YB, 2017, CHIN CONT DECIS CONF, P7149, DOI 10.1109/CCDC.2017.7978473
[8]  
Cheng Chuangi, 2017, Journal of Xi'an Jiaotong University, V51, P137, DOI 10.7652/xjtuxb201711019
[9]   Two-way D* algorithm for path planning and replanning [J].
Dakulovic, Marija ;
Petrovic, Ivan .
ROBOTICS AND AUTONOMOUS SYSTEMS, 2011, 59 (05) :329-342
[10]   The dynamic window approach to collision avoidance [J].
Fox, D ;
Burgard, W ;
Thrun, S .
IEEE ROBOTICS & AUTOMATION MAGAZINE, 1997, 4 (01) :23-33