arXiv (OAI Expanded)
open access
A Hierarchical Coverage Path Planning Algorithm for Unknown Environments
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 incre
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Tuning ROS 2 for Energy-Efficient Navigation: Empirical Insights from Costmap 2D Configurations#1070414
- Coverage optimization for UAV-aided Internet of Things with partial channel knowledge#818340
- CAGE: Regime-Aware Algorithm Engineering for Coverage Optimization#1077547
- Scout-Assisted Planning for Heterogeneous Robot Teams under Partially Known Environments#216867
- Data-Driven Case Study of gNB Placement Optimization in a Private Indoor 5G Testbed#821543
Record · ID 1070084
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive