Path planning with Incremental Roadmap Update for Visibility-based Target Tracking

In this paper, we address the visibility-based target tracking problem in which a mobile observer moving along a p-route, which we define as a fixed path for target tracking, tries to keep a mobile target in its field-of-view. By drawing a connection to the watchman’s route problem, we find a set of conditions that must be satisfied by the p-route. Then we propose a metric for tracking to estimate a sufficient speed for the observer given the geometry of the environment. We show that the problem of finding the p-route on which the observer requires minimum speed is computationally intractable. We present a technique to find a p-route on which the observer needs at most twice the minimum speed to track the intruder and a reactive motion strategy for the observer.

[1]  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.

[2]  Rui Zou,et al.  Target tracking on triangulation graphs , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[3]  Lynne E. Parker,et al.  Cooperative multi-robot observation of multiple moving targets , 1997, Proceedings of International Conference on Robotics and Automation.

[4]  Gaurav S. Sukhatme,et al.  Observability in topology-constrained multi-robot target tracking , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[5]  Simeon C. Ntafos,et al.  Optimum watchman routes , 1986, SCG '86.

[6]  Jin Young Choi,et al.  Intelligent visual surveillance — A survey , 2010 .

[7]  Wei-Pand Chin,et al.  Shortest watchman routes in simple polygons , 1990, Discret. Comput. Geom..

[8]  Sourabh Bhattacharya,et al.  On Optimal Pursuit Trajectories for Visibility-Based Target-Tracking Game , 2019, IEEE Transactions on Robotics.

[9]  Svante Carlsson,et al.  Finding the Shortest Watchman Route in a Simple Polygon , 1993, ISAAC.

[10]  Janusz Kacprzyk,et al.  Global path planning for a specialized autonomous robot for intrusion detection in wireless sensor networks (WSNs) using a new evolutionary algorithm , 2017, KKA.

[11]  Michael R. M. Jenkin,et al.  The paparazzi problem , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[12]  Rui Zou,et al.  Visibility-Based Finite-Horizon Target Tracking Game , 2016, IEEE Robotics and Automation Letters.

[13]  Pedro U. Lima,et al.  Autonomous Surveillance Robots: A Decision-Making Framework for Networked Muiltiagent Systems , 2017, IEEE Robotics & Automation Magazine.

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

[15]  Godfried T. Toussaint,et al.  Computational Geometric Problems in Pattern Recognition , 1982 .

[16]  Peter W. Shor,et al.  A New Proof of Cayley's Formula for Counting Labeled Trees , 1995, J. Comb. Theory, Ser. A.

[17]  Alejandro Sarmiento,et al.  Maintaining visibility of a moving holonomic target at a fixed distance with a non-holonomic robot , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.