A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs

Krishnendu Chatterjee, Martin Chmelik, Jessica Davies

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 give…