Mixed-Integer Linear Programming Models for Multi-Robot Non-Adversarial Search

In this letter, we consider the Multi-Robot Efficient Search Path Planning (MESPP) problem, where a team of robots is deployed in a graph-represented environment to capture a moving target within a given deadline. We prove this problem to be NP-hard, and present the first set of Mixed-Integer Linear Programming (MILP) models to tackle the MESPP problem. Our models are the first to encompass multiple searchers, arbitrary capture ranges, and false negatives simultaneously. While state-of-the-art algorithms for MESPP are based on simple path enumeration, the adoption of MILP as a planning paradigm allows to leverage the powerful techniques of modern solvers, yielding better computational performance and, as a consequence, longer planning horizons. The models are designed for computing optimal solutions offline, but can be easily adapted for a distributed online approach. Our simulations show that it is possible to achieve 98% decrease in computational time relative to the previous state-of-the-art. We also show that the distributed approach performs nearly as well as the centralized, within 6% in the settings studied in this letter, with the advantage of requiring significant less time – an important consideration in practical search missions.

[1]  Geoffrey A. Hollinger,et al.  Efficient Multi-robot Search for a Moving Target , 2009, Int. J. Robotics Res..

[2]  Nicola Basilico,et al.  Multirobot Reconnection on Graphs: Problem, Complexity, and Algorithms , 2018, IEEE Transactions on Robotics.

[3]  Geoffrey A. Hollinger,et al.  Search and pursuit-evasion in mobile robotics , 2011, Auton. Robots.

[4]  Geoffrey A. Hollinger,et al.  Multirobot Coordination With Periodic Connectivity: Theory and Experiments , 2012, IEEE Transactions on Robotics.

[5]  Robert Ghrist,et al.  Capture pursuit games on unbounded domains , 2009 .

[6]  Volkan Isler,et al.  Capturing an Evader in a Polygonal Environment with Obstacles , 2011, IJCAI.

[7]  Daniele Nardi,et al.  Multi-robot search for a moving target: Integrating world modeling, task assignment and context , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

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

[9]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[10]  Leonidas J. Guibas,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.

[11]  L. Stone Theory of Optimal Search , 1975 .

[12]  Micah Adler,et al.  Randomized Pursuit-Evasion in Graphs , 2002, Combinatorics, Probability and Computing.

[13]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[14]  Geoffrey A. Hollinger,et al.  Search in the Physical World , 2010 .

[15]  Luc Lamontagne,et al.  The optimal searcher path problem with a visibility criterion in discrete time and space , 2009, 2009 12th International Conference on Information Fusion.

[16]  Roberto Szechtman,et al.  Optimal discrete search with imperfect specificity , 2008, Math. Methods Oper. Res..

[17]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[18]  F. Glover IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .

[19]  Anne Condon,et al.  On the undecidability of probabilistic planning and related stochastic optimization problems , 2003, Artif. Intell..

[20]  J. Karl Hedrick,et al.  Autonomous UAV path planning and estimation , 2009, IEEE Robotics & Automation Magazine.

[21]  Katia P. Sycara,et al.  Computing and executing strategies for moving target search , 2011, 2011 IEEE International Conference on Robotics and Automation.

[22]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

[23]  Stefano Carpin,et al.  Optimal Redeployment of Multirobot Teams for Communication Maintenance , 2018, 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[24]  Stefano Carpin,et al.  Pursuit-Evasion on Trees by Robot Teams , 2010, IEEE Transactions on Robotics.

[25]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[26]  Andreas Krause,et al.  Efficient Planning of Informative Paths for Multiple Robots , 2006, IJCAI.

[27]  Volkan Isler,et al.  The role of information in the cop-robber game , 2008, Theor. Comput. Sci..

[28]  Geoffrey A. Hollinger,et al.  Distributed Data Fusion for Multirobot Search , 2015, IEEE Transactions on Robotics.