DUGiDocsA comparison of homotopic path planning algorithms for robotic applications
Texto Completo
Comparison-of-homotopic-path.pdf
Solicita copia
Al rellenar este formulario estáis solicitando una copia del artículo, depositado en el repositorio institucional (DUGiDocs), a su autor o al autor principal del artículo. Será el mismo autor quien decidirá enviar una copia del documento a quien lo solicite si lo considera oportuno. En todo caso, la Biblioteca de la UdG no interviene en este proceso ya que no está autorizada a facilitar artículos cuando éstos son de acceso restringido.
Compartir
This paper addresses the path planning problem for robotic applications using homotopy classes. These classes provide a topological description of how paths avoid obstacles, which is an added value to the path planning problem. Homotopy classes are generated and sorted according to a lower bound heuristic estimator using a method we developed. Then, the classes are used to constrain and guide path planning algorithms. Three different path planners are presented and compared: a graph-search algorithm called Homotopic A∗ (HA∗), a probabilistic sample-based algorithm called Homotopic RRT (HRRT), and a bug-based algorithm called Homotopic Bug (HBug). Our method has been tested in simulation and in an underwater bathymetric map to compute the trajectory of an Autonomous Underwater Vehicle (AUV). A comparison with well-known path planning algorithms has also been included. Results show that our homotopic path planners improve the quality of the solutions of their respective non-homotopic versions with similar computation time while keeping the topological constraints
Tots els drets reservats