A comparison of homotopic path planning algorithms for robotic applications

​
​ ​ scopusId Hernàndez Bes, Emili​ ​
Hernàndez Bes, Emili
orcId Carreras Pérez, Marc​ researcherId Carreras Pérez, Marc​ scopusId Carreras Pérez, Marc​ ​
Carreras Pérez, Marc
orcId Ridao Rodríguez, Pere​ ​ scopusId Ridao Rodríguez, Pere​ ​
Ridao Rodríguez, Pere
Full Text
Comparison-of-homotopic-path.pdf embargoed access ​
Request a copy
Request a copy
When filling the form you are requesting a copy of the article, that is deposited in the institutional repository (DUGiDocs), at the autor or main autor of the article. It will be the same author who decides to give a copy of the document to the person who requests it, if it considers it appropriate. In any case, the UdG Library doesn’t take part in this process because it is not authorized to provide restricted articles.
​
Share
​
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
Show full item record