Abstract
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.
This work has been partially funded by the Spanish government CICYT project TIN2005-08945-C06-06 (FEDER) and by the Valencian government project GVA06/096.
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
Fox, M., Long, D.: PDDL 2.1: An extension to pddl for expressing temporal planning domains. JAIR 20, 61–124 (2003)
Edelkamp, S., Hoffmann, J.: Pddl 2.2: the language for the classical part of ipc-04. In: ICAPS 2004 - IPC, pp. 2–6 (2004)
Biundo, S., Holzer, R., Schattenberg, B.: Project planning under temporal uncertainty. In: ECAI Workshop on Planning and Scheduling: Bridging Theory to Practice (2004)
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)
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)
Kautz, H.: Satplan04: Planning as satisfiability. In: IPC, 14th ICAPS, abstract booklet of the competing planners (2004)
Ghallab, M., Nau, D., Traverso, P.: Automated planning: Theory and Practice. Morgan Kauffman, San Francisco (2004)
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)
Detcher, R.: Constraint processing. Elsevier Science, Amsterdam (2003)
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)
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
Marzal, E., Onaindia, E., Sebastia, L., Alvarez, J.A. (2006). Scheduling a Plan with Delays in Time: A CSP Approach. In: MarÃn, R., OnaindÃa, E., BugarÃn, A., Santos, J. (eds) Current Topics in Artificial Intelligence. CAEPIA 2005. Lecture Notes in Computer Science(), vol 4177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881216_42
Download citation
DOI: https://doi.org/10.1007/11881216_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45914-9
Online ISBN: 978-3-540-45915-6
eBook Packages: Computer ScienceComputer Science (R0)