Multiple agent search of an unknown environment using game theoretical models

This paper addresses the problem of obtaining optimal strategies for searching an unknown environment given in the form of an uncertainty map. Several strategies, in the form of variable length look-ahead policies that depend on the level of communication between searchers are proposed based on Nash equilibrium, security, and cooperative notions in game theory. Simulations are carried out for two searchers on a planar uncertainty map and the performance results are compared with respect to the type of strategies and the length of the look-ahead policies. These simulations show that longer look-ahead policies do not yield better performance than shorter ones, but need high computational effort. The results also show that although communication plays a major role, the performance of Nash and security strategies that do not depend on communication between searchers is comparable with the full-information centralized cooperative case.

[1]  Joachim Hertzberg,et al.  Advances in Plan-Based Control of Robotic Agents , 2003, Lecture Notes in Computer Science.

[2]  Marios M. Polycarpou,et al.  Analysis of opportunistic method for cooperative search by mobile agents , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[3]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[4]  J. R. Weisinger,et al.  A survey of the search theory literature , 1991 .

[5]  Yasuhiko Kitamura,et al.  A cooperative search scheme for dynamic problems , 1993, Proceedings of IEEE Systems Man and Cybernetics Conference - SMC.

[6]  Debasish Ghose,et al.  Optimal uncertainty reduction search using the k-shortest path algorithm , 2003, Proceedings of the 2003 American Control Conference, 2003..

[7]  Steven R. Rasmussen,et al.  Task allocation for wide area search munitions , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

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

[9]  David R. Jacques.  Search, Classification and Attack Decisions for Cooperative Wide Area Search Munitions , 2003 .

[10]  Marios M. Polycarpou,et al.  Cooperative Control for Autonomous Air Vehicles , 2002 .

[11]  Marios M. Polycarpou,et al.  A cooperative search framework for distributed agents , 2001, Proceeding of the 2001 IEEE International Symposium on Intelligent Control (ISIC '01) (Cat. No.01CH37206).

[12]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[13]  James N. Eagle,et al.  Using multiple searchers in constrained‐path, moving‐target search problems , 1996 .

[14]  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).

[15]  S. Pratt,et al.  Guidance and control for cooperative search , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[16]  Rush D. Robinett,et al.  Collective Search by Mobile Robots using Alpha-Beta Coordination , 1998, CRW.