Metraipolis › archive › dc_27b43595fccc

CONSORT: Uncertainty-Constrained Multi-Robot Planning for Cooperative Localization in GPS-Denied Environments — arXiv:2610.41235

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41235
License (as archived)
CC0-1.0
Archived
2026-11-02T08:03:48.139Z
SHA-256 of the archived text
09516647f55600de61f57c791acb03519e43dbf7b01c16b9f0516d3d031d4508
Stable URL of this page
https://metraipolis.com/documento/dc_27b43595fccc

How to cite

CONSORT: Uncertainty-Constrained Multi-Robot Planning for Cooperative Localization in GPS-Denied Environments — arXiv:2610.41235 — arXiv (en), https://arxiv.org/abs/2610.41235 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_27b43595fccc (Metraipolis archive dc_27b43595fccc, sha256 09516647f55600de61f57c791acb03519e43dbf7b01c16b9f0516d3d031d4508)
BibTeX
@misc{dc27b43595fccc,
  title = {CONSORT: Uncertainty-Constrained Multi-Robot Planning for Cooperative Localization in GPS-Denied Environments — arXiv:2610.41235},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41235},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_27b43595fccc; sha256 09516647f55600de61f57c791acb03519e43dbf7b01c16b9f0516d3d031d4508},
  year = {2026}
}

Archived text

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

Centralized multi-agent path planning with cooperative localization in GPS-denied environments is generally computationally intractable when formulated in full belief space due to tightly coupled uncertainty dynamics. Prior work typically approximates belief dynamics or restricts inter-agent coupling. This work examines a multi-agent planning problem in which a primary agent must reach a goal in minimum time subject to a chance-constrained collision-avoidance requirement and a terminal bound on localization uncertainty. We obtain a tractable surrogate of the underlying belief-space problem by optimizing over the mean-state trajectories of all agents and propagating covariance for terminal constraint evaluation only. We propose CONSORT (Cooperative Navigation with Support-Optimized Routing and Trajectories), a discrete-to-continuous pipeline combining hexagonal-grid joint search with spline-based trajectory refinement. Across 50 randomized scenarios, the planners separate as the terminal uncertainty bound tightens, with CONSORT solving 80% of scenarios where the strongest baseline solves 54%, at comparable path length. In marine simulations, with the plans executed under feedback control on an independently developed factor-graph estimate, the trajectories remain collision-free and their terminal uncertainty falls within 6% of the planner's prediction.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.RO, nuovi lavori del giorno).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2610.41235 — 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-02T07:44:15.696Z dalla pagina https://arxiv.org/list/cs.RO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).