TRACE: Coverage Path Planning for Unknown Environments Using Hierarchical Coverage Tree

arXiv:2609.21777 · cs.RO · Submitted 2026-09-18 · Read on arXiv

cs.RO

Submitted: 2026-09-18

Updated: 2026-09-18

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Trace — 34× in this paper · explained in 2 episodes
• Consistency — 3× in this paper · explained in 3 episodes
• Fidelity — 3× in this paper · explained in 2 episodes
• Robustness — 3× in this paper · explained in 5 episodes
• Approximation Bound — 2× in this paper · explained in 1 episode
• Active Vision — 1× in this paper · explained in 1 episode
• Reward Function — 1× in this paper · explained in 2 episodes
• Theoretical Guarantees — 1× in this paper · explained in 2 episodes

Sources

• Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions
• Motion Planning in Dynamic Environments: A Survey from Classical to Modern Methods

Related papers

• FMT x: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning
• MPCFormer: A physics-informed data-driven approach for explainable socially-aware autonomous driving
• RoboLab: A High-Fidelity Simulation Benchmark for Analysis of Task Generalist Policies
• ARC: A Reasoning Recipe for Robot Foundation Models
• HRDexDB: A 4D Dexterous Grasping Dataset Across Human and Multiple Robot Embodiments
• APT: Action Expert Pretraining Improves Instruction Generalization of Vision-Language-Action Policies