Auction-based multi-robot routing

Robotics: Science and Systems

Volumn 1, Issue , 2005, Pages 343-350

  Lagoudakis, Michail G ^a   Markakis, Evangelos ^c   Kempe, David ^b   Keskinocak, Pinar ^a   Kleywegt, Anton ^a   Koenig, Sven ^b   Tovey, Craig ^a   Meyerson, Adam ^d   Jain, Sonal ^b  

^a Georgia Institute of Technology   (United States)

^b University of Southern California ^*  (United States)

^c Georgia Institute of Technology   (United States)

^d University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84959565400     PISSN: 23307668     EISSN: 2330765X     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. G. Rabideau, T. Estlin, S. Chien, and A. Barrett, "A comparison of coordinated planning methods for cooperating rovers," in Proceedings of the Intl Conference on Autonomous Agents, 2000, pp. 100-101.
2. M. Dias and A. Stentz, "A free market architecture for distributed control of a multirobot system," in Proceedings of the International Conference on Intelligent Autonomous Systems, 2000, pp. 115-122.
3. B. Gerkey and M. Matarić, "Sold!: Auction methods for multi-robot coordination," IEEE Transactions on Robotics and Automation, vol. 18, no. 5, pp. 758-768, 2002.
4. R. Zlot, A. Stentz, M. Dias, and S. Thayer, "Multi-robot exploration controlled by a market economy," in Proceedings of the International Conference on Robotics and Automation, 2002, pp. 3016-3023.
5. M. Berhault, H. Huang, P. Keskinocak, S. Koenig, W. Elmaghraby, P. Griffin, and A. Kleywegt, "Robot exploration with combinatorial auctions," in Proceedings of the International Conference on Intelligent Robots and Systems, October 2003, pp. 1957-1962.
6. M. Lagoudakis, M. Berhault, P. Keskinocak, S. Koenig, and A. Kleywegt, "Simple auctions with performance guarantees for multi-robot task allocation," in Proceedings of the International Conference on Intelligent Robots and Systems, September 2004.
7. C. Tovey, M. Lagoudakis, S. Jain, and S. Koenig, "The generation of bidding rules for auction-based robot coordination," in Proceedings of the 3rd International Multi-Robot Systems Workshop, March 2005.
8. R. C. Prim, "Shortest connection networks and some generalizations." Bell Systems Technical Journal, pp. 1389-1401, 1957.
9. G. Even, N. Garg, J. Könemann, R. Ravi, and A. Sinha, "Min-Max tree covers of graphs," Operations Research Letters, vol. 32, pp. 309-315, 2004.
10. E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmoys, Eds., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, 1985.
11. P. Toth and D. Vigo, Eds., The Vehicle Routing Problem, ser. Monographs on Discrete Mathematics and Applications. SIAM, 2002.
12. G. N. Frederickson, M. S. Hecht, and C. E. Kim, "Approximation algorithms for some routing problems," SIAM Journal of Computing, vol. 7, no. 2, pp. 178-193, 1978.
13. J. O. Cerdeira, "The multi-depot traveling salesman problem," Revista Investigao Operacional, vol. 12, 1992.
14. J. K. Lenstra, D. B. Shmoys, and E. Tardos, "Approximation algorithms for scheduling unrelated parallel machines," Math. Program., vol. 46, no. 3, pp. 259-271, 1990.
15. J. Fakcharoenphol, C. Harrelson, and S. Rao, "The k-Traveling repairman problem," in SODA '03: Proceedings of the fourteenth annual ACMSIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 2003, pp. 655-664.