Document Open Access Logo

Brief Announcement: Cooperative Guarding in Polygons with Holes

Authors John Augustine , Srikkanth Ramachandran



PDF
Thumbnail PDF

File

LIPIcs.SAND.2022.21.pdf
  • Filesize: 0.5 MB
  • 3 pages

Document Identifiers

Author Details

John Augustine
  • Department of Computer Science & Engineering, Indian Institute of Technology Madras, India
Srikkanth Ramachandran
  • Department of Computer Science & Engineering, Indian Institute of Technology Madras, India

Acknowledgements

We thank Barath Ashok and Suman Sourav for helpful discussions and the anonymous reviewers for their useful feedback.

Cite AsGet BibTex

John Augustine and Srikkanth Ramachandran. Brief Announcement: Cooperative Guarding in Polygons with Holes. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 221, pp. 21:1-21:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.SAND.2022.21

Abstract

We study the Cooperative Guarding problem for polygons with holes in a mobile multi-agents setting. Given a set of agents, initially deployed at a point in a polygon with n vertices and h holes, we require the agents to collaboratively explore and position themselves in such a way that every point in the polygon is visible to at least one agent and that the set of agents are visibly connected. We study the problem under two models of computation, one in which the agents can compute exact distances and angles between two points in its visibility, and one in which agents can only compare distances and angles. In the stronger model, we provide a deterministic O(n) round algorithm to compute such a cooperative guard set while not requiring more than (n + h)/2 agents and O(log n) bits of persistent memory per agent. In the weaker model, we provide an O(n⁴) round algorithm, that does not require more than (n+2h)/2 agents.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Self-organization
Keywords
  • Mobile Agents
  • Art Gallery Problem
  • Cooperative Guarding

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. B. Ashok, J. Augustine, A. Mehekare, S. Ragupathi, S. Ramachandran, and S. Sourav. Guarding a polygon without losing touch. In SIROCCO, pages 91-108, 2020. Google Scholar
  2. J. Augustine and S. Ramachandran. Cooperative guarding in polygons with holes. URL: http://arxiv.org/abs/2202.13719.
  3. I. Bjorling-Sachs and D. L. Souvaine. An efficient algorithm for guard placement in polygons with holes. Discrete & Computational Geometry, 13(1):77-109, January 1995. URL: https://doi.org/10.1007/bf02574029.
  4. V. Chvátal. A combinatorial theorem in plane geometry. Journal of Combinatorial Theory, Series B, 18(1):39-41, 1975. Google Scholar
  5. Steve Fisk. A short proof of chvátal’s watchman theorem. Journal of Combinatorial Theory, Series B, 24(3):374, 1978. Google Scholar
  6. B. Liaw, N. Huang, and Richard C. T. Lee. The minimum cooperative guards problem on k-spiral polygons. In CCCG, 1993. Google Scholar
  7. K. J. Obermeyer, A. Ganguli, and F. Bullo. Multi-agent deployment for visibility coverage in polygonal environments with holes. International Journal of Robust and Nonlinear Control, 21(12):1467-1492, 2011. Google Scholar
  8. P. Zylinski. Cooperative guards in art galleries with one hole. Balkan Journal of Geometry and Its Applications, 10(2):142, 2005. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail