A model for reasoning about persistence and causation
Computational Intelligence
Online minimization of transition systems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Modeling a dynamic and uncertain world I: symbolic and probabilistic reasoning about change
Artificial Intelligence
Automatically generating abstractions for planning
Artificial Intelligence
Abstraction and approximate decision-theoretic planning
Artificial Intelligence
Neuro-Dynamic Programming
The Frame Problem and Bayesian Network Action Representation
AI '96 Proceedings of the 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Combining the Expressivity of UCPOP with the Efficiency of Graphplan
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Exploiting structure in policy construction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Decomposition techniques for planning in stochastic domains
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Planning with deadlines in stochastic domains
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Model minimization in Markov decision processes
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Correlated action effects in decision theoretic regression
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Value iteration working with belief subset
Eighteenth national conference on Artificial intelligence
Symbolic heuristic search for factored Markov decision processes
Eighteenth national conference on Artificial intelligence
Heuristic search value iteration for POMDPs
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
FICSR: feedback-based inconsistency resolution and query processing on misaligned data sources
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Sequential Monte Carlo in reachability heuristics for probabilistic planning
Artificial Intelligence
The VLDB Journal — The International Journal on Very Large Data Bases
On reachability, relevance, and resolution in the planning as satisfiability approach
Journal of Artificial Intelligence Research
Restricted value iteration: theory and algorithms
Journal of Artificial Intelligence Research
Reachability, relevance, resolution and the planning as satisfiability approach
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
An overview of planning under uncertainty
Artificial intelligence today
Hi-index | 0.00 |
Recent research in decision theoretic planning has focussed on making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structured reachability analysis of MDPs that are suitable when an initial state (or set of states) is known. Usin compact, structured representations of MDPs (e.g., Bayesian networks), our methods, which vary in the tradeoff between complexity and accurac roduce structured descriptions of (estimated) reacpagle states that can be used to eliminate variables oy variable values from the problem description, reducing the size of the MDP and making it easier to solve. One contribution of our work is the extension of ideas from GRAPHPLAN to deal with the distributed nature of action reoresentations typically embodied within Bayes nets and the problem of correlated action effects. We also demonstrate that our algorithm can be made more complete by using k-ary constraints instead of binary constraints. Another contribution is the illustration of how the compact representation of reachability constraints can be exploited by several existing (exact and approximate) abstraction algorithms for MDPs.