arXiv (All)
open access
FPTAS for Polygonal Multi-Robot Motion Planning
We study multi-robot motion planning in a polygonal environment with polygonal robots. The setting of the problem consists of a polygonal domain $\mathcal{W}$ with $n$ vertices and $k$ robots $R_1,\dots,R_k$ translating in $\mathcal{W}$ each of which is represented by a polygon of constant complexit
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
- WRAP: Fixtureless Wrench-aware Multi-Robot Assembly Planning#1077336
- DiffuSearch: How Hybrid Trajectory Planning Benefits from Aligned Objectives in Diffusion and Action Space#822642
- Hybrid Artificial Potential Fields and Spatio-Temporal Transformers for Real-Time AUV Path Planning#615118
- Hybrid Artificial Potential Fields and Spatio-Temporal Transformers for Real-Time AUV Path Planning#614151
- FDSPC: Fast and Direct Smooth Path Planning via Continuous Curvature Integration#1201831
Record · ID 1355174
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