Metraipolis › archive › dc_2102a4a2ff48

Local Visibility Roadmaps in Continous Multi-agent Path Finding — arXiv:2611.04944

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04944
License (as archived)
CC0-1.0
Archived
2026-11-04T21:35:34.524Z
SHA-256 of the archived text
3e8f61a985438c1929d9d056b6ebb21b56ef6cb499ae591f307a321c557a4371
Stable URL of this page
https://metraipolis.com/documento/dc_2102a4a2ff48

How to cite

Local Visibility Roadmaps in Continous Multi-agent Path Finding — arXiv:2611.04944 — arXiv (en), https://arxiv.org/abs/2611.04944 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2102a4a2ff48 (Metraipolis archive dc_2102a4a2ff48, sha256 3e8f61a985438c1929d9d056b6ebb21b56ef6cb499ae591f307a321c557a4371)
BibTeX
@misc{dc2102a4a2ff48,
  title = {Local Visibility Roadmaps in Continous Multi-agent Path Finding — arXiv:2611.04944},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04944},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2102a4a2ff48; sha256 3e8f61a985438c1929d9d056b6ebb21b56ef6cb499ae591f307a321c557a4371},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04944. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We address the problem of smooth continuous multi-agent path finding (SC-MAPF), where agents move in a continuous environment along smooth curves in continuous time. The paths for individual agents are searched in local visibility roadmaps that consider obstacles and other agents. A new algorithm is proposed in this work, which combines the previous algorithm CE-CBS for high-level search with any-angle path finding for local single-agent planning, where agents are to avoid obstacles, both static and other agents. The new algorithm is tested and compared to CE-CBS, the algorithm building individual paths using RRT$^*$, and SMT-CCBS algorithm, an algorithm for MAPF$_R$. Experimental results show various advantages of the new algorithm over CE-CBS and SMT-CCBS in comparable settings.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno).
Categorie arXiv: Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2611.04944 — 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-11-04T21:35:34.322Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).