Time-axis decomposition of large-scale optimal control problems
Continuous-time optimal control problems can rarely be solved directly but have to be approximated with discrete analogues. Shorter time steps lead to more accurate approximations, but result in formulations that are often too big for computer memory. This paper presents a technique for decomposing the problem along the time axis and iterating toward a solution in a leader-follower framework. In the model, the leader controls a set of coordination parameters, which he passes to the followers, who then solve their individual subproblems. State and sensitivity information is returned to the leader, who attempts to minimize an unconstrained problem in the coordination space. Parameters are updated and the process continues until improvement ceases. Two advantages of this technique are that feasible solutions to the original problem are available at each iteration and that the optimal coordination parameters obtained provide some measure of feedback control. Computational results are presented for a comprehensive set of test problems.
- Mixed coordination method for long-horizon optimal control problems
- A decomposition technique for discrete time optimal control problems with an application to water resources management
- Large-scale convex optimal control problems: time decomposition, incentive coordination, and parallel algorithm
- Decomposition algorithm of dynamic programming for large-scale time-delay systems
- Optimal control of a class of discrete-continuous nonlinear systems -- decomposition and hierarchical structure
- A decomposition technique for discrete time optimal control problems with an application to water resources management
- An Optimal control approach to marketing-production planning
- Closed-loop Stackelberg solution to a multistage linear-quadratic game
- Experiments with successive quadratic programming algorithms
- scientific article; zbMATH DE number 3819432 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3780047 (Why is no real title available?)
- On the continuity of the minimum set of a continuous function
- Quadratic incentive coordination for non-convex optimal control problems Part 1. Theory
- Sensitivity analysis for nonlinear programming using penalty methods
- Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
- Spatial and time decomposition algorithms for dynamic nonlinear network optimization using duality
- The art and theory of dynamic programming
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Time-domain decomposition for mixed-integer optimal control problems
- SMART: A stochastic multiscale model for the analysis of energy resources, technology, and policy
- scientific article; zbMATH DE number 3846332 (Why is no real title available?)
- Mixed coordination method for long-horizon optimal control problems
- Large-scale convex optimal control problems: time decomposition, incentive coordination, and parallel algorithm
- scientific article; zbMATH DE number 5729117 (Why is no real title available?)
- scientific article; zbMATH DE number 3927776 (Why is no real title available?)
- Decomposition algorithm of dynamic programming for large-scale time-delay systems
- scientific article; zbMATH DE number 4095288 (Why is no real title available?)
- Exponentially accurate temporal decomposition for long-horizon linear-quadratic dynamic optimization
- scientific article; zbMATH DE number 853765 (Why is no real title available?)
- Timescale Separation in Autonomous Optimization
- A decomposition technique for discrete time optimal control problems with an application to water resources management
This page was built for publication: Time-axis decomposition of large-scale optimal control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911044)
