Monotonic target assignment for robotic networks

IEEE Transactions on Automatic Control

Volumn 54, Issue 9, 2009, Pages 2042-2057

  Smith, Stephen L ^a   Bullo, Francesco ^a  

^a University of California   (United States)

Author keywords

Asymptotic performance; Distributed algorithms; Optimization; Target assignment; Task allocation

Indexed keywords

APRIORI; ASSIGNMENT PROBLEMS; ASYMPTOTIC PERFORMANCE; COMPLETION TIME; CONSTANT FACTORS; DISTRIBUTED ALGORITHM; DISTRIBUTED ALGORITHMS; DISTRIBUTED TARGET; INITIAL CONDITIONS; LIMITED COMMUNICATION RANGE; LOWER BOUNDS; MOBILE ROBOTIC; MONOTONIC ALGORITHMS; RANGE SENSORS; ROBOTIC NETWORKS; TARGET LOCATION; TARGET POSITION; TASK ALLOCATION; TASK COMPLETION TIME;

ASYMPTOTIC ANALYSIS; CONTROL THEORY; MOBILE AGENTS; OPTIMIZATION; PARALLEL ALGORITHMS; ROBOTICS; WIRELESS NETWORKS;

TARGETS;

EID: 70349435916     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2009.2026926     Document Type: Article

References (22)

1. S. L. Smith and F. Bullo, "Target assignment for robotic networks: Asymptotic performance under limited communication," in Proc. Amer. Control Conf., New York, NY, Jul. 2007, pp. 1155-1160.
2. S. L. Smith and F. Bullo, "Target assignment for robotic networks: Worst-case and stochastic performance in dense environments," in Proc. IEEE Conf. Decision Control, New Orleans, LA, Dec. 2007, pp. 3585-3590.
3. B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, ser. Algorithmics and Combinatorics, 3rd ed. New York: Springer, 2005.
4. R. Burkard, "Selected topics on assignment problems," Discrete Appl. Math., vol. 123, pp. 257-302, 2002.
5. 5/2 algorithm for maximum matchings in bipartite graphs," SIAM J. Comput., vol. 2, no. 4, pp. 225-231, 1973.
6. H. W. Kuhn, "The Hungarian method for the assignment problem," Naval Res. Logistics, vol. 2, pp. 83-97, 1955.
7. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Nashua, NH: Athena Scientific, 1997.
8. B. P. Gerkey and M. J. Mataric, "A formal analysis and taxonomy of task allocation in multi-robot systems," Int. J. Robot. Res., vol. 23, no. 9, pp. 939-954, 2004.
9. M. F. Godwin, S. Spry, and J. K. Hedrick, "Distributed collaboration with limited communication using mission state estimates," in Proc. Amer. Control Conf., Minneapolis, MN, Jun. 2006, pp. 2040-2046.
10. M. Alighanbari and J. P. How, "A robust approach to the UAV task assignment problem," Int. J. Robust Nonlin. Control, vol. 18, no. 2, pp. 118-134, 2008.
11. C. Schumacher, P. R. Chandler, S. J. Rasmussen, and D.Walker, "Task allocation for wide area search munitions with variable path length," in Proc. Amer. Control Conf., Denver, CO, 2003, pp. 3472-3477.
12. B. J. Moore and K. M. Passino, "Distributed task assignment for mobile agents," IEEE Trans. Autom. Control, vol. 52, no. 4, pp. 749-753, Apr. 2007.
13. D. A. Castañón and C. Wu, "Distributed algorithms for dynamic reassignment," in Proc. IEEE Conf. Decision Control, Maui, HI, Dec. 2003, pp. 13-18.
14. G. Arslan, J. R. Marden, and J. S. Shamma, "Autonomous vehicle-target assignment: A game theoretic formulation," ASME J. Dyn. Syst., Meas., Control, vol. 129, no. 5, pp. 584-596, 2007.
15. M. M. Zavlanos and G. J. Pappas, "Dynamic assignment in distributed motion planning with local coordination," IEEE Trans. Robotics, vol. 24, no. 1, pp. 232-242, Jan. 2008.
16. K. J. Supowit, E. M. Reingold, and D. A. Plaisted, "The traveling salesman problem and minimum matching in the unit square," SIAM J. Comput., vol. 12, pp. 144-156, 1983.
17. S. Arora, "Polynomial-time approximation schemes for the Euclidean TSP and other geometric problems," J. ACM, vol. 45, no. 5, pp. 753-782, 1998.
18. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
19. F. Xue and P. R. Kumar, "The number of neighbors needed for connectivity of wireless networks," Wireless Netw., vol. 10, no. 2, pp. 169-181, 2004.
20. M. Penrose, Random Geometric Graphs, ser. Oxford Studies in Probability. Oxford, U.K.: Oxford Univ. Press, 2003.
21. V. Sharma, M. Savchenko, E. Frazzoli, and P. Voulgaris, "Transfer time complexity of conflict-free vehicle routing with no communications," Int. J. Robot. Res., vol. 26, no. 3, pp. 255-272, 2007.
22. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.