TWGS:A Tree Decomposition Based Indoor Pursuit-Evasion Game For Robotic Networks

Abstract In this paper, we deal with the problem of pursuing a mobile target by multiple robots in indoor environments embedded with robotic networks. The target is vigilant and its speed can be arbitrarily fast while the speeds of pursuers are limited. Our object in this paper is to design effective pursuit strategies for the robots to track and finally capture the target. By using concepts of tree decomposition from graph theory, we establish an upper bound of the pursuer number that can guarantee successful capture of the mobile target. We then propose a pursuit algorithm, namely, tree-width based graph searching (TWGS), based on the theoretical analysis. Furthermore, we demonstrate the performance of the algorithm for two indoor environments by numerical simulations, which show that TWGS is efficient and the pursuer number given by the theoretical analysis is rather tight.

[1]  Dimitrios M. Thilikos,et al.  An annotated bibliography on guaranteed graph searching , 2008, Theor. Comput. Sci..

[2]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[3]  Geoffrey A. Hollinger,et al.  A graph search algorithm for indoor pursuit/evasion , 2009, Math. Comput. Model..

[4]  Abbas Mehrabian.  Lower Bounds for the Cop Number when the Robber is Fast , 2011, Comb. Probab. Comput..

[5]  Linyuan Lu,et al.  On Meyniel's conjecture of the cop number , 2012, J. Graph Theory.

[6]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..

[7]  Peter Frankl,et al.  Cops and robbers in graphs with large girth and Cayley graphs , 1987, Discret. Appl. Math..

[8]  Xinping Guan,et al.  A novel pursuit strategy for fast evader in indoor pursuit-evasion games , 2012, Proceedings of the 10th World Congress on Intelligent Control and Automation.

[9]  S. Shankar Sastry,et al.  Tracking and Coordination of Multiple Agents Using Sensor Networks: System Design, Algorithms and Experiments , 2007, Proceedings of the IEEE.

[10]  B. Alspach.  SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY , 2006 .

[11]  E. Chiniforooshan.  A better bound for the cop number of general graphs , 2008 .

[12]  Martin Aigner,et al.  A game of cops and robbers , 1984, Discret. Appl. Math..

[13]  Gaurav S. Sukhatme,et al.  Scalable and practical pursuit-evasion with networked robots , 2009, Intell. Serv. Robotics.

[14]  Nicolas Nisse,et al.  Pursuing a fast robber on a graph , 2010, Theor. Comput. Sci..

[15]  Alan M. Frieze,et al.  Variations on cops and robbers , 2010, J. Graph Theory.

[16]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..