Metraipolis › archive › dc_c0caabdc7ff4

Adaptive Coverage Algorithms for Mobile Ad Hoc Networks in Dynamic Worlds — arXiv:2610.41936

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41936
License (as archived)
CC0-1.0
Archived
2026-11-03T07:39:22.291Z
SHA-256 of the archived text
d620893b07e60fcb3aebccaf070d9e28ef3e6bb38f4aa4781a8036768e664f23
Stable URL of this page
https://metraipolis.com/documento/dc_c0caabdc7ff4

How to cite

Adaptive Coverage Algorithms for Mobile Ad Hoc Networks in Dynamic Worlds — arXiv:2610.41936 — arXiv (en), https://arxiv.org/abs/2610.41936 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c0caabdc7ff4 (Metraipolis archive dc_c0caabdc7ff4, sha256 d620893b07e60fcb3aebccaf070d9e28ef3e6bb38f4aa4781a8036768e664f23)
BibTeX
@misc{dcc0caabdc7ff4,
  title = {Adaptive Coverage Algorithms for Mobile Ad Hoc Networks in Dynamic Worlds — arXiv:2610.41936},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41936},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c0caabdc7ff4; sha256 d620893b07e60fcb3aebccaf070d9e28ef3e6bb38f4aa4781a8036768e664f23},
  year = {2026}
}

Archived text

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

This paper extends an existing framework for the coordination of mobile agents in unknown worlds, by considering the possibility of dynamic instability. In the original problem, known as the Partially Observable Cooperative Guard Art Gallery Problem (POCGAGP) ( arXiv:2512.09495 ), the multi-agent system must establish a communication network which completely covers an initially unknown constrained space. However, the POCGAGP fails to account for the unpredictability often seen in real-world deployment. To address this, the dynamic case (DPOCGAGP) introduces two settings which can influence the mobile network during deployment: Agent Loss and World Change, which represent dynamic changes to the world. Within this study, we present advancements to two state-of-the-art algorithms, the Centralized Agent-Directed Exploration for Network Coverage (CADENCE), and its decentralized analogue, DADENCE, to provide solutions in these cases. We then compare their performance against another state-of-the-art benchmark algorithm, and show that the adapted algorithms outperform across our benchmark test set, which comprises over 4500 test cases of varied size and structure.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno).
Categorie arXiv: Robotics (cs.RO) ; Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2610.41936 — 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-03T07:39:22.219Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).