Heuristic Planning with Time and Resources

Abstract

We present an algorithm for planning with metric time and certain kinds of resources, based on heuristic search. The heuristic is admissible w.r.t. makespan and derived automatically from the problem instance. We show how estimators for e.g. resource consumption can be derived in the same way. We also aim to combine the increased expressivity with the performance of recent STRIPS planners, and present a preliminary experimental evaluation.