A numerical algorithm for singular optimal LQ control systems

From MaRDI portal



Abstract: A numerical algorithm to obtain the consistent conditions satisfied by singular arcs for singular linear-quadratic optimal control problems is presented. The algorithm is based on the presymplectic constraint algorithm (PCA) by Gotay-Nester cite{Go78,Vo99} that allows to solve presymplectic hamiltonian systems and that provides a geometrical framework to the Dirac-Bergmann theory of constraints for singular Lagrangian systems cite{Di49}. The numerical implementation of the algorithm is based on the singular value decomposition that, on each step allows to construct a semi-explicit system. Several examples and experiments are discussed, among them a family of arbitrary large singular LQ systems with index 3 and a family of examples of arbitrary large index, all of them exhibiting stable behaviour.


A numerical algorithm is developed for singular linear-quadratic(LQ) optimal control problems. The algorithm is based on the presymplectic constrained algorithm(PCA) of \textit{M. J. Gotay, J. M. Nester} and \textit{G. Hinds} [J. Math. Phys. 19, 2388--2399 (1978; Zbl 0418.58010)]. The linear differential-algebraic equation obtained from the singular LQ systems has a presymplectic form. Because the PCA preserves the structure of the system, it leads to consistent states and co-states. In the numerical implementation, at each iteration step a semi-explicit system is constructed which results from singular value decomposition. Numerical results for small LQ systems of arbitrary dimension and large index problems demonstrate the stable behavior of the algorithm.











This page was built for publication: A numerical algorithm for singular optimal LQ control systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834655)