arXiv (All)
open access
Pairwise Approximation Can Select the Wrong Multi-Robot Plan
Multi-robot coordination methods often score a joint plan from singleton and pairwise terms, leaving out the terms that involve three or more robots. We measure the plan-selection regret of two pairwise approximations to delivered coverage using frozen multi-robot trajectories. For each four-robot p
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
- Decentralized Multi-Robot Exploration with Probabilistic Peer Intent and Multi-hop Plan Propagation#1037409
- Motion planning in high dimensional spaces hybridizing RRT and HAR via position-direction decoupling#1122808
- Sampling-based Certified Planning with Graphs of Convex Sets#798399
- Sampling-based Certified Planning with Graphs of Convex Sets#796986
- Kino-PAX$^+$: Near-Optimal Massively Parallel Kinodynamic Sampling-based Motion Planner#987581
Record · ID 1078000
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