Adaptive aggregation methods for infinite horizon dynamic programming
From MaRDI portal
Recommendations
Cited in
(27)- Auction algorithms for network flow problems: A tutorial introduction
- Near optimization of dynamic systems by decomposition and aggregation
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
- Numerical methods for controlled and uncontrolled multiplexing and queueing systems
- Abstraction and approximate decision-theoretic planning.
- Stochastic dynamic programming with factored representations
- Bounded-parameter Markov decision processes
- Adaptive differential dynamic programming for multiobjective optimal control
- An incremental off-policy search in a model-free Markov decision process using a single sample path
- Generic rank-one corrections for value iteration in Markovian decision problems
- Feature-based methods for large scale dynamic programming
- An aggregation-based approximate dynamic programming approach for the periodic review model with random yield
- Block-scaling of value-iteration for discounted Markov renewal programming
- Replacement process decomposition for discounted Markov renewal programming
- Approximate dynamic programming with state aggregation applied to UAV perimeter patrol
- Agent's actions as a classification criteria for the state space in a learning from rewards system
- Stabilizing policy improvement for large-scale infinite-horizon dynamic programming
- What you should know about approximate dynamic programming
- Adaptive aggregation for reinforcement learning in average reward Markov decision processes
- Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations
- scientific article; zbMATH DE number 2050965 (Why is no real title available?)
- Multilevel preconditioners for temporal-difference learning methods related to recommendation engines
- Infinite Horizon Average Cost Dynamic Programming Subject to Total Variation Distance Ambiguity
- Approximate dynamic programming via iterated Bellman inequalities
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes
- Learning collusive strategies with function approximation algorithms
- Solving factored MDPs using non-homogeneous partitions
This page was built for publication: Adaptive aggregation methods for infinite horizon dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3830830)
