On Mobile Ad Hoc Networks for Coverage of Partially Observable Worlds
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917136648110080 |
|---|---|
| author | Meriaux, Edwin Wen, Shuo Langevin, Louis-Roy Precup, Doina Loría, Antonio Dudek, Gregory |
| author_facet | Meriaux, Edwin Wen, Shuo Langevin, Louis-Roy Precup, Doina Loría, Antonio Dudek, Gregory |
| contents | This paper addresses the movement and placement of mobile agents to establish a communication network in initially unknown environments. We cast the problem in a computational-geometric framework by relating the coverage problem and line-of-sight constraints to the Cooperative Guard Art Gallery Problem, and introduce its partially observable variant, the Partially Observable Cooperative Guard Art Gallery Problem (POCGAGP). We then present two algorithms that solve POCGAGP: CADENCE, a centralized planner that incrementally selects 270 degree corners at which to deploy agents, and DADENCE, a decentralized scheme that coordinates agents using local information and lightweight messaging. Both approaches operate under partial observability and target simultaneous coverage and connectivity. We evaluate the methods in simulation across 1,500 test cases of varied size and structure, demonstrating consistent success in forming connected networks while covering and exploring unknown space. These results highlight the value of geometric abstractions for communication-driven exploration and show that decentralized policies are competitive with centralized performance while retaining scalability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_09495 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Mobile Ad Hoc Networks for Coverage of Partially Observable Worlds Meriaux, Edwin Wen, Shuo Langevin, Louis-Roy Precup, Doina Loría, Antonio Dudek, Gregory Robotics Computational Geometry Multiagent Systems This paper addresses the movement and placement of mobile agents to establish a communication network in initially unknown environments. We cast the problem in a computational-geometric framework by relating the coverage problem and line-of-sight constraints to the Cooperative Guard Art Gallery Problem, and introduce its partially observable variant, the Partially Observable Cooperative Guard Art Gallery Problem (POCGAGP). We then present two algorithms that solve POCGAGP: CADENCE, a centralized planner that incrementally selects 270 degree corners at which to deploy agents, and DADENCE, a decentralized scheme that coordinates agents using local information and lightweight messaging. Both approaches operate under partial observability and target simultaneous coverage and connectivity. We evaluate the methods in simulation across 1,500 test cases of varied size and structure, demonstrating consistent success in forming connected networks while covering and exploring unknown space. These results highlight the value of geometric abstractions for communication-driven exploration and show that decentralized policies are competitive with centralized performance while retaining scalability. |
| title | On Mobile Ad Hoc Networks for Coverage of Partially Observable Worlds |
| topic | Robotics Computational Geometry Multiagent Systems |
| url | https://arxiv.org/abs/2512.09495 |