Market-based multirobot coordination for complex tasks

International Journal of Robotics Research

Volumn 25, Issue 1, 2006, Pages 73-101

  Zlot, Robert ^a   Stentz, Anthony ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Auctions; Complex tasks; Market based; Multirobot coordination; Task allocation

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MARKETING; MATHEMATICAL MODELS; SEMANTICS; SENSORS;

AUCTIONS; COMPLEX TASKS; MARKET-BASED; MULTIROBOT COORDINATION; TASK ALLOCATION;

ROBOTS;

EID: 31144451484     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364906061160     Document Type: Conference Paper

References (56)

1. Andersson, M. and Sandholm, T. 2000. Contract type sequencing for reallocative negotiation. Proceedings of the International Conference on Distributed Computing Systems, Taipei, Taiwan, April 10-13.
2. Aylett, R. and Barnes, D. 1998. A multi-robot architecture for planetary rovers. Proceedings of the 5th ESA Workshop on Advanced Space Technologies for Robotics and Automation, Noordwijk, the Netherlands, December 1-3.
3. Berhault, M., Huang, H., Keskinocak, P., Koenig, S., Elmaghraby, W., Griffin, P., and Kleywegt, A. 2003. Robot exploration with combinatorial auctions. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Las Vegas, NV, October 27-31.
4. Botelho, S. S. C. and Alami, R. 1999. M+: a scheme for multirobot cooperation through negotiated task allocation and achievement. Proceedings of the IEEE International Conference on Robotics and Automation, Detroit, MI.
5. Botelho, S. S. C. and Alami, R. 2000. Robots that cooperatively enhance their plans. Proceedings of the 5th International Symposium on Distributed Autonomous Robotic Systems (DARS), Knoxville, TN, October 4-6.
6. Caloud, P., Choi, W., Latombe, J.-C, Pape, C. L., and Yim, M. 1990. Indoor automation with many mobile robots. Proceedings of the IEEE/RSJ International Workshop on Intelligent Robotics and Systems (IROS), July, Ibaraki, Japan.
7. Chandler, P. and Pachter, M. 2001. Hierarchical control for autonomous teams. Proceedings of the AIAA Guidance, Navigation, and Control Conference, Montreal, Canada, August.
8. Chao, I.-M., Golden, B. L., and Wasil, E. 1993. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. American Journal of Mathematical and Management Science 13:371-406.
9. Chavez, A., Moukas, A., and Maes, P. 1997. Challenger: a multi-agent system for distributed resource allocation. Proceedings of the 1st International Conference on Autonomous Agents, Marina del Rey, CA, February 5-8.
10. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C., editors. 2001. Introduction to Algorithms, 2nd edition, MIT Press, Cambridge, MA.
11. Dias, M. B. 2004. TraderBots: a new paradigm for robust and efficient multirobot coordination in dynamic environments. Ph.D. Thesis, Robotics Institute, Carnegie Mellon University, January.
12. Dias, M. B. and Stentz, A. 2002. Opportunistic optimization for market-based multirobot control. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots andSystems (IROS), EPFL, Lausanne, Switzerland, September 30-October 4.
13. Dias, M. B., Zlot, R., Zinck, M., Gonzalez, J. P., and Stentz, A. 2004a. A versatile implementation of the TraderBots approach to multirobot coordination. Proceedings of the 8th International Conference on Intelligent Autonomous Systems (IAS-8), Amsterdam, the Netherlands, March 10-13.
14. Dias, M. B., Zlot, R., Zinck, M., and Stentz, A. 2004b. Robust multirobot coordination in dynamic environments. Proceedings of the IEEE International Conference on Robotics and Automation, New Orleans, LA.
15. Dias, M. B., Zlot, R., Kalra, N., and Stentz, A. 2006. Market-based multirobot coordination: a survey and analysis. Proceedings of the IEEE (Special Issue on Multirobot Coordination), in press.
16. Farber, D. J. and Larson, K. C. 1972. The structure of a distributed computing system - software. Proceedings of the Symposium on Computer-Communications Networks and Teletraffic, Brooklyn, New York, April.
17. Fredrickson, G. N., Hecht, M. S., and Kim, C. E. 1978. Ap-proximation algorithms for some routing problems. SIAM Journal on Computing 7(2):178-193.
18. Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York.
19. Gerkey, B. P. and Matarić, M. J. 2002. Sold!: auction methods for multi-robot control. IEEE Transactions on Robotics and Automation 18(5):758-768.
20. Gerkey, B. P. and Matarić, M. J. 2003. Multi-robot task allocation: analyzing the complexity and optimality of key architectures. Proceedings of the IEEE International Conference on Robotics and Automation, Taipei, Taiwan, September 14-19.
21. Gerkey, B. P. and Matarić, M. J. 2004. A formal analysis and taxonomy of task allocation in multi-robot systems. International Journal of Robotics Research 23(9):939-954.
22. Goldberg, D., Cicirello, V., Dias, M. B., Simmons, R., Smith, S., and Stentz, A. 2003. Market-based multi-robot planning in a distributed layered architecture. Multi-Robot Systems: From Swarms to Intelligent Automata: Proceedings of the International Workshop on Multi-Robot Systems, Naval Research Laboratory, Washington, DC, March, Vol. 2, Kluwer Academic, Dordrecht.
23. Golfarelli, M., Maio, D., and Rizzi, S. 1997. A task-swap negotiation protocol based on the contract net paradigm. Technical Report 005-97, CSITE (Research Center for Informatics and Telecommunication Systems), University of Bologna.
24. Hoogeveen, J. A. 1991. Analysis of Christofides' heuristic: some paths are more difficult than cycles. Operations Research Letters 10:291-295.
25. Hunsberger, L. and Grosz, B. J. 2000. A combinatorial auction for collaborative planning. Proceedings of the 4th International Conference on Multi-Agent Systems (ICMAS), Boston, MA, July.
26. Jennings, J., Whelan, G., and Evans, W. F. 1997. Cooperative search and rescue with a team of mobile robots. Proceedings of the IEEE Conference on Advanced Robotics, Monterey, CA, July.
27. Kalra, N., Ferguson, D., and Stentz, A. 2005. Hoplites: a market-based framework for complex tight coordination in multi-robot teams. Proceedings of the IEEE International Conference on Robotics and Automation, Barcelona, Spain.
28. Kalyanasundaram, B. and Pruhs, K. 1993. Online weighted matching. Journal of Algorithms 14(3):478-488.
29. Korte, B. and Vygen, J. 2000. Combinatorial Optimization: Theory and Algorithms, 2nd edition, Springer-Verlag, Berlin.
30. Lagoudakis, M., Markakis, E., Kempe, D., Keskinocak, P., Kleywegt, A., Koenig, S., Tovey, C., Meyerson, A., and Jain, S. 2005. Auction-based multi-robot routing. Robotics: Science and Systems, MIT, Cambridge, MA, June.
31. Lemaire, T., Alami, R., and Lacroix, S. 2004. A distributed tasks allocation scheme in multi-UAV context. Proceedings of the IEEE International Conference on Robotics and Automation, New Orleans, LA.
32. Laporte, G., Nobert, Y., and Mercure, H. 1981. The multi-depot travelling salesman problem. Methods of Operations Research 40, pp. 367-376.
33. Matthias Ehrgott, X. G. 2000. An annotated bibliography of multi-objective combinatorial optimization. Technical Report 62/2000, Report in Wirtschaftsmathematik, Fachbereich Mathematik, Universitat Kaiser-slautern.
34. Nair, R., Ito, T., Tambe, M., and Marsella, S. 2002. Task allocation in the rescue simulation domain: a short note. RoboCup-2001: The 5th Robot World Cup Games and Conferences, Seattle, WA, August 2-10, Springer-Verlag, Berlin.
35. Ortiz, C. Jr., Vincent, R., and Morisset, B. 2005. Task inference and distributed task management in the centibots robotic system. Proceedings of the 4th International Joint Conference on Autonomous Agents and Multi-Agent Systems, Utrecht University, the Netherlands, July 25-29.
36. Parker, L. E. 1998. ALLIANCE: an architecture for faulttolerant multi-robot cooperation. IEEE Transactions on Robotics and Automation 14(2):220-240.
37. Rabideau, G., Estlin, T., Chien, S., and Barrett, A. 1999. A comparison of coordinated planning methods for cooperating rovers. Proceedings of the AIAA 1999 Space Technology Conference, Albuquerque, NM, September 28-30.
38. Rothkopf, M. H., Pekec, A., and Harstad, R. M. 1998. Computationally manageable combinatorial auctions. Management Science 44(8):1131-1147.
39. Sandholm, T. 1993. An implementation of the contract net protocol based on marginal cost calculations. Proceedings of the 12th International Workshop on Distributed Artificial Intelligence, Hidden Valley, PA, May.
40. Sandholm, T. 1998. Contract types for satisficing task allocation: I. Theoretical results. AAAI Spring Symposium: Satisficing Models, Stanford University, Palo Alto, CA, March 23-25.
41. Sandholm, T. 2002. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1-2):1-54.
42. Sandholm, T. and Lesser, V. 1995. Issues in automated negotiation and electronic commerce: extending the contract net framework. Proceedings of the First International Conference on Multi-Agent Systems (ICMAS'95), San Francisco, CA.
43. Simmons, R., Apfelbaum, D., Fox, D., Goldman, R. P., Haigh, K. Z., Musliner, D. J., Pelican, M., and Thrun, S. 2000a. Coordinated deployment of multiple heterogeneous robots. Proceedings of the IEEE/RSJ International Conference on Intelligent Robotics and Systems (IROS), Takamatsu, Japan, October 30-November 5.
44. Simmons, R., Singh, S., Hershberger, D., Ramos, J., and Smith, T. 2000b. First results in the coordination of heterogeneous robots for large-scale assembly. Proceedings of the International Symposium on Experimental Robotics (ISER), Honolulu, HI, December 10-13.
45. Simmons, R., Apfelbaum, D., Burgard, W., Fox, D., Thrun, S., and Younes, H. 2000c. Coordination for multirobot exploration and mapping. Proceedings of the National Conference on Artificial Intelligence, Austin, TX, July 30-August 3.
46. Smith, R. G. 1980. The contract net protocol: high-level communication and control in a distributed problem solver. IEEE Transactions on Computers 29(12):1104-1113.
47. Stentz, A. 1994. Optimal and efficient path planning for partially-known environments. Proceedings of the IEEE International Conference on Robotics and Automation, San Diego, CA, May, Vol. 4.
48. Stroupe, A. W. and Balch, T. 2003. Value-based observation with robot teams (VBORT) using probabilistic techniques. Proceedings of the llth International Conference on Advanced Robotics, University of Coimbra, Portugal, June 30-July 3.
49. Tovey, C., Lagoudakis, M. G., Jain, S., and Koenig, S. 2005. The generation of bidding rules for auction-based robot coordination. Proceedings of the 3rd International MultiRobot Systems Workshop, Naval Research Laboratory, Washington, DC, March 14-16.
50. Vail, D. and Veloso, M. 2003. Multirobot dynamic role assignment and coordination through shared potential fields. Multi-Robot Systems, A. Schultz, L. Parker, and F. Schneider, editors, Kluwer, Dordrecht.
51. Vazirani, V. V. 2001. Approximation Algorithms, Springer-Verlag, Berlin.
52. Wellman, M. P. and Wurman, P. R. 1998. Market-aware agents for a multiagent world. Robotics and Autonomous Systems 24:115-125.
53. Werger, B. B. and Matarić, M. J. 2000. Broadcast of local eligibility for multitarget observation. Distributed Autonomous Robotic Systems 4, L. E. Parker, G. Bekey, and J. Barhen, editors, Springer-Verlag, Berlin.
54. Zlot, R. and Stentz, A. 2003. Market-based multirobot coordiation using task abstraction. Proceedings of the International Conference on Field and Service Robotics, Lake Yamanaka, Japan, July.
55. Zlot, R., Stentz, A., Dias, M. B., and Thayer, S. 2002. Multirobot exploration controlled by a market economy. Proceedings of the IEEE International Conference on Robotics and Automation, Washington, DC, May 11-15.
56. Zlotkin, G. and Rosenschein, J. S. 1993. A domain theory for task oriented negotiation. Proceedings of the 13th International Joint Conference on Artificial Intelligence, Chambéry, France, August 28-September 3.