Metraipolis › archive › dc_ed0ca03b9616

Decentralized Multi-Robot Exploration with Probabilistic Peer Intent and Multi-hop Plan Propagation — arXiv:2609.22726

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.22726
License (as archived)
CC0-1.0
Archived
2026-10-09T22:23:35.278Z
SHA-256 of the archived text
b449428138e6f26a8ae0fa5aa78f8a2236c6a0dcbd50c107db01c29619a61e71
Stable URL of this page
https://metraipolis.com/documento/dc_ed0ca03b9616

How to cite

Decentralized Multi-Robot Exploration with Probabilistic Peer Intent and Multi-hop Plan Propagation — arXiv:2609.22726 — arXiv (en), https://arxiv.org/abs/2609.22726 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ed0ca03b9616 (Metraipolis archive dc_ed0ca03b9616, sha256 b449428138e6f26a8ae0fa5aa78f8a2236c6a0dcbd50c107db01c29619a61e71)
BibTeX
@misc{dced0ca03b9616,
  title = {Decentralized Multi-Robot Exploration with Probabilistic Peer Intent and Multi-hop Plan Propagation — arXiv:2609.22726},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.22726},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ed0ca03b9616; sha256 b449428138e6f26a8ae0fa5aa78f8a2236c6a0dcbd50c107db01c29619a61e71},
  year = {2026}
}

Archived text

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

Efficient coordination under limited communication remains a key challenge in decentralized multi-robot exploration. While centralized approaches benefit from global information sharing, they are often impractical in large-scale or communication-constrained environments. Existing Monte Carlo Tree Search (MCTS)-based approaches, such as Decentralized Monte Carlo Exploration (DMCE), enable decentralized planning by taking peer intent into account. This peer intent is obtained by communicating sequences of planned waypoints with robots within direct communication range. In this work, we extend this idea by introducing Probabilistic Peer Intent (PPI), which converts peer trajectories into a continuous spatial representation of predicted intent and incorporates it into local MCTS action evaluation. We additionally study the effects of sharing peer intent beyond direct communication range by propagating plans over multiple hops. Experiments across multiple simulated environments and team sizes show that PPI and Multi-hop propagation can each improve decentralized exploration, with their relative benefits depending on environment structure and team size. We also demonstrate the real-world deployment of our method on three robots operating in different environment types.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-22 in cs.RO).
Categorie arXiv: Robotics (cs.RO) ; Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2609.22726 — 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-09T21:59:59.464Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).