350 search results - page 8 / 70 » Complexity of Planning with Partial Observability |
AAAI
2010
13 years 10 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
ECAI
2010
Springer
13 years 10 months ago
2010
Springer
Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some d...
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
13 years 10 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
ATAL
2006
Springer
14 years 26 days ago
2006
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
JAIR
2008
13 years 9 months ago
2008
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...