Contingent planning under uncertainty via stochastic satisfiability

摘要

We describe a new planning technique that efficiently solves probabilistic propositional contingent planning problems by converting them into instances of stochastic satisfiability (SSat) and solving these problems instead. We make fundamental contributions in two areas: the solution of SSat problems and the solution of stochastic planning problems. This is the first work extending the planning-as-satisfiability paradigm to stochastic domains. Our planner, zander, can solve arbitrary, goal-oriented, finite-horizon partially observable Markov decision processes (pomdps). An empirical study comparing zander to seven other leading planners shows that its performance is competitive on a range of problems.