Computing the Controllability Function for Nonlinear Descriptor Systems
2005 (English)Report (Other academic)
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
Linköping: Linköping University Electronic Press, 2005. , 9 p.
LiTH-ISY-R, ISSN 1400-3902 ; 2717
Optimal control, Algebraic/geometric methods, Constrained control, Descriptor Systems
IdentifiersURN: urn:nbn:se:liu:diva-56090ISRN: LiTH-ISY-R-2717OAI: oai:DiVA.org:liu-56090DiVA: diva2:316843