Scheduling a plan with delays in time: a CSP approach

Authors:
Eliseo Marzal;Eva Onaindia;Laura Sebastia;Jose A. Alvarez
Affiliations:
Universidad Politecnica de Valencia, Spain;Universidad Politecnica de Valencia, Spain;Universidad Politecnica de Valencia, Spain;Universidad de Guanajuato, Mexico
Venue:
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Year:
2005

Citing 3
Cited 0

Planning as constraint satisfaction: solving the planning graph by compiling it into CSP

Artificial Intelligence
Automated Planning: Theory & Practice

Automated Planning: Theory & Practice
PDDL2.1: an extension to PDDL for expressing temporal planning domains

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

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.