Computing parameter domains as an aid to planning

Abstract

We show that by inferring parameter domains of planning operators, given the definitions of the operators and the initial and goal conditions, we can often speed up the planning process by an order of magnitude or more. We infer parameter domains by a polynomial-time algorithm that uses forward propagation of sets of constants occurring in the initial conditions and in operator postconditions. During planning, parameter domains can be used to prune operator instances whose parameter domains are inconsistent with binding constraints, and to eliminate spurious "clobbering threats" that cannot, in fact, be realized without violating domain constraints. We illustrate these applications with examples from the UCPOP test suite and from the Rochester trains transportation planning domain. Correspondence: please address correspondence to the second author. This work is a revised and extended version of a paper that will appear in Proceedings of the Third International Conference on Artifici...

Cite this paper

@article{gerevini1996computing,
  title = {{Computing parameter domains as an aid to planning}},
  author = {Gerevini, Alfonso and Schubert, Lenhart K.},
  pages = {94--101},
  year = {1996}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers