<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-13T14:53:41Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:10256/28344" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:10256/28344</identifier><datestamp>2026-03-05T20:11:08Z</datestamp><setSpec>com_2072_452992</setSpec><setSpec>com_2072_2054</setSpec><setSpec>col_2072_452994</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>A Bug-based Path Planner Guided with Homotopy Classes</dc:title>
   <dc:creator>Hernàndez Bes, Emili</dc:creator>
   <dc:creator>Carreras Pérez, Marc</dc:creator>
   <dc:creator>Ridao Rodríguez, Pere</dc:creator>
   <dc:subject>Robòtica</dc:subject>
   <dc:subject>Robotics</dc:subject>
   <dc:subject>Algorismes</dc:subject>
   <dc:subject>Algorithms</dc:subject>
   <dcterms:abstract>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</dcterms:abstract>
   <dcterms:dateAccepted>2026-03-05T20:11:08Z</dcterms:dateAccepted>
   <dcterms:available>2026-03-05T20:11:08Z</dcterms:available>
   <dcterms:created>2026-03-05T20:11:08Z</dcterms:created>
   <dcterms:issued>2012</dcterms:issued>
   <dc:type>info:eu-repo/semantics/bookPart</dc:type>
   <dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
   <dc:type>peer-reviewed</dc:type>
   <dc:identifier>https://hdl.handle.net/10256/28344</dc:identifier>
   <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.5220/0004041201230131</dc:relation>
   <dc:relation>info:eu-repo/semantics/altIdentifier/issn/2184-2809</dc:relation>
   <dc:relation>info:eu-repo/semantics/altIdentifier/isbn/978-989-8565-22-8</dc:relation>
   <dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 International</dc:rights>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
   <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
   <dc:publisher>SciTePress</dc:publisher>
   <dc:source>ICINCO 2012: Proceedings of the 9th International Conference on Informatics in Control, Automation and Robotics: July 28-31, 2012, in Rome, Italy: volume 2, SciTePress, 2012, pp. 123-131</dc:source>
   <dc:source>Llibres / Capítols de LLibre (D-ATC)</dc:source>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>