A Mixed Integer Linear Programming approach to pursuit evasion problems with optional connectivity constraints

In this paper, we address the multi pursuer version of the pursuit evasion problem in polygonal environments. By discretizing the problem, and applying a Mixed Integer Linear Programming (MILP) framework, we are able to address problems requiring so-called recontamination and also impose additional constraints, such as connectivity between the pursuers. The proposed MILP formulation is less conservative than solutions based on graph discretizations of the environment, but still somewhat more conservative than the original underlying problem. It is well known that MILPs, as well as multi pursuer pursuit evasion problems, are NP-hard. Therefore we apply an iterative Receding Horizon Control (RHC) scheme where a number of smaller MILPs are solved over shorter planning horizons. The proposed approach is implemented in Matlab/Cplex and illustrated by a number of solved examples.

[1]  Giora Slutzki,et al.  Clearing a Polygon with Two 1-Searchers , 2009, Int. J. Comput. Geom. Appl..

[2]  Sebastian Thrun,et al.  Visibility-based Pursuit-evasion with Limited Field of View , 2004, Int. J. Robotics Res..

[3]  Steven M. LaValle,et al.  Tracking hidden agents through shadow information spaces , 2008, 2008 IEEE International Conference on Robotics and Automation.

[4]  David A. Anisi,et al.  Cooperative Minimum Time Surveillance With Multiple Ground Vehicles , 2010, IEEE Transactions on Automatic Control.

[5]  Stefano Carpin,et al.  The GRAPH-CLEAR problem: definition, theoretical properties and its connections to multirobot aided surveillance , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

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

[8]  Geoffrey A. Hollinger,et al.  Improving the Efficiency of Clearing with Multi-agent Teams , 2010, Int. J. Robotics Res..

[9]  Steven M. LaValle,et al.  Visibility-based Pursuit—Evasion with Bounded Speed , 2008, Int. J. Robotics Res..

[10]  Karl Henrik Johansson,et al.  Communication-aware trajectory tracking , 2008, 2008 IEEE International Conference on Robotics and Automation.

[11]  Max Donath,et al.  American Control Conference , 1993 .

[12]  Gregory S. Chirikjian,et al.  Algorithmic Foundation of Robotics VIII, Selected Contributions of the Eight International Workshop on the Algorithmic Foundations of Robotics, WAFR 2008, Guanajuato, Mexico, December 7-9, 2008 , 2009, WAFR.

[13]  B. Moor,et al.  Mixed integer programming for multi-vehicle path planning , 2001, 2001 European Control Conference (ECC).

[14]  Jonathan P. How,et al.  Receding horizon control of autonomous aerial vehicles , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[15]  Petter Ögren,et al.  An iterative Mixed Integer Linear Programming Approach to pursuit evasion problems in polygonal environments , 2010, 2010 IEEE International Conference on Robotics and Automation.

[16]  Geoffrey A. Hollinger,et al.  Efficient, guaranteed search with multi-agent teams , 2009, Robotics: Science and Systems.

[17]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[18]  Steven M. LaValle,et al.  Visibility-based pursuit-evasion: the case of curved environments , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[19]  Sampath Kannan,et al.  Randomized Pursuit-Evasion in a , 2005 .

[20]  Sampath Kannan,et al.  Randomized pursuit-evasion in a polygonal environment , 2005, IEEE Transactions on Robotics.

[21]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

[22]  J. Sack,et al.  Handbook of computational geometry , 2000 .