A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs.
Krishnendu ChatterjeeMartin ChmelikJessica DaviesPublished in: CoRR (2015)
Keyphrases
- dynamic programming
- computational complexity
- learning algorithm
- detection algorithm
- objective function
- k means
- particle swarm optimization
- optimization algorithm
- preprocessing
- np hard
- probabilistic model
- search space
- cost function
- worst case
- constraint solver
- segmentation algorithm
- multi agent systems
- similarity measure