Multiagent UAV Routing: A Game Theory Analysis With Tight Price of Anarchy Bounds

We study the multiagent unmanned aerial vehicle (UAV) routing problem where a set of UAVs needs to collect information via surveillance of an area of operation. Each UAV is autonomous and does not rely on a reliable communication medium to coordinate with other UAVs. We formulate the problem as a game where UAVs are players and their strategies are the different routes they can take. Our model also incorporates the useful concept of information fusion. This results in a new variant of weighted congestion-type games. We show that the price of anarchy (PoA) of the game is at most 2, irrespective of the number of UAVs and their sensor capabilities. This also validates the empirical results of earlier works. Furthermore, we identify classes of games for the existence of a pure Nash equilibrium. To the best of our knowledge, these are the first such theoretical results in the related literature. Finally, we conduct experimental studies using randomly generated instances with several multiagent UAV routing policies. Our insights are that PoA increases with the congestion level when the same number of UAVs search a smaller area or more UAVs search the same area, and on an average, our proposed policies are less than 10% worse than the centralized optimal for the problem scenarios attempted. Note to Practitioners—UAVs are becoming increasingly popular for information collection tasks in defense and civilian applications alike. When the collection area is large, it is not unusual that a fleet of UAVs is deployed. Routing of a fleet can be performed in a centralized or decentralized manner. Decentralized routing might be the only possibility when centralized situational awareness is not possible due to bandwidth limitations and centralized optimal routes for each UAV in the fleet are too complex to compute. Autonomous solutions have several other advantages, let alone simplicity. For managers of UAV systems, our work provides the first theoretical characterization of how bad could decentralized routing be. Under various scenarios of information fusion, specifically weak and strong, and the attribution of information collected to each UAV of a team, we prove that the fleet will collect at least 50% of the best-centralized solution. Empirically, we show that, in fact, the performance of the fleet is much better and generally not worse than 10% of the best-centralized solution. Hopefully, our routing strategies provide valuable guidance to the practicing engineer or manager of a UAV fleet.

[1]  J. Nash,et al.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[2]  James Llinas,et al.  An introduction to multisensor data fusion , 1997, Proc. IEEE.

[3]  Johannes O. Royset,et al.  Aerial Search Optimization Model (ASOM) for UAVs in Special Operations , 2008 .

[4]  Philip B. Charlesworth.  A Non-cooperative Game to Coordinate the Coverage of Two Communications UAVs , 2013, MILCOM 2013 - 2013 IEEE Military Communications Conference.

[5]  Keith P. Tognetti,et al.  Letter to the Editor - An Optimal Strategy for a Whereabouts Search , 1968, Oper. Res..

[6]  Tim Roughgarden,et al.  Intrinsic Robustness of the Price of Anarchy , 2015, J. ACM.

[7]  J. Kadane.  Discrete search and the Neyman-Pearson Lemma , 1968 .

[8]  S. Iyengar,et al.  Multi-Sensor Fusion: Fundamentals and Applications With Software , 1997 .

[9]  Lav Gupta,et al.  Survey of Important Issues in UAV Communication Networks , 2016, IEEE Communications Surveys & Tutorials.

[10]  Bernhard Rinner,et al.  Persistent multi-UAV surveillance with energy and communication constraints , 2016, 2016 IEEE International Conference on Automation Science and Engineering (CASE).

[11]  Tim Roughgarden,et al.  Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness , 2010, ESA.

[12]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[13]  Walid Saad,et al.  Efficient Deployment of Multiple Unmanned Aerial Vehicles for Optimal Wireless Coverage , 2016, IEEE Communications Letters.

[14]  David W. Casbeer,et al.  Multi-UAV routing for persistent intelligence surveillance & reconnaissance missions , 2017, 2017 International Conference on Unmanned Aircraft Systems (ICUAS).

[15]  Jon M. Kleinberg,et al.  Mechanisms for (mis)allocating scientific credit , 2011, STOC '11.

[16]  Bahram Alidaee,et al.  On the Flexible Demand Assignment Problems: Case of Unmanned Aerial Vehicles , 2011, IEEE Transactions on Automation Science and Engineering.

[17]  Berthold Vöcking,et al.  Pure Nash equilibria in player-specific and weighted congestion games , 2009, Theor. Comput. Sci..

[18]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[19]  Symeon Papavassiliou,et al.  Self-Adaptive Energy Efficient Operation in UAV-Assisted Public Safety Networks , 2018, 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[20]  Philip B. Charlesworth,et al.  Using non-cooperative games to coordinate communications UAVs , 2014, 2014 IEEE Globecom Workshops (GC Wkshps).

[21]  Rolf H. Möhring,et al.  Characterizing the Existence of Potential Functions in Weighted Congestion Games , 2009, SAGT.

[22]  Éva Tardos,et al.  A network pricing game for selfish traffic , 2006, Distributed Computing.

[23]  L. Shapley,et al.  Potential Games , 1994 .

[24]  Symeon Papavassiliou,et al.  Supermodular Game-Based Distributed Joint Uplink Power and Rate Allocation in Two-Tier Femtocell Networks , 2017, IEEE Transactions on Mobile Computing.

[25]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[26]  Chenguang Shi,et al.  Non-Cooperative Game Theoretic Power Allocation Strategy for Distributed Multiple-Radar Architecture in a Spectrum Sharing Environment , 2018, IEEE Access.

[27]  Rakesh Nagi,et al.  Representation of potential information gain to measure the price of anarchy on ISR activities , 2013, Defense, Security, and Sensing.

[28]  Joseph B. Kadane,et al.  Optimal Whereabouts Search , 1971, Oper. Res..

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

[30]  Nadjib Achir,et al.  Unmanned Aerial Vehicles path planning for area monitoring , 2016, 2016 International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN).

[31]  Tim Roughgarden,et al.  Optimal Cost-Sharing in General Resource Selection Games , 2016, Oper. Res..

[32]  David W. Casbeer,et al.  Practical considerations for implementing an autonomous, persistent, intelligence, surveillance, and reconnaissance system , 2017, 2017 IEEE Conference on Control Technology and Applications (CCTA).

[33]  Kaarthik Sundar,et al.  Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling Depots , 2013, IEEE Transactions on Automation Science and Engineering.

[34]  Chase C. Murray,et al.  An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations , 2010 .

[35]  Symeon Papavassiliou,et al.  Wireless powered Public Safety IoT: A UAV-assisted adaptive-learning approach towards energy efficiency , 2018, J. Netw. Comput. Appl..

[36]  Meir Pachter,et al.  Optimization of air vehicles operations using mixed-integer linear programming , 2007, J. Oper. Res. Soc..

[37]  Symeon Papavassiliou,et al.  Energy efficient uplink joint resource allocation non-cooperative game with pricing , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[38]  Rakesh Nagi,et al.  Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment , 2017, Oper. Res..

[39]  Xiaotie Deng,et al.  Settling the complexity of computing two-player Nash equilibria , 2007, JACM.

[40]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .