arXiv (OAI Expanded)
open access
Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-offs
We study unlabeled MRMP for unit-disk robots in a polygonal environment. Although the problem is hard in general, polynomial-time solutions exist under appropriate separation assumptions on start and target positions. Banyassady et al.(SoCG'22) guarantee feasibility in simple polygons under start--s
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
- Density-Driven Area Coverage for Nonholonomic Multi-Robot Systems with Safety Guarantee#1037351
- PccDiffuser: Multi-solution Motion Planning for Continuum Robots#996570
- Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning#149228
- Robust Variable-Horizon MPC for Landing a Multirotor UAV on a Moving Platform#1128839
- Coordinated Motion Planning for Multi-Arm Systems via Iterative LQ Games#781023
Record · ID 1109025
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