Heuristic Planning with Time and Resources

We present an algorithm for planning with time and resources, based on heuristic search. The algorithm minimizes makespan using an admissible heuristic derived automatically from the problem instance. Estimators for resource consumption are derived in the same way. The goals are twofold: to show the flexibility of the heuristic search approach to planning and to develop a planner that combines expressivity and performance. Two main issues are the definition of regression in a temporal setting and the definition of the heuristic estimating completion time. A number of experiments are presented for assessing the performance of the resulting planner.

[1]  David E. Smith,et al.  Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.

[2]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[3]  John K. Slaney,et al.  Blocks World revisited , 2001, Artif. Intell..

[4]  Malik Ghallab,et al.  Representation and Control in IxTeT, a Temporal Planner , 1994, AIPS.

[5]  Subbarao Kambhampati,et al.  Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan , 2000, J. Artif. Intell. Res..

[6]  Alex Fukunaga,et al.  ASPEN: A Framework for Automated Planning and Scheduling of Spacecraft Control and Operations , 1997 .

[7]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[8]  Austin Tate,et al.  O-Plan: a Knowledge-Based Planner and its Application to Logistics , 1996 .

[9]  Barry Richards,et al.  parcPlan: A Planning Architecture with Parallel Actions, Resources and Constraints , 1994, ISMIS.

[10]  Ichiro Nakatani,et al.  AI, Robotics and Automation in Space , 2000, J. Robotics Mechatronics.

[11]  Federico Barber,et al.  Integrating planning and scheduling , 2001, Appl. Artif. Intell..

[12]  Arno Sprecher,et al.  Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part II: Computation , 1996 .

[13]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[14]  Maria Fox,et al.  Utilizing Automatically Inferred Invariants in Graph Construction and Search , 2000, AIPS.

[15]  Austin Tate,et al.  The Use of Condition Types to Restrict Search in an AI Planner , 1994, AAAI.

[16]  Nicola Muscettola,et al.  Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.

[17]  Ioannis P. Vlahavas,et al.  Heuristic Planning with Resources , 2000, ECAI.

[18]  Alexander Reinefeld,et al.  Enhanced Iterative-Deepening Search , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Jana Koehler,et al.  Planning under Resource Constraints , 1998, ECAI.

[20]  Jj Org Hoomann.  A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm , 2000 .