A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs
A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs
POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability …