Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"Value function approximation"”.

  1. Sparse Value Function Approximation for Reinforcement Learning

    … reinforcement learning (RL) algorithms is the approximation of the value function. The design and selection of features for approximation in RL is crucial, and an ongoing area of research. One approach to the problem of feature selection is to apply sparsity-inducing techniques in learning the …

    duke Repository record for Sparse Value Function Approximation for Reinforcement Learning (opens in a new tab)

  2. Value function approximation architectures for neuro-dynamic programming

    … only within a prescribed finite-dimensional function class. Thus, the question that always arises is how should the function class be chosen? In this dissertation, we first propose an approach using the solutions to associated fluid and diffusion approximations. In order to evaluate this …

    uiuc Repository record for Value function approximation architectures for neuro-dynamic programming (opens in a new tab)

  3. Learning and value function approximation in complex decision processes

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.

    mit Repository record for Learning and value function approximation in complex decision processes (opens in a new tab)

  4. Electric Vehicle Fleet Charging Management

    … to replace the charging decisions' expected value. It employs a value function approximation, enabling rapid charging solutions, even for large fleets, with competitive costs and service levels. Lastly, the dissertation examines a decision support system (DSS) integrating optimal stopping …

    alabama Repository record for Electric Vehicle Fleet Charging Management (opens in a new tab)

  5. Dynamic Programming Decomposition Methods For Capacity Allocation And Network Revenue Management Problems

    … dynamic program. We show that the proposed approximations have two important characteristics: First, they provide relatively tight performance bounds on the optimal value of the stochastic optimization problem under consideration. Second, they give rise to policies that on average perform …

    cornell Repository record for Dynamic Programming Decomposition Methods For Capacity Allocation And Network Revenue Management Problems (opens in a new tab)

  6. Approximate dynamic programming for large scale systems

    … can be cast as dynamic programs and the optimal value function can be computed by solving Bellman's equation. However, this approach is limited in its applicability. As the number of state variables increases, the state space size grows exponentially, a phenomenon known as the curse of …

    columbia-diss Repository record for Approximate dynamic programming for large scale systems (opens in a new tab)

  7. Active Suppression ofAerofoil Flutter via Neural-Network-Based Adaptive Nonlinear Optimal Control

    … follow. Secondly, a Modified form of NN-based Value Function Approximation (MVFA), tuned by gradient-descent learning, is proposed for NOCOS to address the closedloop stability in a compact controller configuration suitable for real-time implementation. Its validity and efficacy are examined by …

    adelaide Repository record for Active Suppression ofAerofoil Flutter via Neural-Network-Based Adaptive Nonlinear Optimal Control (opens in a new tab)