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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Billionnet, A., Costa, M.C., Sutter A.: An efficient algorithm for a task allocation problem. Journal of the ACM, 39(3) (1992) 502–518
Bruell, S., Balbo, G.: Computational algorithms for closed queueing networks. North Holland, New York, (1982)
Kraus, S., Plotkin, T.: Algorithms of distributed task allocation for cooperative agents. Theoretical Computer Science, 242 (2000) 1–27
Li, H.X., Yen, V.C.: Fuzzy sets and fuzzy decision making. CRS Press (1995)
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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