Constraint Propagation for Domain Bounding in Distributed Task Scheduling

  • Evan A. Sultanik
  • Pragnesh Jay Modi
  • William C. Regli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4204)


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.


Schedule Problem Task Schedule Constraint Propagation Task Group Feasible Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boddy, M., Horling, B., Phelps, J., Golman, R., Vincent, R., Long, A., Kohout, B.: C-TAEMS language specification v. 1.06 (2005)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Modi, P.J., Shen, W., Tambe, M., Yokoo, M.: Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence Journal (2005)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Evan A. Sultanik
    • 1
  • Pragnesh Jay Modi
    • 1
  • William C. Regli
    • 1
  1. 1.Department of Computer ScienceDrexel UniversityPhiladelphiaUSA

Personalised recommendations