Factored Upper Bounds for Multiagent Planning Problems under Uncertainty with Non-Factored Value Functions.
Frans Adriaan OliehoekMatthijs T. J. SpaanStefan J. WitwickiPublished in: IJCAI (2015)
Keyphrases
- planning problems
- state space
- upper bound
- fully observable
- partial observability
- multi agent
- heuristic search
- domain independent
- lower bound
- ai planning
- planning domains
- probabilistic planning
- incomplete information
- sensing actions
- reinforcement learning
- causal graph
- dynamic programming
- solving planning problems
- partially observable markov decision processes
- classical planning
- planning systems
- markov decision processes
- stochastic domains
- multi agent systems
- htn planning
- continuous state
- orders of magnitude
- dynamical systems
- planning under uncertainty
- optimal planning
- dynamic bayesian networks
- search strategies
- concurrent actions
- deterministic domains