A Probability Adaptive Sampling-based Algorithm for Obstacle Avoidance Motion Planning Problems

In recent years, with the increasingly complex robot application environments, the research of robotic autonomous obstacle avoidance motion planning is one of the key technologies to improve its intelligence. In this paper, we present an improved algorithm based on Rapidly-exploring Random Tree (RRT...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Chinese Control Conference S. 4584 - 4589
Hauptverfasser: Mi, Kai, Zheng, Jun, Wang, Yunkan
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: Technical Committee on Control Theory, Chinese Association of Automation 01.07.2019
Schlagworte:
Collision avoidance
extending probability
Heuristic algorithms
Manipulator dynamics
motion planning
Planning
Polynomials
probability adaptive
Rapidly-exploring Random Tree
Voronoi diagram
ISSN:1934-1768
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In recent years, with the increasingly complex robot application environments, the research of robotic autonomous obstacle avoidance motion planning is one of the key technologies to improve its intelligence. In this paper, we present an improved algorithm based on Rapidly-exploring Random Tree (RRT) algorithm, which is called Probability Adaptive RRT (PARRT). We analyze the defects of the original algorithm in detail from the perspective of Voronoi diagram. For some complicated occasions, especially when the robot is surrounded by obstacles, the efficiency of the original algorithm will be greatly reduced. For this problem, we proposed an expansion probability adaptive method. By dynamically adjusting the extending probability of nodes near obstacles, the invalid node expansion is reduced effectively and the planning speed is greatly improved. Finally, we experiment in both two-dimensional space and the joint space of manipulators. The planning results show the improved effect of the proposed algorithm.
ISSN:1934-1768
DOI:10.23919/ChiCC.2019.8865181