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 15 of 15 for “"approximate dynamic programming (ADP)"”.
-
An approximate dynamic programming approach to discrete optimization
We develop Approximate Dynamic Programming (ADP) methods to integer programming problems. We describe and investigate parametric, nonparametric and base-heuristic learning approaches to approximate the value function in order to break the curse of dimensionality. Through an extensive computational …
-
Projected equation and aggregation-based approximate dynamic programming methods for Tetris
In this thesis, we survey approximate dynamic programming (ADP) methods and test the methods with the game of Tetris. We focus on ADP methods where the cost-to- go function J is approximated with [phi]r, where [phi] is some matrix and r is a vector with relatively low dimension. There are two major …
-
A Study on Architecture, Algorithms, and Applications of Approximate Dynamic Programming Based Approach to Optimal Control
This thesis develops approximate dynamic programming (ADP) strategies suitable for process control problems aimed at overcoming the limitations of MPC, which are the potentially exorbitant on-line computational requirement and the inability to consider the future interplay between uncertainty and …
-
Value learning through Bellman residuals and neural function approximations in deterministic systems
… surrogates. Compared to the traditional Approximate Dynamic Programming (ADP) methods, this approach can have both advantages and disadvantages. One of the advantages of such an approach is that the underlying optimization problem can provably converge to the desired solution with better …
-
Supply chain optimization : formulations and algorithms
… network design problems. We develop mathematical programming formulations, heuristic algorithms, and enhanced algorithms using approximate dynamic programming (ADP). We achieve a strong mixed integer programming (MIP) formulation, and fast, reliable algorithms, which can be extended to problems …
-
Electric Vehicle Fleet Charging Management
… To mitigate high-dimensional nature, a novel approximate dynamic programming (ADP) policy is proposed. It incorporates a regression model to replace the charging decisions' expected value. It employs a value function approximation, enabling rapid charging solutions, even for large fleets, with …
-
Real-Time Labour Allocation in Retail Stores
… benefits for RTLA. Paper III presents a dynamic programming model that analyses RTLA decisions allocating store associates among departments (or store areas) in real time. Approximate Dynamic Programming (ADP) techniques are then employed to deal with the curse of dimensionality and …
-
Deployment Policies to Reliably Maintain and Maximize Expected Coverage in a Wireless Sensor Network
… applied to a static network, rather than a dynamic network where new sensors are deployed over time. We discuss how the D-spectrum can be incorporated to estimate reliability of a time-based deployment policy and the features that allow a wide range of deployment policies to be evaluated in …
-
Approximate dynamic programming for large scale systems
… problems. These problems 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 …
-
Approximate Dynamic Programming with Parallel Stochastic Planning Operators
This thesis presents an approximate dynamic programming (ADP) technique for environment modelling agents. The agent learns a set of parallel stochastic planning operators (P-SPOs) by evaluating changes in its environment in response to actions, using an association rule mining approach. An …
-
MASTraf: a decentralized multi-agent system for network-wide traffic signal control with dynamic coordination
… reinforcement learning (RL) - also referred as approximate dynamic programming (ADP) in some research communities. For the traffic control problem, examples of convenient RL algorithms are the off-policy Q-learning and the ADP using a post decision state variable, since they address processes …
-
Model reduction of Markov chains with applications to building systems
… The optimal control problem is simplified in an approximate dynamic programming (ADP) approach. A relaxation of the policy space is performed, and based on this a parameterization of the set of optimal policies is introduced. This makes possible a stochastic approximation approach to compute the …
-
Resource allocation and pricing under competition in shared mobility markets
… ridesharing and vehicle sharing), including: (i) dynamic pricing and resource allocation in an on-demand ridesharing market; (ii) pricing and matching in a two-sided ridesharing market under competition; (iii) optimal investment and management of dockless shared bikes in a competitive market; and …
-
Scheduling and routing of service trucks and planning of resource replenishment locations for winter roadway maintenance
… or mechanical breakdowns. A stochastic dynamic fleet management model is developed to assign available trucks to cover uncertain snow plowing demand. Some tasks, especially those on critical roadway links (such as emergency routes), often have priority and impose a strict service time …
-
Noncooperative static and dynamic games: addressing shared constraints and phase transitions
… understand phase transition in noncoop- erative dynamic games with a large number of agents. The focus of analysis is on a variation of the large population linear quadratic Gaussian (LQG) model proposed by Huang et. al. 2007 [1], comprised here of a controlled N-dimensional stochastic …