A distributed auction algorithm for the assignment problem

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2008, Pages 1212-1217

  Zavlanos, Michael M ^a   Spesivtsev, Leonid ^a   Pappas, George J ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COSTS; DISTRIBUTED PARAMETER CONTROL SYSTEMS; LINEAR PROGRAMMING;

ASSIGNMENT PROBLEMS; DISTRIBUTED AUCTION ALGORITHMS; DISTRIBUTED CONTROL; GLOBAL INFORMATIONS; LIMITED COMMUNICATION; LINEAR APPROXIMATIONS; LINEAR ASSIGNMENT PROBLEM; LOCAL COMMUNICATIONS;

COMBINATORIAL OPTIMIZATION;

EID: 62949241404     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2008.4739098     Document Type: Conference Paper

References (24)

1. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, 1982.
2. M. Held and R. M. Karp. The Traveling Salesman Problem and Minimal Spanning Trees, Journal on Operations Research, vol. 18, pp. 1138-1162, 1970.
3. M. M. Zavlanos and G. J. Pappas. Dynamic Assignment in Distributed Motion Planning with Local Coordination, IEEE Transactions on Robotics, vol. 24, no. 1, pp. 232-242, Feb. 2008.
4. S. Kloder and S. Hutchinson. Path Planning for Permutation-Invariant Multirobot Formations, IEEE Transactions on Robotics, vol. 22, no. 4, pp. 650-665, Aug. 2006.
5. M. Ji, S. Azuma, and M. Egerstedt. Role-Assignment in Multi-Agent Coordination, International Journal of Assistive Robotics and Mechatronics, vol. 7, no. 1, pp. 32-40, March 2006.
6. S. L. Smith and F. Bullo. Target Assignment for Robotic Networks: Worst Case and Stochastic Performance in Dense Environments, In Proceedings of the 46th IEEE Conference on Decision and Control, New Orleans, LA, Dec. 2007, pp. 3585-3590.
7. M. M. Zavlanos and G. J. Pappas. Distributed Formation Control with Permutation Symmetries, In Proceedings of the 46th IEEE Conference on Decision and Control, New Orleans, LA, Dec. 2007, pp. 2894-2899.
8. N. Michael, M. M. Zavlanos, V. Kumar and G. J. Pappas. Distributed Multi-Robot Task Assignment and Formation Control, IEEE International Conference on Robotics and Automation, Pasadena, CA, May 2008. (to appear)
9. H. G. Tanner, A. Jadbabaie and G. J. Pappas. Flocking in Fixed and Switching Networks, IEEE Transactions on Automatic Control, vol. 52, no. 5, pp. 863-868, May 2007.
10. R. Olfati-Saber and R. M. Murray. Consensus Problems in Networks of Agents with Switching Topology and Time-Delays, IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1520-1533, Sept. 2004.
11. J. Cortes, S. Martinez and F. Bullo. Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions, IEEE Transactions on Automatic Control, vol. 51, no. 8, pp. 1289-1298, Aug. 2006.
12. D. V. Dimarogonas, S. G. Loizou, K. J. Kyriakopoulos and M. M. Zavlanos. A Feedback Stabilization and Collision Avoidance Scheme for Multiple Independent Non-point Agents, Automatica, vol. 42, no. 2, pp. 229-243, Feb. 2006.
13. R. Sepulchre, D. Paley, N. E. Leonard. Stabilization of Planar Collective Motion: All-to-All Communication, IEEE Transactions on Automatic Control, vol. 52, no. 5, pp. 811-824, May 2007.
14. W. Ren and R. Beard. Consensus Seeking in Multi-Agent Systems under Dynamically Changing Interaction Topologies, IEEE Transactions on Automatic Control, vol. 50, no. 5, pp. 655-661, May 2005.
15. T. Balch and R.C. Arkin. Behavior-based Formation Control for Multirobot Teams, IEEE Transactions on Robotics and Automation, vol. 14, no. 6, pp. 926-939, Dec. 1998.
16. S. Poduri and G. S. Sukhatme. Constrained Coverage for Mobile Sensor Networks, In Proceedings of the IEEE International Conference on Robotics and Automation, New Orleans, LA, May 2004, pp. 165-172.
17. M. L. Balinski. Signature Methods for the Assignment Problem, Journal on Operations Research, vol. 33, pp. 527-537, 1985.
18. D. P. Bertsekas. A New Algorithm for the Assignment Problem, Mathematical Programming, vol. 21, pp. 152-171, 1981.
19. U. Derigs. The Shortest Augmenting Path Method for Solving Assignment Problems - Motivation and Computational Experience, Annals of Operations Research, vol. 4, pp. 57-102, 1985.
20. M. Hung. A Polynomial Simplex Method for the Assignment Problem, Operations Reserach, vol. 31, pp. 595-600, 1983.
21. H. W. Kuhn. The Hungarian Method for the Assignment Problem, Naval Research Logistics, vol. 2, no. 1-2, pp. 83-97, March 1955.
22. D. P. Bertsekas. Auction Algorithms for Network Flow Problems: A Tutorial Introduction, Computational Optimization and Applications, vol. 1, pp. 7-66, 1992.
23. D. P. Bertsekas and D. A. Castanon. Parallel Synchronous and Asynchronous Implementations of the Auction Algorithm, Parallel Computing, vol. 17, pp. 707-732, 1991.
24. G. B. Dantzig. Linear Programming and Extenssions, Princeton University Press, Princeton, NJ, 1963.