Potential functions based sampling heuristic for optimal path planning

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 obstacles geometry in a given environment. However, one of the limitation in the RRT* algorithm is slo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Autonomous robots Jg. 40; H. 6; S. 1079 - 1093
Hauptverfasser: Qureshi, Ahmed Hussain, Ayaz, Yasar
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.08.2016
Springer Nature B.V
Schlagworte:
Algorithms
Artificial Intelligence
Collision avoidance
Computer Imaging
Computer simulation
Control
Convergence
Engineering
Mechatronics
Path planning
Pattern Recognition and Graphics
Potential fields
Robotics
Robotics and Automation
Vision
Motion planning
Artificial potential fields
Sampling based algorithms
Convergence rate
Optimal path planning
ISSN:0929-5593, 1573-7527
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 obstacles geometry in a given environment. However, one of the limitation in the RRT* algorithm is slow convergence to optimal path solution. As a result it consumes high memory as well as time due to the large number of iterations utilised in achieving optimal path solution. To overcome these limitations, we propose the potential function based-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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0929-5593
1573-7527
DOI:10.1007/s10514-015-9518-0