Task Assignment with Dynamic Token Generation

  • Alessandro Farinelli
  • Luca Iocchi
  • Daniele Nardi
  • Fabio Patrizi
Conference paper
Part of the Advances in Soft Computing book series (AINSC, volume 28)


The problem of assigning tasks to a group of agents acting in a dynamic environment is a fundamental issue for a MAS and is relevant to several real world applications. Several techniques have been studied to address this problem, however when the system needs to scale up with size, communication quickly becomes an important issue to address; moreover, in several applications tasks to be assigned are dynamically evolving and perceived by agents during mission execution. In this paper we present a distributed task assignment approach that ensure very low communication overhead and is able to manage dynamic task creation. The basic idea of our approach is to use tokens to represent tasks to be executed, each team member creates, executes and propagates tokens based on its current knowledge of the situation. We test and evaluate our approach by means of experiments using the RoboCup Rescue simulator.


Task Assignment Task Allocation Combinatorial Auction Token Passing Team Mate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Farinelli, P. Scerri, and M. Tambe. Allocating and reallocating roles in very large scale teams. In First Int. Workshop on Synthetic Simulation and Robotics to Mitigate Earthquake Disaster, Padua, Italy, July 2003.Google Scholar
  2. 2.
    A. Farinelli, P. Scerri, and M. Tambe. Building large-scale robot systems: Distributed role assignment in dynamic, uncertain domains. In Representation and approaches for time-critical decentralized resources/role/task allocation (AAMAS Workshop), 2003.Google Scholar
  3. 3.
    B. Gerkey and J. M. Matarić. Multi-robot task allocation: Analyzing the complexity and optimality of key architectures. In Proc. of the Int. Conf. on Robotics and Automation (ICRA’03), Taipei, Taiwan, Sep 14–19 2003.Google Scholar
  4. 4.
    L. Hunsberger and B. Grosz. A combinatorial auction for collaborative planning. In Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS-2000), pages 151–158, 2000.Google Scholar
  5. 5.
    H. Kitano, M. Asada, Y. Kuniyoshi, I. Noda, E. Osawa, and H. Matsubara. RoboCup: A challenge problem for AI. AI Magazine, 18(l):73–85, Spring 1997.Google Scholar
  6. 6.
    Roger Mailler, Victor Lesser, and Bryan Horling. Cooperative negotiation for soft realtime distributed resource allocation. In Proceedings of AAMAS’03, 2003.Google Scholar
  7. 7.
    P. J. Modi, H. Jung, W. Shen, M. Tambe, and S. Kulkarni. A dynamic distributed constraint satisfaction approach to resource allocation. In Proc of Constraint Programming, 2001.Google Scholar
  8. 8.
    R. Nair, T. Ito, M. Tambe, and S. Marsella. Task allocation in robocup rescue simulation domain. In Proceedings of the International Symposium on RoboCup, 2002.Google Scholar
  9. 9.
    D. Nardi, A. Biagetti, G. Colombo, L. Iocchi, and R. Zaccaria. Real-time planning and monitoring for search and rescue operations in large-scale disasters. Technical report, University “La Sapienza” Rome, 2002. Scholar
  10. 10.
    L._E. Parker. ALLIANCE: An architecture for fault tolerant multirobot cooperation. IEEE Transactions on Robotics and Automation, 14(2):220–240, 1998.CrossRefGoogle Scholar
  11. 11.
    P. Scerri, A. Farinelli, S. Okamoto, and M. Tambe. Allocating roles in extreme team. In AAMAS 2004 (Poster), New York, USA, 2004.Google Scholar
  12. 12.
    P. Scerri, A. Farinelli, S. Okamoto, and M. Tambe. Token approach for role allocation in extreme teams: analysis and experimental evaluation. In 13th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (WETICE-2004)., Modena, Italy, 2004.Google Scholar
  13. 13.
    P. Scerri, D. V. Pynadath, L. Johnson, Rosenbloom P., N. Schurr, M Si, and M. Tambe. A prototype infrastructure for distributed robot-agent-person teams. In In Proceedings of AAMAS, 2003.Google Scholar
  14. 14.
    D. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62:461–474, 1993.zbMATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    G. Tidhar, A. S. Rao, and E. A. Sonenberg. Guided team selection. In Proceedings of the Second International Conference on Multi-Agent Systems, 1996.Google Scholar
  16. 16.
    R. Zlot, A Stenz, M. B. Dias, and S. Thayer. Multi robot exploration controlled by a market economy. In Proc. of the Int. Conf on Robotics and Automation (ICRA’02), pages 3016–3023, Washington DC, May 2002.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Alessandro Farinelli
    • 1
  • Luca Iocchi
    • 1
  • Daniele Nardi
    • 1
  • Fabio Patrizi
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversity of Rome La SapienzaRomeItaly

Personalised recommendations