Pages that link to "Item:Q2887629"

The following pages link to Approximate policy iteration: a survey and some new methods (Q2887629):

Displaying 37 items.

• Potential-based least-squares policy iteration for a parameterized feedback control system (Q289143) (← links)
• Value iteration and adaptive dynamic programming for data-driven adaptive optimal control design (Q313259) (← links)
• New approximate dynamic programming algorithms for large-scale undiscounted Markov decision processes and their application to optimize a production and distribution system (Q320866) (← links)
• Approximate dynamic programming for the dispatch of military medical evacuation assets (Q323422) (← links)
• A perturbation approach to a class of discounted approximate value iteration algorithms with Borel spaces (Q330284) (← links)
• Perspectives of approximate dynamic programming (Q333093) (← links)
• Robust adaptive dynamic programming for linear and nonlinear systems: an overview (Q397504) (← links)
• Temporal difference-based policy iteration for optimal control of stochastic systems (Q467477) (← links)
• Proximal algorithms and temporal difference methods for solving fixed point problems (Q721950) (← links)
• Approximate dynamic programming for missile defense interceptor fire control (Q1751900) (← links)
• Bias-policy iteration based adaptive dynamic programming for unknown continuous-time linear systems (Q2063829) (← links)
• Convex optimization with an interpolation-based projection and its application to deep learning (Q2071365) (← links)
• Human motor learning is robust to control-dependent noise (Q2165361) (← links)
• Approximate dynamic programming for the military inventory routing problem (Q2173135) (← links)
• Improved value iteration for neural-network-based stochastic optimal control design (Q2185716) (← links)
• Tracking control optimization scheme for a class of partially unknown fuzzy systems by using integral reinforcement learning architecture (Q2279428) (← links)
• Incremental constraint projection methods for variational inequalities (Q2340334) (← links)
• A partial history of the early development of continuous-time nonlinear stochastic systems theory (Q2628408) (← links)
• An Approximate Dynamic Programming Algorithm for Monotone Value Functions (Q2797467) (← links)
• Empirical Dynamic Programming (Q2806811) (← links)
• Discrete-time dynamic graphical games: model-free reinforcement learning solution (Q3196115) (← links)
• (Q4999027) (← links)
• Robust Reinforcement Learning for Stochastic Linear Quadratic Control with Multiplicative Noise (Q5018404) (← links)
• Allocating resources via price management systems: a dynamic programming-based approach (Q5018825) (← links)
• Undiscounted control policy generation for continuous-valued optimal control by approximate dynamic programming (Q5043547) (← links)
• Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation (Q5097022) (← links)
• On the Taylor Expansion of Value Functions (Q5131481) (← links)
• A Machine Learning Approach to Adaptive Robust Utility Maximization and Hedging (Q5162848) (← links)
• (Q5168862) (← links)
• A perturbation approach to approximate value iteration for average cost Markov decision processes with Borel spaces and bounded costs (Q5227201) (← links)
• Time-varying Markov decision processes with state-action-dependent discount factors and unbounded costs (Q5227206) (← links)
• Multiply Accelerated Value Iteration for NonSymmetric Affine Fixed Point Problems and Application to Markov Decision Processes (Q5862806) (← links)
• Approximative Policy Iteration for Exit Time Feedback Control Problems Driven by Stochastic Differential Equations using Tensor Train Format (Q5865245) (← links)
• <i>H</i>_<i>∞</i> optimal control of unknown linear systems by adaptive dynamic programming with applications to time‐delay systems (Q6060452) (← links)
• Smoothing policies and safe policy gradients (Q6097096) (← links)
• Data-driven optimal control via linear transfer operators: a convex approach (Q6157809) (← links)
• Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects (Q6566615) (← links)