Extending a Scheduler with Causal Reasoning: a CSP Approach

S. Fratini, A. Cesta and A. Oddi

In Proceedings of the ICAPS Workshop on Constraint Programming for Planning and Scheduling, 2005

A scheduling problem consists in a set of pre-defined activities that have to be temporally situated with respect to a set of resource availability constraints. Constraint-based approaches to scheduling have achieved mature development. We are currently studying how a constraint based scheduler can be endowed with the ability to synthesize new activities, i.e., by reasoning on planning knowledge. This paper describes some steps in the direction of uniformly managing planning as a special case of task scheduling. The general aim is to solve integrated planning and scheduling problems by rationally integrating in the same architecture various of the state-of-the-art CSP algorithms.