Real-Time Randomized Path Planning for Robot Navigation

Mobile robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the robot’s capabilities. This poses the problem of planning a path through a continuous domain. Several approaches have been u...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bruce, James, Veloso, Manuela M.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Mobile robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the robot’s capabilities. This poses the problem of planning a path through a continuous domain. Several approaches have been used to address this problem each with some limitations, including state discretizations, planning efficiency, and lack of interleaved execution. Rapidly-exploring random trees (RRTs) are a recently developed algorithm on which fast continuous domain path planners can be based. In this work, we build a path planning system based on RRTs that interleaves planning and execution, first evaluating it in simulation and then applying it to physical robots. Our algorithm, ERRT (execution extended RRT), introduces two novel extensions of previous RRT work, the waypoint cache and adaptive cost search, which improve replanning efficiency and the quality of generated paths. ERRT is successfully applied to a multi-robot system. Results demonstrate that ERRT is improves efficiency and performs competitively with existing heuristic and reactive real-time path planning approaches. ERRT has shown to offer a major step with great potential for path planning in challenging continuous, highly dynamic domains.
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-45135-8_23