Home /Research /Online path planning based on Rapidly-Exploring Random Trees
OTHER

Online path planning based on Rapidly-Exploring Random Trees

Jorge Nieto, Emanuel Slawiñski, Vicente Mut, Bernardo Wagner

Year
2010
Citations
28

Abstract

This paper proposes an online path-planning algorithm based on Rapidly-Exploring Random Trees (RRT) applied to the autonomous navigation of a mobile robot. The proposed planner includes two heuristics to improve the performance and generates a set of collision-free paths, from which the one with the most similarity to a reference path given by a supervisor human operator is chosen. This reference can be given a priori when setting the start and goal positions, and be defined as the straight path between them. Simulations and experiments are made to evaluate the performance of the proposed method.

Keywords

Motion planningHeuristicsComputer sciencePath (computing)Set (abstract data type)PlannerSupervisorMobile robotA priori and a posterioriRandom tree

Related papers

Browse all OTHER papers