Metraipolis › archive › dc_957efdf45ebb
The Cost of Executability: Temporal Margins for Continuous-Time Multi-Agent Path Finding under Closed-Loop Control — arXiv:2610.20118
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.20118
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T15:03:02.501Z
- SHA-256 of the archived text
af3bd1d3e7ba14302958978eb8a654579796ccee10c56740cf3665e2df17c5a7- Stable URL of this page
https://metraipolis.com/documento/dc_957efdf45ebb
How to cite
The Cost of Executability: Temporal Margins for Continuous-Time Multi-Agent Path Finding under Closed-Loop Control — arXiv:2610.20118 — arXiv (en), https://arxiv.org/abs/2610.20118 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_957efdf45ebb (Metraipolis archive dc_957efdf45ebb, sha256 af3bd1d3e7ba14302958978eb8a654579796ccee10c56740cf3665e2df17c5a7)
BibTeX
@misc{dc957efdf45ebb,
title = {The Cost of Executability: Temporal Margins for Continuous-Time Multi-Agent Path Finding under Closed-Loop Control — arXiv:2610.20118},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.20118},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_957efdf45ebb; sha256 af3bd1d3e7ba14302958978eb8a654579796ccee10c56740cf3665e2df17c5a7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20118. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 separation, and by exploiting graphs with higher connectedness; however, such schedules may prove hard to execute under a realistic controller. We integrate AOC-CBS, an anytime-optimal continuous-time MAPF solver, into a fleet coordination framework in which each agent tracks its timed path using model predictive control, and we evaluate the resulting system on congested MovingAI benchmark instances with 21 to 40 agents. Without intervention, only a fraction of the instances complete execution. We then apply T-robustness by adding a time-margin, i.e., a minimum temporal gap between agents at shared locations, as well as spatial inflation of the agent footprint. Increasing either margin raises execution success, for a relatively small increase in the schedule's sum-of-costs; it also improves how closely agents adhere to the schedule: when tracking each agent's position throughout execution and comparing it against the position it should occupy according to the schedule, the mean discrepancy falls significantly as the margin increases. In general, the two margins have different effects; temporal margin decreases deviation, giving the controller room to stay on schedule. Spatial margin affects deviation less and instead increases the clearance between agents, so that the same deviation no longer leads to a blocking stall. They are nonetheless substitutes rather than complements: spatial inflation is almost free in schedule cost, but its effect on execution success is small and does not compound with a temporal margin already in place. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv eess.SY, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2610.20118 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T14:07:08.596Z dalla pagina https://arxiv.org/list/eess.SY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).