APPSSAT: Approximate probabilistic planning using stochastic satisfiability.
Stephen M. MajercikPublished in: Int. J. Approx. Reason. (2007)
Keyphrases
- probabilistic planning
- boolean satisfiability
- heuristic search
- planning problems
- planning under uncertainty
- np complete
- satisfiability problem
- phase transition
- monte carlo
- genetic algorithm
- infinite horizon
- markov decision process
- computational complexity
- reinforcement learning
- markov decision processes
- exact solution
- sat problem
- partially observable
- optimal policy