SIAM Journal on Control and Optimization · 1995 · 34 citations · 4 references
Natural SciencesMathematicsDynamical SystemsOptimizationStochastic ProcessesControl TheoryConvex OptimizationOptimal ControlRelaxation MethodsRobust ControlStochastic ControlConstrained ControlConvex RelaxationsOptimal Control FormulationOptimal Control Of Stochastic SystemsOptimal Control TrajectoriesRelaxation Theory
The relaxation of the optimal control problem with cost functional which is the supremum in time of some function $h(t,x,z)$ is determined. The trajectory is convexified in the usual way but the cost functional is convexified in a nonobvious manner. Thus, if the original value function is $V(t,x) = \inf _{\zeta \in \mathcal{Z}} \| {h(s,\xi (s),\zeta (s))} \|_{L_\infty [t,T]} $, then the relaxed value function is \[\hat V(t,x) = \mathop {\inf }\limits_{\mu \in \mathcal{Z}[t,T]} \left\| {\left\| {h(s,\hat \xi (s),z)} \right\|_{L^\infty (Z;\mu (s))} } \right\|_{L^\infty [t,T]}\] where the inner norm is the essential sup of h over $z \in Z$ with respect to the measure $\mu (s)$. We prove that V and $\hat V$ coincide.
4
Foundations of optimal control theory
Henry Hermes · IEEE Transactions on Automatic Control · 1968 · 1.7K citations
The Bellman equation for minimizing the maximum cost
E. N. Barron, Hitoshi Ishii · Nonlinear Analysis · 1989 · 162 citations