Ítem


A comparison of homotopic path planning algorithms for robotic applications

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

This research was sponsored by the Spanish Government under the grant DPI2011-27977-C03-02 and the TRIDENT EU FP7-Project under the Grant Agreement No. ICT-248497

Elsevier

Director: Ministerio de Ciencia e Innovación (Espanya)
Autor: Hernàndez Bes, Emili
Carreras Pérez, Marc
Ridao Rodríguez, Pere
Data: 1 gener 2015
Resum: 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
This research was sponsored by the Spanish Government under the grant DPI2011-27977-C03-02 and the TRIDENT EU FP7-Project under the Grant Agreement No. ICT-248497
Format: application/pdf
Accés al document: http://hdl.handle.net/10256/11331
Llenguatge: eng
Editor: Elsevier
Col·lecció: info:eu-repo/semantics/altIdentifier/doi/10.1016/j.robot.2014.10.021
info:eu-repo/semantics/altIdentifier/issn/0921-8890
info:eu-repo/grantAgreement/MICINN//DPI2011-27977-C03-02/ES/COMAROB: ROBOTICA COOPERATIVA MARINA PARA EL MAPEO ACUSTICO Y LA INTERVENCION/
info:eu-repo/grantAgreement/EC/FP7/248497/EU/Marine Robots and Dexterous Manipulation for Enabling Autonomous Underwater Multipurpose Intervention Missions/TRIDENT
Drets: Tots els drets reservats
Matèria: Robots -- Moviment
Robots -- Motion
Homotopia, Teoria d’
Homotopy theory
Vehicles submergibles
Submersibles
Títol: A comparison of homotopic path planning algorithms for robotic applications
Tipus: info:eu-repo/semantics/article
Repositori: DUGiDocs

Matèries

Autors