A unifying framework for hybrid planning and scheduling

  • Authors:

  • Bernd Schattenberg;Susanne Biundo

  • Affiliations:

  • Dept. of Artificial Intelligence, University of Ulm, Germany;Dept. of Artificial Intelligence, University of Ulm, Germany

  • Venue:
  • KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many real-world application domains that demand planning and scheduling support do not allow for a clear separation of these capabilities.Typically, an adequate mixture of both methodologies is required, since some aspects of the underlying planning problem imply consequences on the scheduling part and vice versa. Several integration efforts have been undertaken to couple planning and scheduling methods, most of them using separate planning and scheduling components which iteratively exchange partial solutions until both agree on a result. This paper presents a framework that provides a uniform integration of hybrid planning-the combination of operator based partial order planning and abstraction based hierarchical task network planning-and a hierarchical scheduling approach. It is based on a proper formal account of refinement planning, which allows for the formal definition of hybrid planning, scheduling, and search strategies. In a first step, the scheduling functionality is used to produce plans that comply with time restrictions and resource bounds. We show how the resulting framework is thereby able to perform novel kinds of search strategies that opportunistically interleave what used to be separate planning and scheduling processes.