Decision-Theoretic Refinement Planning using Inheritance Abstraction

Peter Haddawy and Meliani Suwandi

We present a method for abstracting probabilistic conditional actions and we show how to compute ex-pected utility bounds for plans containing such abstract actions. We present a planning algorithm that searches through the space of possible plans by build-ing abstract plans, comparing them, and refining only those that might be refinable to the optimal plan.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.