.png){kind=icon}
.png){kind=icon}
Return
Separable dynamic programming and approximate decomposition methods
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2007.895901.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider control, planning, and resource allocation problems involving several independent subsystems that are coupled through a control/decision constraint. We discuss one-step lookahead methods that use an approximate cost-to-go function derived from the solution of single subsystem problems. We propose a new method for constructing such approximations, and derive bounds on the performance of the associated suboptimal policies. We then specialize this method to problems of reachability of target tubes that have the form of a box (a Cartesian product of subsystem tubes). We thus obtain inner approximating tubes, which are the union of a finite number of boxes, each involving single subsystem calculations.
Keywords:
dynamic programming
optical control
reachability
separable problems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
No organization information available