Planning for Partial Observability by SAT and Graph Constraints.
Binda PandeyJussi RintanenPublished in: ICAPS (2018)
Keyphrases
- partial observability
- planning problems
- belief space
- partially observable
- symbolic model checking
- planning under partial observability
- belief state
- sat encodings
- classical planning
- planning domains
- reinforcement learning
- partially observable markov decision processes
- domain independent
- heuristic search
- random walk
- bayesian networks
- sat solvers
- decision problems
- constraint satisfaction
- state space
- situation calculus
- search problems
- markov decision process