Abstract
The coordinated management of inter-dependent plans or schedules belonging to different agents is a complex, real-world problem arising in diverse domains such as disaster rescue, small-team reconnaissance, and security patrolling. The problem is inherently a distributed one; no single agent has a global view and must make local scheduling decisions through collaboration with other agents to ensure a high quality global schedule. A key step towards addressing this problem is to devise appropriate distributed representations. The Coordinators Task Analysis Environmental Modeling and Simulation (C_tæms) language is a representation that was jointly designed by several multi-agent systems researchers explicitly for multi-agent task scheduling problems [1,2,3,4]. C_tæms is an extremely challenging class of scheduling problem which is able to model the distributed aspects of the 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
Preview
Unable to display preview. Download preview PDF.
References
Boddy, M., Horling, B., Phelps, J., Golman, R., Vincent, R., Long, A., Kohout, B.: C-TAEMS language specification v. 1.06 (2005)
Musliner, D.J., Durfee, E.H., Wu, J., Dolgov, D.A., Goldman, R.P., Boddy, M.S.: Coordinated plan management using multiagent MDPs. In: Proc. of the AAAI Spring Symp. on Distributed Plan and Schedule Management. AAAI Press, Menlo Park (2006)
Smith, S., Gallagher, A.T., Zimmerman, T.L., Barbulescu, L., Rubinstein, Z.: Multi-agent management of joint schedules. In: Proc. of the AAAI Spring Symp. on Distributed Plan and Schedule Management. AAAI Press, Menlo Park (2006)
Phelps, J., Rye, J.: GPGP—a domain-independent implementation. In: Proc. of the AAAI Spring Symp. on Distributed Plan and Schedule Mgmt. AAAI Press, Menlo Park (2006)
Modi, P.J., Shen, W., Tambe, M., Yokoo, M.: Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence Journal (2005)
Decker, K.: TAEMS: A Framework for Environment Centered Analysis & Design of Coordination Mechanisms. In: O’Hare, G., Jennings, N. (eds.) Foundations of Distributed Artificial Intelligence, ch. 16, pp. 429–448. Wiley Inter-Science, Chichester (1996)
Barták, R.: Theory and practice of constraint propagation. In: Figwer, J. (ed.) Proc. of the 3rd Wkshp. on Constraint Prog. in Decision Control, Poland (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sultanik, E.A., Modi, P.J., Regli, W.C. (2006). Constraint Propagation for Domain Bounding in Distributed Task Scheduling. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_65
Download citation
DOI: https://doi.org/10.1007/11889205_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)