Publication:4256521
From MaRDI portal
zbMath0918.68110MaRDI QIDQ4256521
Craig Boutilier, Steve Hanks, T. Dean
Publication date: 18 July 1999
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Ranking policies in discrete Markov decision processes, On the undecidability of probabilistic planning and related stochastic optimization problems, Weak, strong, and strong cyclic planning via symbolic model checking, Contingent planning under uncertainty via stochastic satisfiability, Equivalence notions and model minimization in Markov decision processes, Solving factored MDPs using non-homogeneous partitions, Anytime heuristic search for partial satisfaction planning, Task decomposition on abstract states, for planning under nondeterminism, Practical solution techniques for first-order MDPs, Quantum physical symbol systems, Partially observable Markov decision processes with imprecise parameters, Abstraction and approximate decision-theoretic planning., Stochastic dynamic programming with factored representations, Bounded-parameter Markov decision processes, How to decide what to do?, Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains, Computer science and decision theory, Scheduling with timed automata, Strong planning under uncertainty in domains with numerous but identical elements (a generic approach), Graphical models for imprecise probabilities, Complexity results and algorithms for possibilistic influence diagrams, Strong planning under partial observability, Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework, Influence of modeling structure in probabilistic sequential decision problems, What you should know about approximate dynamic programming, Probabilistic Reasoning by SAT Solvers
Uses Software
