Metraipolis › archive › dc_70b428dd3576
A Hierarchical Coverage Path Planning Algorithm for Unknown Environments — arXiv:2609.12595
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.12595
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T03:58:13.523Z
- SHA-256 of the archived text
763f20193ccd9f70d07d119547af59b012ef2341ef8e5c03fd11c6bff5b772fd- Stable URL of this page
https://metraipolis.com/documento/dc_70b428dd3576
How to cite
A Hierarchical Coverage Path Planning Algorithm for Unknown Environments — arXiv:2609.12595 — arXiv (en), https://arxiv.org/abs/2609.12595 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_70b428dd3576 (Metraipolis archive dc_70b428dd3576, sha256 763f20193ccd9f70d07d119547af59b012ef2341ef8e5c03fd11c6bff5b772fd)
BibTeX
@misc{dc70b428dd3576,
title = {A Hierarchical Coverage Path Planning Algorithm for Unknown Environments — arXiv:2609.12595},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.12595},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_70b428dd3576; sha256 763f20193ccd9f70d07d119547af59b012ef2341ef8e5c03fd11c6bff5b772fd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.12595. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper presents an online coverage path planning algorithm for unknown environments. During navigation, the initially unknown search area is progressively decomposed into disconnected subareas as new obstacle information is acquired and coverage proceeds. These subareas are organized in an incrementally constructed decomposition tree that preserves their hierarchical parent-child relationships. Based on this tree, a global coverage tour is maintained and updated online by prioritizing newly generated child subareas according to their exploration states and distances from the robot. A local planner then generates coverage motions within each selected subarea, allowing the robot to adapt its trajectory as the environment is gradually revealed. Its performance is evaluated via high-fidelity simulations in complex scenarios. The results show improved coverage efficiency in terms of path length and overlap ratio in comparison to three baseline algorithms. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-14 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.12595 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T03:44:44.728Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).