Optimal control problems where the control variable appears linearly in the formulation lead to singular control arcs that introduce analytical and numerical complications during the solution process. In this work, the switching behavior (switching between singular and nonsingular control arcs) is exploited to solve singular optimal control problems using a direct method. The problem is reformulated as a switched system optimal control problem where each control arc defines a different subsystem, i.e., lower and upper limits and a singular arc. The switching between control arcs is handled using binary functions that depend on time. The switched system is embedded into a larger family by relaxing the binary functions to avoid integer variables. The variable switching times at which the control switches between arcs are mapped to fixed points in a new time domain using a time-scaling transformation. A direct transcription method along with control parametrization is applied to transform the embedded problem into a nonlinear programming formulation that contains few variables and constraints. A penalty term is introduced to obtain binary solutions for the optimal selection of control arcs. The proposed reformulation avoids the use of mesh refinement techniques and continuation methods, and allows to solve challenging problems in very short CPU times with high accuracy.
Read full abstract