Metraipolis › archive › dc_2bc335c3de07
Dynamic, Decentralized Spatial Code Reuse for OCDMA LiDAR in Robot Swarms — arXiv:2609.28172
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.28172
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:53:47.403Z
- SHA-256 of the archived text
fd4608de5f15061b5b404b9ae97e5cfbf8cd4968058ac0c65b46a85981090f88- Stable URL of this page
https://metraipolis.com/documento/dc_2bc335c3de07
How to cite
Dynamic, Decentralized Spatial Code Reuse for OCDMA LiDAR in Robot Swarms — arXiv:2609.28172 — arXiv (en), https://arxiv.org/abs/2609.28172 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2bc335c3de07 (Metraipolis archive dc_2bc335c3de07, sha256 fd4608de5f15061b5b404b9ae97e5cfbf8cd4968058ac0c65b46a85981090f88)
BibTeX
@misc{dc2bc335c3de07,
title = {Dynamic, Decentralized Spatial Code Reuse for OCDMA LiDAR in Robot Swarms — arXiv:2609.28172},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.28172},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2bc335c3de07; sha256 fd4608de5f15061b5b404b9ae97e5cfbf8cd4968058ac0c65b46a85981090f88},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28172. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Robots in a LiDAR-equipped swarm mutually interfere when their optical ranging codes collide. Existing mitigations either assign codes statically -- requiring $L=N$ distinguishable codes for $N$ robots -- or react to detected interference without a scalable, coordinated assignment rule beneath them; prior work explicitly identifies the code-assignment scaling problem as unsolved. We propose a decentralized protocol in which robots dynamically reassign spatial reuse codes based on a live, beacon-maintained interference-neighborhood graph, and prove that the number of codes required grows as $O(\log N/\log\log N)$ under constant robot density -- an unbounded improvement over the $\Theta(N)$ growth of static assignment. We validate this result under conditions substantially beyond the idealized proof -- robot mobility, imperfect beacon-based detection, and reactive reassignment -- via Monte Carlo simulation (30 seeds per condition, 95% confidence intervals): the advantage over static assignment widens from roughly $2\times$ at 15 robots to $12\times$ at 120. Against a structurally faithful, fairly constructed model of an existing coordination-free approach, our protocol achieves both substantially greater code-reuse efficiency and 30--40% lower collision risk under an identical, constrained code budget, demonstrating that coordination -- not merely reactivity -- is what closes the scaling gap. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-24 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.28172 — 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-08T12:21:19.501Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).