Abstract
This research proposes an any time algorithm for a task scheduling problem among agents. The tasks are composed of atomic tasks and are to be distributed to coalitions of agents as subtasks for parallel execution. We model the problem and propose an algorithm for it. The algorithm calls other low level algorithms to recursively generate plans for agents. The results show satisfactory results that the convergent times are reasonably short and are close to termination time in many settings. We also found that the distribution of input values affect the performance of the algorithm similar to the optimal coalition structure problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Sombattheera, C., Ghose, A.: A best-first anytime algorithm for computing optimal coalition structures. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1425–1428. ACM Press (2008)
Sycara, K.: Multiagent systems. AI Mag. 19(2) (1998). Intelligent Agents Summer
Kreher, D., Stinson, D.: Combinatorial Algorithms Generation Enumeration and Search. CRC Press, Boca Raton (1999)
Rahwan, T., Ramchurn, S., Dang, V., Jennings, N.: Near-optimal anytime coalition structure generation. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 2365–2371. Kaufman Morgan, January 2007
Mohammad Khanli, L., Analoui, M.: Resource scheduling in desktop grid by GridJQA. In: The 3rd International Conference on Grid and Pervasive Computing. IEEE (2008)
Mohammad Khanli, L., Analoui, M.: A QoS guided scheduling algorithm for grid computing. In: The Sixth International Symposium on Parallel and Distributed Computing (ISPDC 7). IEEE (2007)
Elmroth, E., Tordsson, J.: Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions. J. Future Gener. Comput. Syst. 24, 585–593 (2008)
Benjamin Khoo, B.T.B., Veeravalli, T.H., Simon See, C.W.: A multi-dimensional scheduling scheme in a grid computing environment. J. Parallel Distrib. Comput. 67, 659–673 (2007)
Ullah Munir, E., Li, J., Shi, S.: QoS sufferage heuristic for independent task scheduling in grid. Inf. Technol. J. 6(8), 1166–1170 (2007)
Etminani, K., Naghibzadeh, M.: A minmin max-min selective algorithm for grid task scheduling. In: The Third IEEE/IFIP International Conference on Internet, Uzbekistan (2007)
Afzal, A., Stephen McGough, A., Darlington, J.: Capacity planning and scheduling in Grid computing environment. J. Future Gener. Comput. Syst. 24, 404–414 (2008)
Shehory, O., Kraus, S.: Formation of overlapping coalitions for precedence-ordered task-execution among autonomous agents. In: Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS 96), Kyoto, Japan, pp. 330–337. AAAI Press, December 1996
Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artif. Intell. 101(1–2), 165–200 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Sombattheera, C. (2017). An Anytime Algorithm for Scheduling Tasks for Multiagent Systems. In: Phon-Amnuaisuk, S., Ang, SP., Lee, SY. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2017. Lecture Notes in Computer Science(), vol 10607. Springer, Cham. https://doi.org/10.1007/978-3-319-69456-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-69456-6_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69455-9
Online ISBN: 978-3-319-69456-6
eBook Packages: Computer ScienceComputer Science (R0)