Target tracking on triangulation graphs

We investigate a variation of the art gallery problem in which a team of mobile guards tries to track an unpredictable intruder in a simply-connected polygonal environment. The guards are confined to move along the diagonals of a polygon, and are deployed according to the strategy proposed in [1] that provides an upper bound of ⌊ n/4 ⌋ mobile guards to cover a simply-connected polygonal environment. We introduce the concept of critical regions to generate event-triggered strategies for the guards. Based on these strategies, we present sufficient conditions for ⌊ n/4 ⌋ guards to track an unpredictable mobile intruder forever.

[1]  Tamer Basar,et al.  Game-theoretic analysis of a visibility based pursuit-evasion game in the presence of obstacles , 2009, 2009 American Control Conference.

[2]  Héctor H. González-Baños,et al.  Motion strategies for maintaining visibility of a moving target , 1997, Proceedings of International Conference on Robotics and Automation.

[3]  Héctor H. González-Baños,et al.  A reactive motion planner to maintain visibility of unpredictable targets , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[4]  Tamer Basar,et al.  Numerical approximation for a visibility based pursuit-evasion game , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Sourabh Bhattacharya,et al.  Multi-agent Visibility-Based Target Tracking Game , 2014, DARS.

[6]  Alejandro Sarmiento,et al.  Surveillance Strategies for a Pursuer with Finite Sensor Range , 2007, Int. J. Robotics Res..

[7]  Sourabh Bhattacharya,et al.  Visibility based multi-agent surveillance strategies in decentralized network , 2015, Defense + Security Symposium.

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

[9]  Sourabh Bhattacharya,et al.  On the Existence of Nash Equilibrium for a Two-player Pursuit - Evasion Game with Visibility Constraints , 2008, Int. J. Robotics Res..

[10]  Joseph O'Rourke,et al.  Galleries need fewer mobile guards: A variation on Chvátal's theorem , 1983 .

[11]  Lynne E. Parker,et al.  Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets , 2002, Auton. Robots.

[12]  Gaurav S. Sukhatme,et al.  Tracking Targets Using Multiple Robots: The Effect of Environment Occlusion , 2002, Auton. Robots.

[13]  Sourabh Bhattacharya,et al.  A cell decomposition approach to visibility-based pursuit evasion among obstacles , 2011, Int. J. Robotics Res..

[14]  Sourabh Bhattacharya,et al.  Motion Strategies for Surveillance , 2007, Robotics: Science and Systems.

[15]  Sourabh Bhattacharya,et al.  Approximation Schemes for Two-Player Pursuit Evasion Games with Visibility Constraints , 2008, Robotics: Science and Systems.

[16]  Michael Kaufmann,et al.  On the Rectilinear Art Gallery Problem - Algorithmic Aspects , 1990, WG.