Necessary and sufficient condition for the principle of optimality in deterministic MSOPs

Consider sets XtsubseteqRn×TX_t subseteq\mathbb{R}^{n\times T} for 0tT0\leq t\leq T, a control set URmU\subseteq\mathbb{R}^m, and cost functions

Jt:UTt×s=tTXsR.J_t:U^{T-t}\times\prod_{s=t}^{T}X_s\to\mathbb{R}.

Let F\mathcal{F} denote the set of pairs (f,x0)(f,x_0) such that x0X0x_0\in X_0 and the associated multistage optimal control problems have a unique solution when initialized at (x0,0)(x_0,0). Principle-of-optimality conjecture. For every (f,x0)F(f,x_0)\in\mathcal{F}, the family of multistage optimal control problems associated with {Jt,f,{Xt}tsT,U,T}t=0T\{J_t,f,\{X_t\}_{t\leq s\leq T},U,T\}_{t=0}^{T} satisfies the Principle of Optimality at x0x_0 if and only if JtJ_t is monotonically backward separable. The conjecture proposes a necessary and sufficient characterization of the Principle of Optimality for deterministic multistage optimal control problems with unique solutions; the preceding result establishes necessity under the stated assumptions, while sufficiency is the remaining direction.

Sources & referencesView supporting material

Primary source

Morgan Jones and Matthew Peet, “A Generalization of Bellman's Equation with Application to Path Planning, Obstacle Avoidance and Invariant Set Estimation”, arXiv:2006.08175 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.