Metraipolis › archive › dc_658d21b4cc18
TRACE: Coverage Path Planning for Unknown Environments Using Hierarchical Coverage Tree — arXiv:2609.21777
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21777
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:30:19.706Z
- SHA-256 of the archived text
7d0f932b648c4109c8e1ca84c5697ad9d2b8bb5e4b56b7098241577b1f31f2a2- Stable URL of this page
https://metraipolis.com/documento/dc_658d21b4cc18
How to cite
TRACE: Coverage Path Planning for Unknown Environments Using Hierarchical Coverage Tree — arXiv:2609.21777 — arXiv (en), https://arxiv.org/abs/2609.21777 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_658d21b4cc18 (Metraipolis archive dc_658d21b4cc18, sha256 7d0f932b648c4109c8e1ca84c5697ad9d2b8bb5e4b56b7098241577b1f31f2a2)
BibTeX
@misc{dc658d21b4cc18,
title = {TRACE: Coverage Path Planning for Unknown Environments Using Hierarchical Coverage Tree — arXiv:2609.21777},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21777},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_658d21b4cc18; sha256 7d0f932b648c4109c8e1ca84c5697ad9d2b8bb5e4b56b7098241577b1f31f2a2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21777. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper presents a novel online coverage path planning (CPP) algorithm, called TRACE, for real-time coverage of unknown environments. TRACE is built upon a hierarchical coverage tree that provides a global representation of the evolving connectivity of the uncovered space. As the environment is incrementally revealed and covered, newly discovered obstacles and covered cells may fragment the remaining uncovered space into disconnected regions. TRACE recursively expands the corresponding tree nodes to explicitly represent these regions and organize them for subsequent coverage planning. Based on the updated tree, an incremental global tour is maintained to guide the coverage process. TRACE locally refines only the affected portions while preserving the visiting order of unchanged regions, thereby reducing the computational burden of global replanning and maintaining a consistent coverage progression. Guided by the global tour, a local planner generates back-and-forth coverage paths and switches to global-tour-aware planning to efficiently complete the target regions. Theoretical analysis establishes the computational complexity and complete coverage property of TRACE, and derives an approximation bound for the incremental global tour refinement. The performance of TRACE is evaluated through extensive high-fidelity simulations and real-robot experiments using a mobile robot. Comparative evaluations against six existing CPP methods demonstrate significant improvements in coverage time, path length, overlap ratio, and number of turns. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-21 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.21777 — 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-10T02:09:55.384Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).