Minimizing communication latency in multirobot situation-aware patrolling

We consider the problem of computing patrolling strategies under communication constraints for a team of autonomous robots employed in repeated surveillance missions on a set of predefined locations. We assume the presence of a communication infrastructure providing only some regions of the environment with a communication link to a mission control center (MCC). We define the problem of computing a joint patrolling strategy that minimizes communication latencies, defined as the delays between inspecting some locations and reporting the outcome to the MCC. We provide and experimentally evaluate a MILP formulation and a heuristic method.

[1]  Yann Chevaleyre,et al.  Theoretical analysis of the multi-agent patrolling problem , 2004, Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004)..

[2]  Aníbal Ollero,et al.  A decentralized algorithm for area surveillance missions using a team of aerial robots with different sensing capabilities , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[3]  Noa Agmon,et al.  Multi-robot area patrol under frequency constraints , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[4]  Stephen Cameron,et al.  Time Preference for Information in Multi-agent Exploration with Limited Communication , 2013, TAROS.

[5]  Stefano Carpin,et al.  Online patrolling using hierarchical spatial representations , 2012, 2012 IEEE International Conference on Robotics and Automation.

[6]  Sergio F. Ochoa,et al.  Human-centric wireless sensor networks to improve information availability during urban search and rescue activities , 2015, Inf. Fusion.

[7]  Péter Kovács,et al.  LEMON - an Open Source C++ Graph Template Library , 2011, WGT@ETAPS.

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

[9]  Michail G. Lagoudakis,et al.  Guaranteed-Performance Multi-robot Routing under Limited Communication Range , 2008, DARS.

[10]  W. Marsden I and J , 2012 .

[11]  Emilio Frazzoli,et al.  Persistent patrol with limited-range on-board sensors , 2010, 49th IEEE Conference on Decision and Control (CDC).

[12]  Andreas Birk,et al.  Multi-robot exploration under the constraints of wireless networking , 2007 .

[13]  Cesare Stefanelli,et al.  Multiple-UAV coordination and communications in tactical edge networks , 2012, IEEE Communications Magazine.

[14]  Satish Rao,et al.  The k-traveling repairman problem , 2003, SODA '03.

[15]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[16]  Nicola Basilico,et al.  Leader-follower strategies for robotic patrolling in environments with arbitrary topologies , 2009, AAMAS.

[17]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[18]  Nicos Christofides Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.