Scheduling a Plan with Delays in Time: A CSP Approach

  • Eliseo Marzal
  • Eva Onaindia
  • Laura Sebastia
  • Jose A. Alvarez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4177)


In many realistic planning domains, the exact duration of actions is only known at the instant of executing the action. This is the case, for instance, of temporal domains where it is common to find external factors that cause a delay in the execution of actions. In this paper we present an approach to obtain a plan for a temporal domain with delays. Our approach consists in combining a planning process, from which a temporal plan is obtained, and a scheduling process to allocate (instantiate) such a temporal plan over a time line.


Causal Link User Requirement Timing Interval Temporal Constraint Temporal Domain 
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.
    Fox, M., Long, D.: PDDL 2.1: An extension to pddl for expressing temporal planning domains. JAIR 20, 61–124 (2003)MATHGoogle Scholar
  2. 2.
    Edelkamp, S., Hoffmann, J.: Pddl 2.2: the language for the classical part of ipc-04. In: ICAPS 2004 - IPC, pp. 2–6 (2004)Google Scholar
  3. 3.
    Biundo, S., Holzer, R., Schattenberg, B.: Project planning under temporal uncertainty. In: ECAI Workshop on Planning and Scheduling: Bridging Theory to Practice (2004)Google Scholar
  4. 4.
    Bresina, J., Dearden, R., Meuleau, N., Ramakrishnan, S., Smith, D., Washington, R.: Planning under continuous time and resource uncertainty: A challenge for ai. In: Proc. AIPS 2002 Workshop on Planning for Temporal Domains (2002)Google Scholar
  5. 5.
    Do, M.B., Kambhampati, S.: Planning as constraint satisfaction: Solving the planning graph by compiling it into csp. Artificial Intelligence 132(2), 151–182 (2001)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kautz, H.: Satplan04: Planning as satisfiability. In: IPC, 14th ICAPS, abstract booklet of the competing planners (2004)Google Scholar
  7. 7.
    Ghallab, M., Nau, D., Traverso, P.: Automated planning: Theory and Practice. Morgan Kauffman, San Francisco (2004)MATHGoogle Scholar
  8. 8.
    Penberthy, J., Weld, D.: UCPOP: A sound, complete, partial order planner for ADL. In: 3rd. Int. Conf. on Principles of Knowledge Representation and Reasoning, pp. 103–114 (1992)Google Scholar
  9. 9.
    Detcher, R.: Constraint processing. Elsevier Science, Amsterdam (2003)Google Scholar
  10. 10.
    Gerevini, A., Saetti, A., Serina, I.: Planning in pddl2.2 domains with lpg-td. In: IPC, 14th ICAPS, abstract booklet of the competing planners (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Eliseo Marzal
    • 1
  • Eva Onaindia
    • 1
  • Laura Sebastia
    • 1
  • Jose A. Alvarez
    • 2
  1. 1.Universidad Politecnica de ValenciaSpain
  2. 2.Universidad de GuanajuatoMexico

Personalised recommendations