Skip to main content

Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents

  • Conference paper
  • First Online:
Book cover Fundamentals of Computation Theory (FCT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2138))

Included in the following conference series:

  • 443 Accesses

Abstract

This paper considers the problem of distributed dynamic task allocation by a set of cooperative agents. There are different types of tasks that are dynamically arriving to a system. Each of the agents can satisfy the tasks with some quality (which may be zero). Every task is augmented by the needed qualitative level of task’s execution. Thus, relation between agents and task types is fuzzy. The main goal of the agents is to maximize the overall performance of the system and to fulfill the tasks as soon as possible. This problem belongs to the Distributed Problem Solving class of Distributed Artificial Intelligence research. The results differ from that for task allocation in multi-agent environments where each agent tries to maximize its own performance.

The principal result of the paper is a distributed polynomial algorithm for determining probabilistic optimal policy for task allocation in fuzzy environment.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Billionnet, A., Costa, M.C., Sutter A.: An efficient algorithm for a task allocation problem. Journal of the ACM, 39(3) (1992) 502–518

    Article  MATH  MathSciNet  Google Scholar 

  2. Bruell, S., Balbo, G.: Computational algorithms for closed queueing networks. North Holland, New York, (1982)

    Google Scholar 

  3. Kraus, S., Plotkin, T.: Algorithms of distributed task allocation for cooperative agents. Theoretical Computer Science, 242 (2000) 1–27

    Article  MATH  MathSciNet  Google Scholar 

  4. Li, H.X., Yen, V.C.: Fuzzy sets and fuzzy decision making. CRS Press (1995)

    Google Scholar 

  5. Plotkin, T., Peterson, E.: Symmetry and entropy in the problem of optimization of files distribution. Automatic Control and Computer Science, 17(5) (1983) 5–11

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plotkin, T. (2001). Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics