Path planning of mobile robot utilizing an enhanced version of the A*_TEB algorithm

To solve the problem of low quality and long path of traditional A* algorithm, A novel path planning algorithm combining improved A* algorithm with Time Elastic Band (TEB) algorithm is proposed. Firstly, enhancements are made to the traditional A* algorithm by OPENLIST updating, path de-redundancy and path smoothing. Subsequently, the kinematic modeling of the mobile robot is carried out and the TEB algorithm is used to optimize the path, which is in line with the kinematic characteristics of the mobile robot. Finally, the improved A*_TEB algorithm is improved to generate a fusion path planning algorithm and simulation and physical verification are carried out. The experimental results show that when the fusion algorithm is used for path planning, the generated global path is smooth and does not collide with obstacles and the local path meets the dynamic constraints of the robot. Compared with the traditional A* algorithm, the path is shortened by 14.6%, the planning time is shortened by 3.9% and the number of turns is reduced by 25%.

Authors

Institutions

Publication Details

Journal
IET conference proceedings.
Published
2024-11-01
DOI
https://doi.org/10.1049/icp.2024.3705
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Path planning of mobile robot utilizing an enhanced version of the A*_TEB algorithm

Daojin Yao, Yulian Cao, Xiong Yin, Bolong Li et al.
IET conference proceedings.
Robotic Path Planning Algorithms
article

Path planning of mobile robot utilizing an enhanced version of the A*_TEB algorithm

Daojin Yao, Yulian Cao, Xiong Yin, Bolong Li, Xiaoming Wang, Bo Huang
article en

Abstract

To solve the problem of low quality and long path of traditional A* algorithm, A novel path planning algorithm combining improved A* algorithm with Time Elastic Band (TEB) algorithm is proposed. Firstly, enhancements are made to the traditional A* algorithm by OPENLIST updating, path de-redundancy and path smoothing. Subsequently, the kinematic modeling of the mobile robot is carried out and the TEB algorithm is used to optimize the path, which is in line with the kinematic characteristics of the mobile robot. Finally, the improved A*_TEB algorithm is improved to generate a fusion path planning algorithm and simulation and physical verification are carried out. The experimental results show that when the fusion algorithm is used for path planning, the generated global path is smooth and does not collide with obstacles and the local path meets the dynamic constraints of the robot. Compared with the traditional A* algorithm, the path is shortened by 14.6%, the planning time is shortened by 3.9% and the number of turns is reduced by 25%.

IET conference proceedings.Vol. 2023(49)
Beijing University of Posts and Telecommunications (CN), East China Jiaotong University (CN), China Power Engineering Consulting Group (China) (CN)
Openalex Percentile: Top 77%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Path planning of mobile robot utilizing an enhanced version of the A*_TEB algorithm — Daojin Yao, Yulian Cao, et al. · IET conference proceedings. (2024) | TGRS Research Map | TGRS