How many landmark colors are needed to avoid confusion in a polygon?

Suppose that two members of a finite point guard set S within a polygon P must be given different colors if their visible regions overlap, and that every point in P is visible from some point in S. The chromatic art gallery problem, introduced in [7], asks for the minimum number of colors required to color any guard set (not necessarily a minimal guard set) of P. We study two related problems. First, given a polygon P and a guard set S of P, can the members of S be efficiently and optimally colored so that no two members of S that have overlapping visibility regions have the same color? Second, given a polygon P and a set of candidate guard locations N, is it possible to efficiently and optimally choose the guard set S ⊆ N that requires the minimum number of colors? We provide an algorithm that solves the first question in polynomial time, and demonstrate the NP-hardness of the second question. Both questions are motivated by common robot tasks such as mapping and surveillance.

[1]  Sebastian Thrun,et al.  Simultaneous localization and mapping with unknown data association using FastSLAM , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[2]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[3]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[4]  Andrea Garulli,et al.  A Set Theoretic Approach to Dynamic Robot Localization and Mapping , 2004, Auton. Robots.

[5]  Stephan Eidenbenz,et al.  Inapproximability Results for Guarding Polygons and Terrains , 2001, Algorithmica.

[6]  Bernadette Dorizzi,et al.  Color-Based Iris Verification , 2007, ICB.

[7]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[8]  A. Nuchter,et al.  6D SLAM with approximate data association , 2005, ICAR '05. Proceedings., 12th International Conference on Advanced Robotics, 2005..

[9]  Subir Kumar Ghosh.  On Recognizing and Characterizing Visibility Graphs of Simple Polygons , 1988, SWAT.

[10]  Steven M. LaValle,et al.  A chromatic art gallery problem , 2010 .

[11]  Joseph Culberson,et al.  Covering Polygons Is Hard (Preliminary Abstract) , 1988, FOCS 1988.

[12]  S. Shankar Sastry,et al.  Algebraic approach to recovering topological information in distributed camera networks , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[13]  Peter Stone,et al.  Negative information and line observations for Monte Carlo localization , 2008, 2008 IEEE International Conference on Robotics and Automation.

[14]  Ingemar J. Cox,et al.  Modeling a Dynamic Environment Using a Bayesian Multiple Hypothesis Approach , 1994, Artif. Intell..

[15]  Wolfram Burgard,et al.  Towards Lazy Data Association in SLAM , 2003, ISRR.

[16]  Anna Lubiw,et al.  Decomposing polygonal regions into convex quadrilaterals , 1985, SCG '85.

[17]  Jason M. O'Kane,et al.  On the Value of Ignorance: Balancing Tracking and Privacy Using a Two-Bit Sensor , 2008, WAFR.

[18]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[19]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[20]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[21]  B. Joe,et al.  Corrections to Lee's visibility polygon algorithm , 1987, BIT.

[22]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[23]  Steven M. LaValle,et al.  I-Bug: An intensity-based bug algorithm , 2009, 2009 IEEE International Conference on Robotics and Automation.