Singular control

1

In optimal control, problems of singular control are problems that are difficult to solve because a straightforward application of Pontryagin's minimum principle fails to yield a complete solution. Only a few such problems have been solved, such as Merton's portfolio problem in financial economics or trajectory optimization in aeronautics. A more technical explanation follows. The most common difficulty in applying Pontryagin's principle arises when the Hamiltonian depends linearly on the control u, i.e., is of the form: and the control is restricted to being between an upper and a lower bound:. To minimize H(u), we need to make u as big or as small as possible, depending on the sign of, specifically: If \phi is positive at some times, negative at others and is only zero instantaneously, then the solution is straightforward and is a bang-bang control that switches from b to a at times when \phi switches from negative to positive. The case when \phi remains at zero for a finite length of time is called the singular control case. Between t_1 and t_2 the maximization of the Hamiltonian with respect to u gives us no useful information and the solution in that time interval is going to have to be found from other considerations. One approach is to repeatedly differentiate with respect to time until the control u again explicitly appears, though this is not guaranteed to happen eventually. One can then set that expression to zero and solve for u. This amounts to saying that between t_1 and t_2 the control u is determined by the requirement that the singularity condition continues to hold. The resulting so-called singular arc, if it is optimal, will satisfy the Kelley condition: Others refer to this condition as the generalized Legendre–Clebsch condition. The term bang-singular control refers to a control that has a bang-bang portion as well as a singular portion.

This article is derived from Wikipedia and licensed under CC BY-SA 4.0. View the original article.

Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc.
Bliptext is not affiliated with or endorsed by Wikipedia or the Wikimedia Foundation.

Edit article