Monotonic Target Assignment for Robotic Networks

Consider an equal number of mobile robotic agents and distinct target locations dispersed in an environment. Each agent has a limited communication range and either: 1) knowledge of every target position or 2) a finite-range sensor capable of acquiring target positions and no a priori knowledge of target positions. In this paper we study the following target assignment problem: design a distributed algorithm with which the agents divide the targets among themselves and, simultaneously, move to their unique target. We evaluate an algorithm's performance by characterizing its worst-case asymptotic time to complete the target assignment; that is the task completion time as the number of agents (and targets) increases, and the size of the environment scales to accommodate them. We introduce the intuitive class of monotonic algorithms, and give a lower bound on its worst-case completion time. We design and analyze two algorithms within this class: the ETSP Assgmt algorithm which works under assumption 1), and the Grid Assgmt algorithm which works under either assumption 1) or 2). In ldquosparse environments,rdquo where communication is infrequent, the ETSP Assgmt algorithm is within a constant factor of the optimal monotonic algorithm for worst-case initial conditions. In ldquodense environments,rdquo where communication is more prevalent, the Grid Assgmt algorithm is within a constant factor of the optimal monotonic algorithm for worst-case initial conditions. In addition we characterize the performance of the Grid Assgmt algorithm for uniformly distributed targets and agents, and for the case when there are more agents than targets.

[1]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[2]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[3]  Rainer E. Burkard,et al.  Selected topics on assignment problems , 2002, Discret. Appl. Math..

[4]  Corey Schumacher,et al.  Task allocation for wide area search munitions with variable path length , 2003, Proceedings of the 2003 American Control Conference, 2003..

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

[6]  Francesco Bullo,et al.  Target assignment for robotic networks: Asymptotic performance under limited communication , 2007, 2007 American Control Conference.

[7]  J.K. Hedrick,et al.  Distributed collaboration with limited communication using mission state estimates , 2006, 2006 American Control Conference.

[8]  øöö Blockinø.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2002 .

[9]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[10]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[11]  George J. Pappas,et al.  Dynamic Assignment in Distributed Motion Planning With Local Coordination , 2008, IEEE Transactions on Robotics.

[12]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[13]  Vikrant Sharma,et al.  Transfer Time Complexity of Conflict-free Vehicle Routing with no Communications , 2007, Int. J. Robotics Res..

[14]  II. C Ombinatoric.  Target assignment for robotic networks : Worst-case and stochastic performance in dense environments , 2007 .

[15]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[16]  Francesco Bullo,et al.  Target assignment for robotic networks: Worst-case and stochastic performance in dense environments , 2007, 2007 46th IEEE Conference on Decision and Control.

[17]  D.A. Castanon,et al.  Distributed algorithms for dynamic reassignment , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[18]  M. Alighanbari,et al.  A Robust Approach to the UAV Task Assignment Problem , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[19]  Jason R. Marden,et al.  Autonomous Vehicle-Target Assignment: A Game-Theoretical Formulation , 2007 .

[20]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[21]  Kevin M. Passino,et al.  Distributed Task Assignment for Mobile Agents , 2007, IEEE Transactions on Automatic Control.

[22]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

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

[24]  Edward M. Reingold,et al.  The Travelling Salesman Problem and Minimum Matching in the Unit Square , 1983, SIAM J. Comput..

[25]  Aapo Hyvärinen,et al.  Optimization Theory and Algorithms , 2009 .

[26]  Jonathan P. How,et al.  Robust Decentralized Task Assignment for Cooperative UAVs , 2006 .