Computing the Controllability Function for Nonlinear Descriptor Systems
2006 (English)In: Proceedings of the 2006 American Control Conference, 2006, 1027-1031 p.Conference paper (Refereed)
The computation of the controllability function for nonlinear descriptor systems is considered. Three diﬀerent methods are derived. The ﬁrst method is based on the necessary conditions for optimality from the Hamilton-Jacobi-Bellman theory for descriptor systems. The second method uses completion of squares to ﬁnd the solution. The third method gives a series expansion solution, which with a ﬁnite number of terms can serve as an approximate solution.
Place, publisher, year, edition, pages
2006. 1027-1031 p.
Optimal control, Algebraic/geometric methods, Constrained control, Descriptor Systems
Engineering and Technology Control Engineering
IdentifiersURN: urn:nbn:se:liu:diva-36896DOI: 10.1109/ACC.2006.1655493Local ID: 32925ISBN: 1-4244-0210-7ISBN: 1-4244-0209-3OAI: oai:DiVA.org:liu-36896DiVA: diva2:257745
2006 American Control Conference, Minneapolis, MN, USA, June, 2006