Stochastic dynamic programming with factored representations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 4061056 (Why is no real title available?)
- scientific article; zbMATH DE number 3769296 (Why is no real title available?)
- scientific article; zbMATH DE number 67800 (Why is no real title available?)
- scientific article; zbMATH DE number 1315585 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1560499 (Why is no real title available?)
- scientific article; zbMATH DE number 1753139 (Why is no real title available?)
- scientific article; zbMATH DE number 3248552 (Why is no real title available?)
- scientific article; zbMATH DE number 3359806 (Why is no real title available?)
- A survey of algorithmic methods for partially observed Markov decision processes
- Abstraction and approximate decision-theoretic planning.
- Adaptive aggregation methods for infinite horizon dynamic programming
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Constructing optimal binary decision trees is NP-complete
- Dynamic programming and influence diagrams
- Feature-based methods for large scale dynamic programming
- Graph-Based Algorithms for Boolean Function Manipulation
- Guarded commands, nondeterminacy and formal derivation of programs
- Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes
- Modeling a dynamic and uncertain world. I: Symbolic and probabilistic reasoning about change
- Modified Policy Iteration Algorithms for Discounted Markov Decision Problems
- Planning for conjunctive goals
- Probabilistic Horn abduction and Bayesian networks
- STRIPS: A new approach to the application of theorem proving to problem solving
- Symbolic model checking: \(10^{20}\) states and beyond
- The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
- The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
- The independent choice logic for modelling multiple agents under uncertainty
- The role of relevance in explanation. I: Irrelevance as statistical independence
- Trading accuracy for simplicity in decision trees
- Transfer of learning by composing solutions of elemental sequential tasks
- \({\mathcal Q}\)-learning
Cited in
(48)- Equivalence notions and model minimization in Markov decision processes
- Complexity results and algorithms for possibilistic influence diagrams
- Efficient algorithms for risk-sensitive Markov decision processes with limited budget
- scientific article; zbMATH DE number 1929153 (Why is no real title available?)
- scientific article; zbMATH DE number 2000828 (Why is no real title available?)
- Agent's actions as a classification criteria for the state space in a learning from rewards system
- Influence of modeling structure in probabilistic sequential decision problems
- Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence Diagrams
- Algebraic decompositions of DP problems with linear dynamics
- Elaboration tolerant representation of Markov decision process via decision-theoretic extension of probabilistic action language \(p\mathcal{BC}+\)
- A framework and a mean-field algorithm for the local control of spatial processes
- A POMDP framework for coordinated guidance of autonomous UAVs for multitarget tracking
- Solving factored MDPs using non-homogeneous partitions
- A sufficient statistic for influence in structured multiagent environments
- A Verified Compositional Algorithm for AI Planning
- Action failure recovery via model-based diagnosis and conformant planning
- Policy iteration based on stochastic factorization
- Intensional dynamic programming. A rosetta stone for structured dynamic programming
- Planning in artificial intelligence
- Reinforcement learning
- Decision-theoretic planning with generalized first-order decision diagrams
- Analysis of customer lifetime value and marketing expenditure decisions through a Markovian-based model
- Exploiting expert knowledge in factored POMDPs
- Representing value functions with recurrent binary decision diagrams
- Proximity-based non-uniform abstractions for approximate planning
- AI 2005: Advances in Artificial Intelligence
- Automatic induction of Bellman-error features for probabilistic planning
- Embedding a state space model into a Markov decision process
- Efficient solutions to factored MDPs with imprecise transition probabilities
- Symmetric approximate linear programming for factored MDPs with application to constrained problems
- The interaction of representations and planning objectives for decision-theoretic planning tasks
- An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes
- scientific article; zbMATH DE number 4213767 (Why is no real title available?)
- Solving factored mdps with hybrid state and action variables
- Discovering hidden structure in factored MDPs
- Reinforcement learning with factored states and actions
- Efficient approximate linear programming for factored MDPs
- Computational Benefits of Intermediate Rewards for Goal-Reaching Policy Learning
- Rethinking formal models of partially observable multiagent decision making
- Learning classifier systems: a survey
- Probabilistic relational planning with first order decision diagrams
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- Recursive estimation of high-order Markov chains: approximation by finite mixtures
- Constraint solving in uncertain and dynamic environments: A survey
- Efficient incremental planning and learning with multi-valued decision diagrams
- Scalable transfer learning in heterogeneous, dynamic environments
- Abstraction and approximate decision-theoretic planning.
- The factored policy-gradient planner
This page was built for publication: Stochastic dynamic programming with factored representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583230)
