Two-agent cooperative search using game models with endurance-time constraints

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

[1]  Timothy W. McLain,et al.  Coordinated target assignment and intercept for unmanned air vehicles , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

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

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

[4]  D. Ghose,et al.  Search using multiple UAVs with flight time constraints , 2004, IEEE Transactions on Aerospace and Electronic Systems.

[5]  Gaurav S. Sukhatme,et al.  Spreading Out: A Local Approach to Multi-robot Coverage , 2002, DARS.

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

[7]  Antonios Tsourdos,et al.  3D Dubins Sets Based Coordinated Path Planning for Swarm of UAVs , 2006 .

[8]  Ioannis K. Nikolos,et al.  Coordinated UAV path planning using Differential Evolution , 2005, Proceedings of the 2005 IEEE International Symposium on, Mediterrean Conference on Control and Automation Intelligent Control, 2005..

[9]  Phillip R. Chandler,et al.  Dynamic network flow optimization models for air vehicle resource allocation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

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

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

[12]  Marios M. Polycarpou,et al.  Decentralized Cooperative Search in UAV's Using Opportunistic Learning , 2002 .

[13]  Wolfram Burgard,et al.  Collaborative Exploration of Unknown Environments with Teams of Mobile Robots , 2001, Advances in Plan-Based Control of Robotic Agents.

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

[15]  Panos M. Pardalos,et al.  Theory and algorithms for cooperative systems , 2004 .

[16]  Scott A. Bortoff,et al.  Path planning for UAVs , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

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

[18]  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..

[19]  Paul Scerri,et al.  Coordinating very large groups of wide area search munitions , 2004 .

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

[21]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[22]  Brian R. Geiger,et al.  Optimal Path Planning of UAVs Using Direct Collocation with Nonlinear Programming , 2006 .

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

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

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

[26]  J.K. Hedrick,et al.  A mode-switching path planner for UAV-assisted search and rescue , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.