TY - GEN
T1 - A compilation based approach to conformant probabilistic planning with stochastic actions
AU - Taig, Ran
AU - Brafman, Ronen I.
N1 - Publisher Copyright:
Copyright © 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - We extend RBPP, the state-of-the-art, translation-based planner for conformant probabilistic planning (CPP) with deterministic actions, to handle a wide set of CPPs with stochastic actions. Our planner uses relevance analysis to divide a probabilistic "failure-allowance" between the initial state and the stochastic actions. Using its "initial-state allowance," it uses relevance analysis to select a subset of the set of initial states on which planning efforts will focus. Then, it generates a deterministic planning problem using all-outcome determinization in which action cost reflects the probability of the modeled outcome. Finally, a cost-bounded classical planner generates a plan with failure probability lower than the "stochastic-effect allowance." Our compilation method is sound, but incomplete, as it may underestimates the success probability of a plan. Yet, it scales up much better than the state-of-the-art PFF planner, solving larger problems and handling tighter probabilistic bounds on existing benchmarks.
AB - We extend RBPP, the state-of-the-art, translation-based planner for conformant probabilistic planning (CPP) with deterministic actions, to handle a wide set of CPPs with stochastic actions. Our planner uses relevance analysis to divide a probabilistic "failure-allowance" between the initial state and the stochastic actions. Using its "initial-state allowance," it uses relevance analysis to select a subset of the set of initial states on which planning efforts will focus. Then, it generates a deterministic planning problem using all-outcome determinization in which action cost reflects the probability of the modeled outcome. Finally, a cost-bounded classical planner generates a plan with failure probability lower than the "stochastic-effect allowance." Our compilation method is sound, but incomplete, as it may underestimates the success probability of a plan. Yet, it scales up much better than the state-of-the-art PFF planner, solving larger problems and handling tighter probabilistic bounds on existing benchmarks.
UR - http://www.scopus.com/inward/record.url?scp=84943278180&partnerID=8YFLogxK
U2 - 10.1609/icaps.v25i1.13718
DO - 10.1609/icaps.v25i1.13718
M3 - Conference contribution
AN - SCOPUS:84943278180
T3 - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
SP - 220
EP - 224
BT - ICAPS 2015 - Proceedings of the 25th International Conference on Automated Planning and Scheduling
A2 - Brafman, Ronen
A2 - Domshlak, Carmel
A2 - Haslum, Patrik
A2 - Zilberstein, Shlomo
PB - Association for the Advancement of Artificial Intelligence
T2 - 25th International Conference on Automated Planning and Scheduling, ICAPS 2015
Y2 - 7 June 2015 through 11 June 2015
ER -