Improved BiRRT* with Artificial Potential Field-Based Sampling Point and Catmull Roll Interpolation in Robot Path Planning

Traditional RRT-based path planning for an unmanned ground vehicle (UGV) is highly influenced by random sample point generation, number of inflexions towards the target and search efficiency to find the shortest path through the obstacle environment. To deal with these challenges, we propose a path planning method as an enhanced bi-directional-rapidly exploring random tree (RRT) * to handle the shortcomings of the traditional algorithms. It uses the artificial potential field (APF) to identify obstacle space and employ non-uniform sample points accordingly towards the goal point. It improves path generation ability and obstacle avoidance, resulting in faster convergence and fewer inflexion points. For managing system dynamics, the generated pathways are additionally refined by the use of Catmull-Rom Spline Interpolation, producing smoother planned trajectories. Simulation shows that our enhanced bi-directional RRT* algorithm outperforms traditional methods to generate the shortest path while avoiding obstacles.

Authors

Publication Details

Published
2024-10-04
DOI
https://doi.org/10.1109/i4c62240.2024.10748452
Citations
2
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved BiRRT* with Artificial Potential Field-Based Sampling Point and Catmull Roll Interpolation in Robot Path Planning

M Sivapalanirajan, B. Vigneshwaran, A Sowmiya, Sujay Chandran R et al.
2 citations
Robotic Path Planning Algorithms
0.50
article

Improved BiRRT* with Artificial Potential Field-Based Sampling Point and Catmull Roll Interpolation in Robot Path Planning

M Sivapalanirajan, B. Vigneshwaran, A Sowmiya, Sujay Chandran R, Arjun Krishna, A Reginold
article en
2 citations

Abstract

Traditional RRT-based path planning for an unmanned ground vehicle (UGV) is highly influenced by random sample point generation, number of inflexions towards the target and search efficiency to find the shortest path through the obstacle environment. To deal with these challenges, we propose a path planning method as an enhanced bi-directional-rapidly exploring random tree (RRT) * to handle the shortcomings of the traditional algorithms. It uses the artificial potential field (APF) to identify obstacle space and employ non-uniform sample points accordingly towards the goal point. It improves path generation ability and obstacle avoidance, resulting in faster convergence and fewer inflexion points. For managing system dynamics, the generated pathways are additionally refined by the use of Catmull-Rom Spline Interpolation, producing smoother planned trajectories. Simulation shows that our enhanced bi-directional RRT* algorithm outperforms traditional methods to generate the shortest path while avoiding obstacles.

Openalex Percentile: Top 33%
Robotic Path Planning Algorithms
0.50
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.