When does relaxation reduce the minimum cost of an optimal control problem?
Michele PalladinoRichard B. VinterPublished in: CDC (2013)
Keyphrases
- optimal control
- minimum cost
- np hard
- control problems
- approximation algorithms
- network flow problem
- dynamic programming
- spanning tree
- network flow
- control strategy
- feedback control
- optimal control problems
- infinite horizon
- class of nonlinear systems
- reinforcement learning
- capacity constraints
- network simplex algorithm
- minimum cost flow
- stochastic control
- special case
- mathematical model
- computational complexity