Problem
Research questions and friction points this paper is trying to address.
Mobile Ad-Hoc Networks
Partially Observable Environments
Cooperative Guard Art Gallery Problem
Coverage
Connected Visibility Graph
On the Control of Mobile Ad-Hoc Agent Deployments in Partially Observed Space
🤖 AI Summary
研究在部分可观测空间中，通过CADENCE算法控制移动临时网络的部署问题，使用最少的代理实现全覆盖并保持连通。
📝 Abstract
We study the online deployment of mobile ad hoc networks in unknown orthogonal environments, formalized as the Partially Observable Cooperative Guard Art Gallery Problem. We give a full proof that CADENCE algorithms achieve full coverage while maintaining a connected visibility graph using at most $n/2 + h - 2$ agents in orthogonal worlds with $n$ corners and $h$ holes. We further evaluate deployment-order heuristics that reduce agent count and deployment time in practice.
Innovation
Methods, ideas, or system contributions that make the work stand out.
CADENCE algorithms
Partially Observable Cooperative Guard Art Gallery Problem
orthogonal environments
deployment-order heuristics
🔎 Similar Papers
No similar papers found.
