Least - Cost Flaw Repair : A Plan Re nement Strategy for Partial - Order Planning

Abstract

We describe the least-cost aw repair (LCFR) strategy for performing aw selection during partial-order causal link (POCL) planning. LCFR can be seen as a generalization of Peot and Smith's \Delay Unforced Threats" (DUnf) strategy (Peot & Smith 1993); where DUnf treats threats di erently from open conditions, LCFR has a uniform mechanism for handling all aws. We provide experimental results that demonstrate that the power of DUnf does not come from delaying threat repairs per se, but rather from the fact that this delay has the e ect of imposing a partial preference for least-cost aw selection. Our experiments also show that extending this to a complete preference for least-cost selection reduces search-space size even further. We consider the computational overhead of employing LCFR, and discuss techniques for reducing this overhead. In particular, we describe QLCFR, a strategy that reduces computational overhead by approximating repair costs. 1

5 Figures and Tables

Cite this paper

@inproceedings{Pollack1994LeastC, title={Least - Cost Flaw Repair : A Plan Re nement Strategy for Partial - Order Planning}, author={Martha E. Pollack}, year={1994} }