scientific article; zbMATH DE number 1315585
From MaRDI portal
Publication:4256521
zbMath0918.68110MaRDI QIDQ4256521
T. Dean, Craig Boutilier, Steve Hanks
Publication date: 18 July 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
Scheduling with timed automata ⋮ How to decide what to do? ⋮ Anytime heuristic search for partial satisfaction planning ⋮ Task decomposition on abstract states, for planning under nondeterminism ⋮ Practical solution techniques for first-order MDPs ⋮ Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm ⋮ Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) ⋮ Optimal speech motor control and token-to-token variability: a Bayesian modeling approach ⋮ Design and evaluation of norm-aware agents based on normative Markov decision processes ⋮ Graphical models for imprecise probabilities ⋮ Quantum physical symbol systems ⋮ Complexity results and algorithms for possibilistic influence diagrams ⋮ Computational Benefits of Intermediate Rewards for Goal-Reaching Policy Learning ⋮ Open problems in universal induction \& intelligence ⋮ Efficient incremental planning and learning with multi-valued decision diagrams ⋮ Quantitative controller synthesis for consumption Markov decision processes ⋮ Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA ⋮ Ranking policies in discrete Markov decision processes ⋮ Abstraction and approximate decision-theoretic planning. ⋮ Knows what it knows: a framework for self-aware learning ⋮ Affect control processes: intelligent affective interaction using a partially observable Markov decision process ⋮ Real-time dynamic programming for Markov decision processes with imprecise probabilities ⋮ Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems ⋮ Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results ⋮ Efficient solutions to factored MDPs with imprecise transition probabilities ⋮ Computing rank dependent utility in graphical models for sequential decision problems ⋮ Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains ⋮ Using mathematical programming to solve factored Markov decision processes with imprecise probabilities ⋮ Risk-sensitive multiagent decision-theoretic planning based on MDP and one-switch utility functions ⋮ Using Machine Learning for Decreasing State Uncertainty in Planning ⋮ Strong planning under partial observability ⋮ Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework ⋮ Causal learning with Occam's razor ⋮ Computer science and decision theory ⋮ Recursively modeling other agents for decision making: a research perspective ⋮ What you should know about approximate dynamic programming ⋮ Probabilistic Reasoning by SAT Solvers ⋮ Partially observable Markov decision processes with imprecise parameters ⋮ Influence of modeling structure in probabilistic sequential decision problems ⋮ Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models ⋮ Stochastic dynamic programming with factored representations ⋮ Bounded-parameter Markov decision processes ⋮ A Sufficient Statistic for Influence in Structured Multiagent Environments ⋮ 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
Uses Software
This page was built for publication:
