arXiv (All)
open access
The Cost of Executability: Temporal Margins for Continuous-Time Multi-Agent Path Finding under Closed-Loop Control
Multi-agent path finding (MAPF) solvers are evaluated on the schedules they produce, not on how well those schedules can be executed. Specifically, continuous-time optimal solvers can achieve even lower cost than their discrete counterparts by scheduling agents with near-zero temporal/spatial separa
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
- Improving the performance of prioritized planning in multi-agent path finding#269372
- Simultaneous Computation with Multiple Prioritizations in Multi-Agent Motion Planning#798577
- Simultaneous Computation with Multiple Prioritizations in Multi-Agent Motion Planning#797164
- Bioinspired Spatio-Temporal Cooperative Path Planning for Heterogeneous UAVs Driven by Bi-Level Games: An SSA-MPC Fusion Approach.#143449
- Parameterized Complexity of Temporal Connected Components#1217328
Record · ID 1355053
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