Pages that link to "Item:Q1066821"
From MaRDI portal
The following pages link to Generalized polynomial approximations in Markovian decision processes (Q1066821):
Displayed 14 items.
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (Q648368) (← links)
- Practical solution techniques for first-order MDPs (Q835833) (← links)
- Symmetric approximate linear programming for factored MDPs with application to constrained problems (Q870814) (← links)
- Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path (Q1009248) (← links)
- A methodology for computation reduction for specially structured large scale Markov decision problems (Q1092822) (← links)
- Optimal recovery strategies for manufacturing systems (Q1129927) (← links)
- Feature-based methods for large scale dynamic programming (Q1911341) (← links)
- State partitioning based linear program for stochastic dynamic programs: an invariance property (Q1939695) (← links)
- Hybrid least-squares algorithms for approximate policy evaluation (Q1959511) (← links)
- A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications (Q2887630) (← links)
- Approximate dynamic programming with state aggregation applied to UAV perimeter patrol (Q2903989) (← links)
- Performance bounds and suboptimal policies for linear stochastic control via LMIs (Q3098498) (← links)
- Value function approximation via linear programming for FMS scheduling (Q5750698) (← links)
- The actor-critic algorithm as multi-time-scale stochastic approximation. (Q5955801) (← links)