Finite determination of accessibility and singular points of nonlinear systems: An algebraic approach
Mohammad Amin Sarafrazi , Ülle Kotta , Zbigniew Bartosiewicz
AbstractExploiting tools from algebraic geometry, the problem of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The results are constructive, and algorithms are given to find the maximum depth of Lie brackets necessary for deciding accessibility/strong accessibility of the system at any point, called here accessibility/strong accessibility index of the system, and known as the degree of non-holonomy in the literature. Alternatively, upper bounds on the accessibility/strong accessibility index are obtained, which can be computed easier. In each approach, the entire set of accessibility/strong accessibility singular points are obtained, as a limiting algebraic set of a strictly increasing chain of ideals, that stabilizes in finite time. Several examples demonstrate the applicability of the results using computer algebra tools.
|Journal series||Systems & Control Letters, [Systems and Control Letters], ISSN 0167-6911, e-ISSN 1872-7956, (N/A 100 pkt)|
|Keywords in English||Accessibility, Singular points, Nonlinear systems, Algebraic approaches, Degree of non-holonomy|
|ASJC Classification||; ; ;|
|Internal identifier||ROC 19-20|
|Score||= 100.0, 26-03-2020, ArticleFromJournal|
|Publication indicators||: 2016 = 2.087; : 2018 = 2.624 (2) - 2018=3.117 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.