A formal analysis and taxonomy of task allocation in multi-robot systems

International Journal of Robotics Research

Volumn 23, Issue 9, 2004, Pages 939-954

  Gerkey, Brian P ^a   Matarić, Maja J ^b  

^a STANFORD UNIVERSITY   (United States)

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

Author keywords

Coordination; Multi robot systems; Task allocation; Utility

Indexed keywords

COORDINATION; MULTI-ROBOT SYSTEMS; TASK ALLOCATION; UTILITY;

ALGORITHMS; CONSTRAINT THEORY; INDUSTRIAL ECONOMICS; OPERATIONS RESEARCH; PROBLEM SOLVING; RANDOM PROCESSES; ROBOTICS;

MOBILE ROBOTS;

EID: 4444338336     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/0278364904045564     Document Type: Article

References (68)

1. Agassounon, W. and Martinoli, A. 2002. A macroscopic model of an aggregation experiment using embodied agents in groups of time-varying sizes. Proceedings of the IEEE Conference on System, Man and Cybernetics (SMC), Hammamet, Tunisia, pp. 250-255.
2. Ahuja, R.K., Magnanti, T.L., and Orlin, J.B. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River, NJ.
3. Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., and Yovine, S. 1995. The algorithmic analysis of hybrid systems. Theoretical Computer Science 138(1):3-34.
4. Atamtürk, A., Nemhauser, G., and Savelsbergh, M. 1995. A combined lagrangian, linear programming and implication heuristic for large-scale set partitioning problems. Journal of Heuristics 1:247-259.
5. Avis, D. 1983. A survey of heuristics for the weighted matching problem. Networks 13:475-493.
6. Balas, E. and Padberg, M.W. 1972. On the set-covering problem. Operations Research 20(6):1152-1161.
7. Balas, E. and Padberg, M.W. 1976. Set partitioning: A survey. SIAM Review 18(4):710-760.
8. Bar-Yehuda, R. and Even, S. 1981. A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms 2:198-203.
9. Bertsekas, D.P. 1990. The auction algorithm for assignment and other network flow problems: A tutorial. Interfaces 20(4): 133-149.
10. Botelho, S.C. and Alarm, R. 1999. M+: a scheme for multirobot cooperation through negotiated task allocation and achievement. Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Detroit, MI, pp. 1234-1239.
11. Brooks, R.A. 1986. A robust layered control system for a mobile robot. IEEE Journal of Robotics and Automation 2(1): 14-23.
12. Brucker, P. 1998. Scheduling Algorithms, 2nd edition. Springer-Verlag, Berlin.
13. Bruno, J.L., Coffman, E.G., and Sethi, R. 1974. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM 17(7):382-387.
14. Cai, X., Lee, C.-Y., and Li, C.-L. 1998. Minimizing total completion time in two-processor task systems with pre-specified processor allocations. Naval Research Logistics 45(2):231-242.
15. Cao, Y.U., Fukunaga, A.S., and Kahng, A. 1997. Cooperative mobile robotics: Antecedents and directions. Autonomous Robots 4(1):7-27.
16. Castelpietra, C., Iocchi, L., Nardi, D., Piaggio, M., Scalzo, A., and Sgorbissa, A. 2001. Communication and coordination among heterogeneous mid-size players: ART99. RoboCup 2000, LNAI Vol. 2019, P. Stone, T. Balch, and G. Kraetzschmar, editors. Springer-Verlag, Berlin, pp. 86-95.
17. Chaimowicz, L., Campos, M.F.M., and Kumar, V. 2002. Dynamic role assignment for cooperative robots. Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Washington, DC, May 11-15, pp. 293-298.
18. Chien, S., Barrett, A., Estlin, T., and Rabideau, G. 2000. A comparison of coordinated planning methods for cooperating rovers. Proceedings of Autonomous Agents, Barcelona, Spain, pp. 100-101.
19. Chvátal, V. 1979. A greedy heuristic for the set cover problem. Mathematics of Operations Research 4:233-235.
20. Cormen, T.H., Leiserson, C.E., and Rivest, R.L. 1997. Introduction to Algorithms. MIT Press, Cambridge, MA.
21. Dahl, T.S., Matarić, M.J., and Sukhatme, G.S. 2002. Adaptive spatio-temporal organization in groups of robots. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Lausanne, Switzerland, September 30-October 4, pp. 1044-1049.
22. Deneubourg, J.-L., Theraulaz, G., and Beckers, R. 1991. Swarm-made architectures. Proceedings of the European Conference on Artificial Life (ECAL), Paris, France, pp. 123-433.
23. Dertouzos, M.L. and Mok, A.K. 1983. Multiprocessor on-line scheduling of hard-real-time tasks. IEEE Transactions on Software Engineering 15(12):1497-1506.
24. Dias, M.B. and Stentz, A. 2001. A market approach to multirobot coordination. Technical Report CMU-RI-TR-01-26, The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA.
25. Dias, M.B. and Stentz, A. 2002. Opportunistic optimization for market-based multirobot control. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Lausanne, Switzerland, September 30-October 4, pp. 2714-2720.
26. Donald, B., Jennings, J., and Rus, D. 1997. Information invariants for distributed manipulation. International Journal of Robotics Research 16(5):673-702.
27. Dudek, G., Jenkin, M., and Milios, E. 2002. A taxonomy of multirobot systems. Robot Teams: From Diversity to Polymorphism, T. Balch and L. Parker, editors. A.K. Peters, Natick, MA, pp. 3-22.
28. Emery, R., Sikorski, K., and Balch, T. 2002. Protocols for Collaboration, Coordination, and Dynamic Role Assignment in a Robot Team. Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Washington, DC, May 11-15, pp. 3008-3015.
29. Fukuda, T., Nakagawa, S., Kawauchi, Y., and Buss, M. 1988. Self-organizing robots based on cell structures - GEBOT. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Victoria, BC, Canada, pp. 145-150.
30. Gale, D. 1960. The Theory of Linear Economic Models. McGraw-Hill, New York.
31. Garey, M.R. and Johnson, D.S. 1978. "Strong" NP-completeness results: motivation, examples, and implications. Journal of the ACM 25(3):499-508.
32. Gat, E. 1998. Three-layer architectures. Artificial Intelligence and Mobile Robots: Case Studies of Successful Robot Systems, D. Kortenkamp, R. P. Bonasso, and R. Murphy, editors. AAAI Press, Menlo Park, CA, pp. 195-210.
33. Gerkey, B.P. and Matarić, M.J. 2002a. A market-based formulation of sensor-actuator network coordination. Proceedings of the AAAI Spring Symposium on Intelligent Embedded and Distributed Systems, Palo Alto, CA, pp. 21-26.
34. Gerkey, B.P. and Matarić, M.J. 2002b. Sold!: Auction methods for multi-robot coordination. IEEE Transactions on Robotics and Automation 18(5):758-768.
35. 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 (ICRA), Taipei, Taiwan, pp. 3862-3868.
36. Guestrin, C., Koller, D., and Parr, R. 2001. Multi-agent planning with factored MDPs. Proceedings of Advances in Neural Information Processing Systems (NIPS), Vancouver, Canada, pp. 1523-1530.
37. Hoffman, K.L. and Padberg, M.W. 1993. Solving airline crew scheduling problems by branch-and-cut. Management Science 39(6):657-682.
38. Hoogeveen, J., van del Velde, S., and Veltman, B. 1994. Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Applied Mathematics 55:259-272.
39. Jennings, J.S. and Kirkwood-Watts, C. 1998. Distributed mobile robotics by the method of dynamic teams. Distributed Autonomous Robotic Systems 3, T. Luth, P. Dario, and H. Worn, editors. Springer-Verlag, New York, pp. 47-56.
40. Kaelbling, L.P., Littman, M.L., and Cassandra, A.R. 1998. Planning and acting in partially observable stochastic domains. Artificial Intelligence 101(1-2):99-134.
41. Kalyanasundaram, B. and Pruhs, K. 1993. Online weighted matching. Journal of Algorithms 14:478-488.
42. Klavins, E. 2003. Communication Complexity of Multi-Robot Systems. Algorithmic Foundations of Robotics V, J.-D. Boissonnat, J. Burdick, S. Hutchinson, and K. Goldberg, editors. Springer-Verlag, New York, pp. 275-292.
43. Korte, B. and Vygen, J. 2000. Combinatorial Optimization: Theory and Algorithms. Springer-Verlag, Berlin.
44. Kube, C.R. and Zhang, H. 1993. Collective robotics: from social insects to robots. Adaptive Behavior 2(2): 189-219.
45. Kuhn, H.W. 1955. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1):83-97.
46. Lerman, K. and Galstyan, A. 2002. Mathematical model of foraging in a group of robots: Effect of interference. Autonomous Robots 13 (2): 127-141.
47. Marsten, R.E. and Shepardson, F. 1981. Exact solution of crew scheduling problems using the set partitioning model: recent successful applications. Networks 11:165-177.
48. Mason, M.T. 1986. Mechanics and planning of manipulator pushing operations. International Journal of Robotics Research 5(3):53-71.
49. Matarić, M.J. 1992. Designing emergent behaviors: from local interactions to collective intelligence. From Animals to Animats 2, 2nd International Conference on Simulation of Adaptive Behavior (SAB-92), J.-A. Meyer, H. Roitblat, and S. Wilson, editors. MIT Press, Cambridge, MA, pp. 432-441.
50. Modi, J., Jung, H., Tambe, M., Shen, W.-M., and Kulkarni, S. 2001. A dynamic distributed constraint satisfaction approach to resource allocation. Principles and Practice of Constraint Programming - CP 2001, T. Walsh, editor. Springer-Verlag, New York, pp. 685-700.
51. Murata, T. 1989. Petri nets: properties, analysis, and applications. Proceedings of the IEEE 77(4):541-580.
52. Østergard, E.H., Matarić, M.J., and Sukhatme, G.S. 2001. Distributed multi-robot task allocation for emergency handling. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Wailea, Hawaii, pp. 821-826.
53. Parker, L.E. 1994. Heterogeneous Multi-Robot Cooperation, PhD thesis, MIT EECS Department.
54. Parker, L.E. 1995. L-ALLIANCE: A mechanism for adaptive action selection in heterogeneous multi-robot teams. Technical Report ORNL/TM-13000, Oak Ridge National Laboratory, Knoxville, TN.
55. Parker, L.E. 1998. ALLIANCE: An architecture for fault-tolerant multi-robot cooperation. IEEE Transactions on Robotics and Automation 14(2):220-240.
56. Parker, L.E. 1999. Cooperative robotics for multi-target observation. Intelligent Automation and Soft Computing 5(1):5-19.
57. Pearce, D.W., editor. 1999. The MIT Dictionary of Modern Economics, 4th edition. MIT Press, Cambridge, MA.
58. Sandholm, T.W. and Lesser, V.R. 1997. Coalitions among computationally bounded agents. Artificial Intelligence 94(1):99-137.
59. Shehory, O. and Kraus, S. 1996. Formation of overlapping coalitions for precedence-ordered task-execution among autonomous agents. Proceedings of the International Conference on Multi-Agent Systems (ICMAS), Kyoto, Japan, pp. 330-337.
60. Shehory, O. and Kraus, S. 1998. Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1-2):165-200.
61. Simon, H.A. 2001. The Sciences of the Artificial, 3rd edition. MIT Press, Cambridge, MA.
62. Spletzer, J.R. and Taylor, C.J. 2001. A framework for sensor planning and control with applications to vision guided multi-robot systems. Proceedings of the Computer Vision and Pattern Recognition Conference (CVPR), Kauai, Hawaii, pp. 378-383.
63. Stone, P. and Veloso, M. 1999. Task decomposition, dynamic role assignment, and low-bandwidth communication for real-time strategic teamwork. Artificial Intelligence 110(2):241-273.
64. Vail, D. and Veloso, M. 2003. Dynamic multi-robot coordination. Multi-Robot Systems: From Swarms to Intelligent Automata, Vol. II, A. Schultz et al., editors. Kluwer Academic, Dordrecht, pp. 87-98.
65. Weigel, T., Auerback, W., Dietl, M., Dümler, B., Gutmann, J.-S., Marko, K., Müller, K., Nebel, B., Szerbakowski, B., and Thiel, M. 2001. CS Freiburg: Doing the right thing in a group. RoboCup 2000, LNAI Vol. 2019, P. Stone, T. Balch, and G. Kraetzschmar, editors. Springer-Verlag, Berlin, pp. 52-63.
66. Werger, B.B. and Matarić, M.J. 2001. Broadcast of local eligibility for multi-target observation. Distributed Autonomous Robotic Systems 4, L.E. Parker, G. Bekey, and J. Barhen, editors. Springer-Verlag, New York, pp. 347-356.
67. Yamauchi, B. 1998. Frontier-based exploration using multiple robots. Proceedings of Autonomous Agents, Minneapolis, MN, pp. 47-53.
68. 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 (ICRA), Washington, DC, May 11-15, pp. 3016-3023.