Pages that link to "Item:Q1583230"
From MaRDI portal
The following pages link to Stochastic dynamic programming with factored representations (Q1583230):
Displaying 39 items.
- Decision-theoretic planning with generalized first-order decision diagrams (Q420812) (← links)
- A framework and a mean-field algorithm for the local control of spatial processes (Q433494) (← links)
- Efficient solutions to factored MDPs with imprecise transition probabilities (Q646498) (← links)
- Embedding a state space model into a Markov decision process (Q666503) (← links)
- Equivalence notions and model minimization in Markov decision processes (Q814474) (← links)
- Solving factored MDPs using non-homogeneous partitions (Q814475) (← links)
- Constraint solving in uncertain and dynamic environments: A survey (Q816686) (← links)
- The factored policy-gradient planner (Q835832) (← links)
- Symmetric approximate linear programming for factored MDPs with application to constrained problems (Q870814) (← links)
- Algebraic decompositions of DP problems with linear dynamics (Q888809) (← links)
- Efficient approximate linear programming for factored MDPs (Q899136) (← links)
- Real-time dynamic programming for Markov decision processes with imprecise probabilities (Q901046) (← links)
- A POMDP framework for coordinated guidance of autonomous UAVs for multitarget tracking (Q965333) (← links)
- Abstraction and approximate decision-theoretic planning. (Q1399130) (← links)
- Recursive estimation of high-order Markov chains: approximation by finite mixtures (Q1750411) (← links)
- Discovering hidden structure in factored MDPs (Q1761300) (← links)
- Efficient algorithms for risk-sensitive Markov decision processes with limited budget (Q2060792) (← links)
- An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes (Q2238620) (← links)
- Complexity results and algorithms for possibilistic influence diagrams (Q2389644) (← links)
- Scalable transfer learning in heterogeneous, dynamic environments (Q2407414) (← links)
- Efficient incremental planning and learning with multi-valued decision diagrams (Q2407480) (← links)
- Analysis of customer lifetime value and marketing expenditure decisions through a Markovian-based model (Q2514831) (← links)
- Learning classifier systems: a survey (Q2642997) (← links)
- Rethinking formal models of partially observable multiagent decision making (Q2667825) (← links)
- Action failure recovery via model-based diagnosis and conformant planning (Q2857292) (← links)
- Policy iteration based on stochastic factorization (Q2878742) (← links)
- Proximity-based non-uniform abstractions for approximate planning (Q2887083) (← links)
- Probabilistic Relational Planning with First Order Decision Diagrams (Q3009013) (← links)
- (Q3360682) (← links)
- Influence of modeling structure in probabilistic sequential decision problems (Q3411302) (← links)
- Agent's actions as a classification criteria for the state space in a learning from rewards system (Q3543672) (← links)
- Automatic Induction of Bellman-Error Features for Probabilistic Planning (Q3588643) (← links)
- Intensional dynamic programming. A Rosetta stone for structured dynamic programming (Q3651639) (← links)
- (Q4434179) (← links)
- Computational Benefits of Intermediate Rewards for Goal-Reaching Policy Learning (Q5076329) (← links)
- A Sufficient Statistic for Influence in Structured Multiagent Environments (Q5856481) (← links)
- A Verified Compositional Algorithm for AI Planning (Q5875407) (← links)
- Reinforcement learning (Q6602227) (← links)
- Planning in artificial intelligence (Q6602257) (← links)
