Competitive target search with multi-agent teams: symmetric and asymmetric communication constraints

We study a search game in which two multi-agent teams compete to find a stationary target at an unknown location. Each team plays a mixed strategy over the set of search sweep-patterns allowed from its respective random starting locations. Assuming that communication enables cooperation we find closed-form expressions for the probability of winning the game as a function of team sizes and the existence or absence of communication within each team. Assuming the target is distributed uniformly at random, an optimal mixed strategy equalizes the expected first-visit time to all points within the search space. The benefits of communication enabled cooperation increase with team size. Simulations and experiments agree well with analytical results.

[1]  Sebastian Thrun,et al.  Parallel Stochastic Hill- Climbing with Small Teams , 2005 .

[2]  Izhak Rubin,et al.  A framework and analysis for cooperative search using UAV swarms , 2004, SAC '04.

[3]  Agathoniki Trigoni,et al.  Supporting Search and Rescue Operations with UAVs , 2010, 2010 International Conference on Emerging Security Technologies.

[4]  Derek A. Paley,et al.  Physics-inspired motion planning for information-theoretic target detection using multiple aerial robots , 2017, Auton. Robots.

[5]  Thor I. Fossen,et al.  Optimal search mission with Unmanned Aerial Vehicles using Mixed Integer Linear Programming , 2013, 2013 International Conference on Unmanned Aircraft Systems (ICUAS).

[6]  Li-Wei Fong.  Distributed Data Fusion via Hybrid Approach , 2007, IECON 2007 - 33rd Annual Conference of the IEEE Industrial Electronics Society.

[7]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[8]  Debasish Ghose,et al.  Negotiation schemes for multi-agent cooperative search , 2009 .

[9]  Emilio Frazzoli,et al.  The Cow-Path Game: A competitive vehicle routing problem , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[10]  J.P. How,et al.  Robust UAV Search for Environments with Imprecise Probability Maps , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

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

[12]  Michael Otte,et al.  Competitive Two Team Target Search Game with Communication Symmetry and Asymmetry , 2016, WAFR.

[13]  K E Trummel,et al.  Technical Note - The Complexity of the Optimal Searcher Path Problem , 1986, Oper. Res..

[14]  Seokcheon Lee,et al.  Response Threshold Model Based UAV Search Planning and Task Allocation , 2014, J. Intell. Robotic Syst..

[15]  Anthony Stentz,et al.  Traderbots: a new paradigm for robust and efficient multirobot coordination in dynamic environments , 2004 .

[16]  Claire J. Tomlin,et al.  Automation-Assisted Capture-the-Flag: A Differential Game Approach , 2015, IEEE Transactions on Control Systems Technology.

[17]  H. Jin Kim,et al.  Policy Improvements for Probabilistic Pursuit-Evasion Game , 2014, J. Intell. Robotic Syst..

[18]  Volkan Isler,et al.  Lion and man with visibility in monotone polygons , 2014, Int. J. Robotics Res..

[19]  D. Ghose,et al.  Multiple agent search of an unknown environment using game theoretical models , 2004, Proceedings of the 2004 American Control Conference.

[20]  Hiroyuki Sato,et al.  Path optimization for the resource‐constrained searcher , 2010 .

[21]  Nidhi Kalra,et al.  Market-Based Multirobot Coordination: A Survey and Analysis , 2006, Proceedings of the IEEE.

[22]  Wright-Patterson Afb,et al.  Hierarchical Control for Autonomous Teams , 2001 .

[23]  Edwin Olson,et al.  LCM: Lightweight Communications and Marshalling , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[24]  S. Shankar Sastry,et al.  Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation , 2002, IEEE Trans. Robotics Autom..

[25]  Steven Y. Goldsmith,et al.  Exhaustive Geographic Search with Mobile Robots Along Space-Filling Curves , 1998, CRW.

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

[27]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[28]  Roland Siegwart,et al.  A robust and modular multi-sensor fusion approach applied to MAV navigation , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[29]  Jean-Sébastien Sereni,et al.  Collaborative search on the plane without communication , 2012, PODC '12.

[30]  Kai-Yew Lum,et al.  Multiagent Information Fusion and Cooperative Control in Target Search , 2013, IEEE Transactions on Control Systems Technology.

[31]  B. O. Koopman.  The Theory of Search. II. Target Detection , 1956 .

[32]  E. Fernandez-Gaucherand,et al.  Cooperative control for multiple autonomous UAV's searching for targets , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[33]  Ali Khanafer,et al.  A Double-Sided Jamming Game with Resource Constraints , 2016 .

[34]  Erik D. Demaine,et al.  Online searching with turn cost , 2004, Theor. Comput. Sci..

[35]  Timothy W. McLain,et al.  Multiple UAV cooperative search under collision avoidance and limited range communication constraints , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[36]  Emilio Frazzoli,et al.  On competitive search games for multiple vehicles , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).