Optimal cost almost-sure reachability in POMDPs

Author:

Publication: Artificial Intelligence

CITE.CC academic search helps you expand the influence of your papers.

Tags: AI

Abstract

Cite this article

https://doi.org/10.1016/j.artint.2016.01.007

View full text

>> Full Text: Optimal cost almost-sure reachability in POMDPs

Solving QBF with counterexample guided refinement

Truncated incremental search