Potential Functions based Sampling Heuristic For Optimal Path Planning

04/02/2017
by   Ahmed Hussain Qureshi, et al.
0

Rapidly-exploring Random Tree Star(RRT*) is a recently proposed extension of Rapidly-exploring Random Tree (RRT) algorithm that provides a collision-free, asymptotically optimal path regardless of obstacle's geometry in a given environment. However, one of the limitations in the RRT* algorithm is slow convergence to optimal path solution. As a result, it consumes high memory as well as time due to a large number of iterations utilised in achieving optimal path solution. To overcome these limitations, we propose the Potential Function Based-RRT* (P-RRT*) that incorporates the Artificial Potential Field Algorithm in RRT*. The proposed algorithm allows a considerable decrease in the number of iterations and thus leads to more efficient memory utilization and an accelerated convergence rate. In order to illustrate the usefulness of the proposed algorithm in terms of space execution and convergence rate, this paper presents rigorous simulation based comparisons between the proposed techniques and RRT* under different environmental conditions. Moreover, both algorithms are also tested and compared under non-holonomic differential constraints.

READ FULL TEXT

Authors

page 15

page 16

page 17

page 18

page 19

07/22/2018

Potentially Guided Bidirectionalized RRT* for Fast Optimal Path Planning in Cluttered Environments

Rapidly-exploring Random Tree star (RRT*) has recently gained immense po...
02/11/2020

Accelerated RRT* and its evaluation on Autonomous Parking

Finding a collision-free path for autonomous parking is usually performe...
03/26/2021

COLREGs-Informed RRT* for Collision Avoidance of Marine Crafts

The paper proposes novel sampling strategies to compute the optimal path...
04/07/2022

Information-driven Path Planning for Hybrid Aerial Underwater Vehicles

This paper presents a novel Rapidly-exploring Adaptive Sampling Tree (RA...
08/18/2021

Optimised Informed RRTs for Mobile Robot Path Planning

Path planners based on basic rapidly-exploring random trees (RRTs) are q...
07/02/2021

Accelerating Kinodynamic RRT* Through Dimensionality Reduction

Sampling-based motion planning algorithms such as RRT* are well-known fo...
05/14/2022

BiAIT*: Symmetrical Bidirectional Optimal Path Planning with Adaptive Heuristic

Adaptively Informed Trees (AIT*) develops the problem-specific heuristic...

Code Repositories

p-rrtstar

Artificial potential fields based directionalized sampling for RRT*


view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.