Multi-agent deployment for visibility coverage in polygonal environments with holes

DOI10.1002/rnc.1700zbMath1244.68077arXiv1008.4990OpenAlexW2963574499MaRDI QIDQ2904000

K. Obermeyer, Anurag Ganguli, Bullo, Francesco

Publication date: 4 August 2012

Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.4990

zbMATH Keywords

multi-agent systemvisibilityswarmcoveragesensor networkdeploymentline of sightrobotic network

Mathematics Subject Classification ID

Distributed algorithms (68W15) Agent technology and artificial intelligence (68T42)

Related Items (2)

Cooperative control of autonomous systems ⋮ Guarding a Polygon Without Losing Touch

Cites Work

• Unnamed Item
• Guarding galleries and terrains
• A short proof of Chvatal's Watchman Theorem
• An efficient algorithm for guard placement in polygons with holes
• A combinatorial theorem in plane geometry
• Computational complexity of art gallery problems
• Distributed Task Assignment for Mobile Agents
• Inapproximability results for guarding polygons and terrains

This page was built for publication: Multi-agent deployment for visibility coverage in polygonal environments with holes