Open AccessConstructive criterion algorithm of the global controllability for a class of planar polynomial systems
Author(s) -
Li Qianqian,
Xu Xueli,
Sun Yimin
Publication year - 2015
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2014.0299
Subject(s) - controllability , constructive , planar , class (philosophy) , polynomial , constructive proof , mathematics , algebraic number , control theory (sociology) , algorithm , mathematical optimization , algebra over a field , computer science , discrete mathematics , pure mathematics , mathematical analysis , control (management) , artificial intelligence , process (computing) , computer graphics (images) , operating system
In this study, a constructive criterion algorithm of the global controllability for a class of planar polynomial systems is obtained. This algorithm is imposed on the coefficients of polynomials only and can be realised easily by computer. The analysis is based on a classical result in real algebraic geometry – Sturm theorem and its modern progress. According to this algorithm, the global controllability of the system can be determined in finite steps arithmetic operations. Finally, the authors give some examples to show the application of the author's results.