arXiv (All)
open access
PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds
Autonomous robot navigation requires rapid construction of obstacle-points-separated convex regions for trajectory planning. When obstacles are represented as point clouds from LiDAR or depth cameras, these regions must be constructed directly from finite obstacle samples while providing suitable co
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
- Learning Traversability for Long Horizon Off-Road Navigation#999832
- Covering large-dimensional Euclidean spaces by random translates of a given convex body#617880
- Covering large-dimensional Euclidean spaces by random translates of a given convex body#617380
- PROBE-X: Learning-Free Cross-FOV Place Recognition#1048733
- Random Width and Brightness: Polyhedral Density Theory, Reconstruction, and Gaussian Identifiability#1062102
Record · ID 1048764
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