Seeking to reduce the potential impact of delays on radiation therapy cancer patients such as psychological distress, deterioration in quality of life and decreased cancer control and survival, and motivated by ineffi...
详细信息
Seeking to reduce the potential impact of delays on radiation therapy cancer patients such as psychological distress, deterioration in quality of life and decreased cancer control and survival, and motivated by inefficiencies in the use of expensive resources, we undertook a study of scheduling practices at the British Columbia Cancer Agency (BCCA). As a result, we formulated and solved a discounted infinite-horizon Markov decision process for scheduling cancer treatments in radiation therapy units. The main purpose of this model is to identify good policies for allocating available treatment capacity to incoming demand, while reducing wait times in a cost-effective manner. We use an affine architecture to approximate the value function in our formulation and solve an equivalent linear programming model through column generation to obtain an approximate optimal policy for this problem. The benefits from the proposed method are evaluated by simulating its performance for a practical example based on data provided by the BCCA. (C) 2012 Elsevier B.V. All rights reserved.
We provide a practical methodology for solving the generalized joint replenishment (GJR) problem, based on a mathematical programming approach to approximate dynamic programming. We show how to automatically generate ...
详细信息
We provide a practical methodology for solving the generalized joint replenishment (GJR) problem, based on a mathematical programming approach to approximate dynamic programming. We show how to automatically generate a value function approximation basis built upon piecewise-linear ridge functions by developing and exploiting a theoretical connection with the problem of finding optimal cyclic schedules. We provide a variant of the algorithm that is effective in practice, and we exploit the special structure of the GJR problem to provide a coherent, implementable framework.
A common approximate dynamic programming method entails state partitioning and the use of linear programming, i.e., the state-space is partitioned and the optimal value function is approximated by a constant over each...
详细信息
A common approximate dynamic programming method entails state partitioning and the use of linear programming, i.e., the state-space is partitioned and the optimal value function is approximated by a constant over each partition. By minimizing a positive cost function defined on the partitions, one can construct an upper bound for the optimal value function. We show that this approximate value function is independent of the positive cost function and that it is the least upper bound, given the partitions. (C) 2012 Elsevier B.V. All rights reserved.
Satisficing is an efficient strategy for applying existing knowledge in a complex, constrained, environment. We present a set of agent-based simulations that demonstrate a higher payoff for satisficing strategies than...
详细信息
ISBN:
(纸本)9781467327435;9781467327428
Satisficing is an efficient strategy for applying existing knowledge in a complex, constrained, environment. We present a set of agent-based simulations that demonstrate a higher payoff for satisficing strategies than for exploring strategies when using approximate dynamic programming methods for learning complex environments. In our constrained learning environment, satisficing agents outperformed exploring agent by approximately six percent, in terms of the number of tasks completed.
This paper introduces a new concept called a Virtual Generator (VG). VGs are simplified representations of groups of coherent synchronous generators in a power system. They resemble commonly used power system dynamic ...
详细信息
ISBN:
(纸本)9781467327299
This paper introduces a new concept called a Virtual Generator (VG). VGs are simplified representations of groups of coherent synchronous generators in a power system. They resemble commonly used power system dynamic equivalents obtained via generator aggregation techniques. Traditionally power system dynamic equivalents are developed offline, fixed, and used to replace large portions of the system that are considered external to the portion of the system being analyzed in detail. In contrast, VGs are calculated online, are not limited to representing external areas of the system being analyzed/controlled, and do not replace any portion of the power system. Instead, they allow wide-area damping controllers (WADCs) to exploit the realization that a group of coherent synchronous generators in a power system can be controlled as a single generating unit for achieving wide-area damping control objectives. The implementation of VGs is made possible by the availability of Wide-Area Measurements (WAMs) from Phasor Measurement Units (PMUs). To the authors' knowledge, this is the first time that the use of power system equivalencing techniques has been extended to real-time WADC. Simulation studies carried out on the 68-bus New England/New York power system demonstrate that intelligent controllers developed using VGs can significantly improve the stability of a power system by effectively damping low-frequency interarea oscillations.
The adaptive dynamicprogramming (ADP) approach is employed to design an optimal controller for unknown discrete-time nonlinear systems with control constraints. First, a neural network is constructed to identify the ...
详细信息
ISBN:
(纸本)9789881563811
The adaptive dynamicprogramming (ADP) approach is employed to design an optimal controller for unknown discrete-time nonlinear systems with control constraints. First, a neural network is constructed to identify the unknown dynamical system with stability proof. Then, the iterative ADP algorithm is developed to solve the optimal control problem with convergence analysis. Moreover, two other neural networks are introduced to approximate the cost function and its derivative and the control law, under the framework of globalized dual heuristic programming technique. Finally, two simulation examples are included to verify the theoretical results.
Uncertainty on arrival and departure times makes the scheduling of plug-in hybrid electric vehicles an intrinsically stochastic optimization problem. To take the stochastic nature of this problem into consideration, a...
详细信息
ISBN:
(纸本)9781467325950;9781467325967
Uncertainty on arrival and departure times makes the scheduling of plug-in hybrid electric vehicles an intrinsically stochastic optimization problem. To take the stochastic nature of this problem into consideration, a scalable stochastic optimization strategy has been formulated. Generally, stochastic programming methods are computationally demanding and become impractical for large-scale problems. This work reduced the dimensionality of the scheduling problem with techniques from approximate dynamic programming. To illustrate the advantage of the stochastic algorithm a deterministic method has been formulated. Compared to the deterministic method, the proposed stochastic method can help an aggregator to reduce its expensive peak charging or avoid penalties for not fully charging the batteries of its clients.
In this paper, we propose a novel adaptive dynamicprogramming (ADP) scheme based on general value iteration to obtain near optimal control for discrete-time nonlinear systems with continuous state and control space. ...
详细信息
ISBN:
(纸本)9789881563811
In this paper, we propose a novel adaptive dynamicprogramming (ADP) scheme based on general value iteration to obtain near optimal control for discrete-time nonlinear systems with continuous state and control space. First, the selection of initial value function is different from the traditional value iteration, and a new method is introduced to demonstrate the convergence property and convergence speed of the value function. Then, the control law obtained at each iteration can stabilize the system under some conditions. At last, three neural networks with Levenberg-Marquardt training algorithm are used to approximate the unknown nonlinear system, the value function and the optimal control law. One simulation example is presented to demonstrate the effectiveness of the present scheme.
In this paper, a new optimal control method is proposed for discrete-time nonlinear systems based on iterative adaptive dynamicprogramming (ADP) algorithm with approximation error. In each iteration of the proposed a...
详细信息
ISBN:
(纸本)9781467313988
In this paper, a new optimal control method is proposed for discrete-time nonlinear systems based on iterative adaptive dynamicprogramming (ADP) algorithm with approximation error. In each iteration of the proposed algorithm, the iterative control law and iterative performance index function cannot be accurately obtained. The convergence conditions of the iterative ADP algorithm are presented. According to the convergence conditions, the iterative performance index functions are proved to be convergent to a small neighborhood of the optimal performance index function. Finally, a simulation example is given to illustrate the performance of the proposed method.
A neural-network-based finite-horizon optimal tracking control scheme for a class of unknown nonlinear discrete-time systems is developed. First, the tracking control problem is converted into designing a regulator fo...
详细信息
ISBN:
(纸本)9781467313988
A neural-network-based finite-horizon optimal tracking control scheme for a class of unknown nonlinear discrete-time systems is developed. First, the tracking control problem is converted into designing a regulator for the tracking error dynamics under the framework of finite-horizon optimal control theory. Then, with convergence analysis in terms of cost function and control law, the iterative adaptive dynamicprogramming algorithm is introduced to obtain the finite-horizon optimal controller to make the cost function close to its optimal value within an g-error bound. Furthermore, in order to implement the algorithm via dual heuristic dynamicprogramming technique, three neural networks are employed to approximate the error dynamics, the cost function, and the control law, respectively. In addition, a numerical example is given to demonstrate the validity of the present approach.
暂无评论