Target assignment for robotic networks: Asymptotic performance under limited communication

Proceedings of the American Control Conference

Volumn , Issue , 2007, Pages 1155-1160

  Smith, Stephen L ^a   Bullo, Francesco ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGENTS; ALGORITHMS; ASYMPTOTIC ANALYSIS; BOOLEAN FUNCTIONS; COMMUNICATION; MOBILE AGENTS; PARALLEL ALGORITHMS; ROBOTICS; ROBOTS; TARGETS;

ASYMPTOTIC BOUNDS; ASYMPTOTIC PERFORMANCE; ASYMPTOTICALLY OPTIMAL; COMMUNICATION GRAPHS; DISTRIBUTED ALGORITHMS; EUCLIDEAN; LIMITED COMMUNICATION; MOBILE ROBOTIC; ROBOT MOTIONS; ROBOTIC NETWORKS; TRAVELING SALESPERSON PROBLEM (TSP);

STABILIZERS (AGENTS);

EID: 39549118220     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2007.4282420     Document Type: Conference Paper

References (13)

1. B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms. No. 21 in Algorithmics and Combinatorics, New York: Springer Verlag, 3 ed., 2005.
2. H. W. Kuhn, "The Hungarian method for the assignment problem," Naval Research Logistics, vol. 2, pp. 83-97, 1955.
3. D. P. Bertsekas and D. A. Castañón, "Parallel synchronous and asynchronous implementations of the auction algorithm," Parallel Computing, vol. 17, pp. 707-732, 1991.
4. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.
5. D. A. Castañón and C. Wu, "Distributed algorithms for dynamic reassignment," in IEEE Conf. on Decision and Control, (Maui, HI), pp. 13-18, Dec. 2003.
6. B. J. Moore and K. M. Passino, "Distributed task assignment for mobile agents," IEEE Transactions on Automatic Control, 2006. to appear.
7. V. Sharma, M. Savchenko, E. Frazzoli, and P. Voulgaris, "Time complexity of sensor-based vehicle routing," in Robotics: Science and Systems (S. Thrun, G. Sukhatme, S. Schaal, and O. Brock, eds.), pp. 297-304, Cambridge, MA: MIT Press, 2005.
8. S. Martinez, F. Bullo, J. Cortés, and E. Frazzoli, "On synchronous robotic networks - Part I: Models, tasks and complexity notions. & Part II: Time complexity of rendezvous and deployment algorithms," IEEE Transactions on Automatic Control, Apr. 2005. Submitted.
9. S. L. Smith and F. Bullo, "Target assignment for robotic networks: asymptotic performance under limited communication." Available electronically at http://arxiv.org/abs/cs.RO/0703067, Mar. 2007.
10. K. J. Supowit, E. M. Reingold, and D. A. Plaisted, "The traveling salesman problem and minimum mathcing in the unit square," SIAM Journal on Computing, vol. 12, pp. 144-156, 1983.
11. N. Christofides, "Worst-case analysis of a new heuristic for the traveling salesman problem," Tech. Rep. 388, Carnegie-Mellon University, Pittsburgh, PA, Apr. 1976.
12. M. Penrose, Random Geometric Graphs. Oxford Studies in Probability, Oxford, UK: Oxford University Press, 2003.
13. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388-404, 2000.