Skip to main content

Task Assignment

  • Chapter
  • First Online:
  • 1107 Accesses

Abstract

Task assignment in multi-agent systems is a complex coordination problem, in particular in systems that are subject to dynamic and changing operating conditions. To enable agents to deal with dynamism and change, adaptive task assignment approaches are needed. In this chapter, we study two approaches for adaptive task assignment that are characteristic for two classical families of coordination mechanisms for task assignment. In particular, we study and compare a field-based approach for task assignment (FiTA) with a protocol-based approach (DynCNET). In FiTA, tasks emit computational fields in a virtual environment that attract idle agents. Agents follow the gradient of the combined field that guides them toward tasks. DynCNET is an extension of the well-known contract net protocol CNET [151], with “Dyn” referring to support for dynamic task assignment. Both FiTA and DynCNET enable task assignment in the system based on local interaction among agents and allow for adaptation of task assignment during delayed commencement. Yet, the approaches differ in the manner agents realize task assignment. In FiTA, agents use simple rules that guide them toward tasks, providing an emergent solution for task assignment. Contrarily, in DynCNET agents use explicit selection mechanisms and can negotiate about task assignment. Our focus is on systems with homogeneous tasks that can be executed by individual agents. We do not consider complex tasks, for instance composite tasks that have to be divided among agents, or a combination of related tasks that have to be executed by a single agent. This perspective allows us to focus on the basic challenges of task assignment in systems that are subject to dynamic and changing operating conditions.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    In the context of the AGV application, a transport and a task are synonyms.

  2. 2.

    The format of the rules is defined as

    (condition) → {optional computation; selected action}

  3. 3.

    The initiator’s state changes from Assigned to Executing when it receives the bound message from the participant (see Fig. 6.9).

  4. 4.

    In fact, some of the messages may get lost without blocking the interaction. For example, the protocol will not fail when a call for proposals message gets lost.

References

  1. S. Aknine, S. Pinson, M. Shakun, An extended multi-agent negotiation protocol. Auton. Agent Multi-Agent Syst. 8(1), 5–45 (2004)

    Article  Google Scholar 

  2. P. Hart, N. Nilsson, B. Raphael, A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 28–29 (1968)

    Article  Google Scholar 

  3. A. Helleboogh, Simulation of Distributed Control Applications in Dynamic Environments. PhD Dissertation, Katholieke Universiteit Leuven, Belgium, 2007

    Google Scholar 

  4. M.-P. Huget, J. Odell, B. Bauer, The AUML approach, in Methodologies and Software Engineering for Agent Systems: The Agent-Oriented Software Engineering Handbook, ed. by F. Bergenti, M.-P. Gleizes, F. Zambonelli (Kluwer, New York, NY, 2006)

    Google Scholar 

  5. Y. Koren, J. Borenstein, in Potential Field Methods and Their Inherent Limitations for Mobile Robot Navigation. Proceedings of the IEEE Conference on Robotics and Automation, Sacramento, CA, 1991

    Google Scholar 

  6. A. Mallya, M. Singh, in Modeling Exceptions via Commitment Protocols. Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems, Utrecht, The Netherlands, July 2005 (ACM Press, New York, NY, 2005)

    Google Scholar 

  7. R. Smith, The contract net protocol: High level communication and control in a distributed problem solver. IEEE Trans. Comput. C-29(12), 1104–1113 (1980)

    Article  Google Scholar 

  8. UNiMod, Executable UML, http://unimod.sourceforge.net/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Danny Weyns .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Weyns, D. (2010). Task Assignment. In: Architecture-Based Design of Multi-Agent Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01064-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01064-4_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01063-7

  • Online ISBN: 978-3-642-01064-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics