Abstract

Most previous work in explanation-based generalization (EBG) of plans dealt with totally ordered plans. These methods cannot be directly applied to generalizing partially ordered partially instantiated plans, a class of plans that have received significant attention in planning. In this paper we present a natural way of extending the explanation-based generalization methods to partially ordered partially instantiated (POPI) plans. Our development is based on modal truth criteria for POPI plans [3]. We develop explanation structures from these truth criteria, and use them as a common basis to derive a variety of generalization algorithms. Specifically we present algorithms for precondition generalization, order generalization, and possible correctness generalization of POPI plans. The systematic derivation of the generalization algorithms from the modal truth criterion obviates the need for carrying out a separate formal proof of correctness of the EBG algorithms. Our development also systematically explicates the tradeoffs among the spectrum of possible generalizations for POPI plans, and provides an empirical demonstration of the relative utility of EBG in partial ordering, as opposed to total ordering, planning frameworks.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call