2026-04-17T05:39:59Zhttps://recercat.cat/oai/requestoai:recercat.cat:10256/283442026-03-05T20:11:08Zcom_2072_452992com_2072_2054col_2072_452994
RECERCAT
author
Hernàndez Bes, Emili
author
Carreras Pérez, Marc
author
Ridao Rodríguez, Pere
2026-03-05T20:11:08Z
2026-03-05T20:11:08Z
2012
https://hdl.handle.net/10256/28344
This paper proposes a bug-based path planning algorithm guided topologically with homotopy classes. Homotopy classes provide a topological description of how paths avoid obstacles in the workspace. They are generated with a method we developed, which builds a topological environment based on the workspace that allows to compute homotopy classes systematically. The homotopy classes are sorted according to a heuristic estimation of their lower bound. Only those with the smaller lower bound are used to guide the path planner we propose, called Homotopic Bug (HBug), which efficiently computes paths in the workspace that accomplish homotopy classes. Results show the feasibility of our method. A comparison with well-known path planners has also been included
Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ info:eu-repo/semantics/openAccess
Robòtica
Robotics
Algorismes
Algorithms
A Bug-based Path Planner Guided with Homotopy Classes
info:eu-repo/semantics/bookPart info:eu-repo/semantics/publishedVersion peer-reviewed