Metraipolis › archive › dc_0dd01cdbe18a
Connectivity Preservation and Graph Stretching in Range-Only Swarm Dispersion — arXiv:2609.28190
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.28190
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T08:57:21.105Z
- SHA-256 of the archived text
674290887a8dfb1a0751caa095445b3fbbed5de7bb64610176bb5591a8b40a14- Stable URL of this page
https://metraipolis.com/documento/dc_0dd01cdbe18a
How to cite
Connectivity Preservation and Graph Stretching in Range-Only Swarm Dispersion — arXiv:2609.28190 — arXiv (en), https://arxiv.org/abs/2609.28190 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0dd01cdbe18a (Metraipolis archive dc_0dd01cdbe18a, sha256 674290887a8dfb1a0751caa095445b3fbbed5de7bb64610176bb5591a8b40a14)
BibTeX
@misc{dc0dd01cdbe18a,
title = {Connectivity Preservation and Graph Stretching in Range-Only Swarm Dispersion — arXiv:2609.28190},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.28190},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0dd01cdbe18a; sha256 674290887a8dfb1a0751caa095445b3fbbed5de7bb64610176bb5591a8b40a14},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28190. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study connectivity-preserving finite-jump dispersion of anonymous, identical, and oblivious agents under an idealized range-only sensing model. Each agent measures only the distances to its visible neighbors, without bearings, identifiers, communication, memory, or a shared coordinate system. We derive the largest isotropic displacement certifiable as safe from these measurements alone. The resulting rule requires only the distance to the farthest visible neighbor: each agent selects a random direction and moves by half of its remaining visibility margin. The rule preserves every existing visibility edge under synchronous finite motion and therefore preserves connectivity. For two agents, we prove positive conditional drift in squared distance, almost-sure convergence to the visibility boundary, and finite expected time to reach any fixed neighborhood of that boundary. A one-million-run Monte Carlo experiment agrees with the exact first-round moments and estimates approximately 9.5 rounds to reach distance 0.97V from coincident initial positions; an independent Bellman-equation computation gives the same estimate. For general swarms, 1,000 runs across five initial-topology classes reproduce the deterministic safety guarantee at implementation level and reveal a consistent topology-dependent ordering of attainable diameter under the tested protocol. These results provide a theoretical foundation for connectivity-preserving multi-robot dispersion under minimal sensing, while isolating the guarantees achievable from anonymous range measurements alone. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-24 in cs.MA). Categorie arXiv: Multiagent Systems (cs.MA). Pagina del lavoro: https://arxiv.org/abs/2609.28190 — 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-08T08:03:18.934Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).