Integrating planning and scheduling in a CP framework: A transition-based approach

Abstract

Many potential real-world planning applications are on the border of planning and scheduling. To handle the complex choices of actions and temporal and resource constraints of these problems we need to integrate planning and scheduling techniques. Here we propose a transition-based formulation of temporal planning problems, that enables us to represent features like deadlines, time windows, release times etc. in a simple way. We describe a CSP encoding of the transition-based formulation and its potential advantages in integrating planning and scheduling techniques. Copyright © 2009, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.