On the finiteness of accessibility test for nonlinear discrete-time systems

Mohammad Amin Sarafrazi , Ewa Pawłuszewicz , Zbigniew Bartosiewicz , Ülle Kotta


It is shown that for two large subclasses of discrete-time nonlinear systems – analytic systems defined on a compact state space and rational systems – the minimum length r∗ for input sequences, called here accessibility index of the system, can be found, such that from any point x, system is accessible if it is accessible for input sequences of length r∗. Algorithms are presented to compute r∗, as well as an upper bound for it, which can be computed easier, and hence provide finite tests for determination of accessibility. The algorithms also show how to construct the set of points from which the system is not accessible in any finite number of steps. Finally, some relations between generic accessibility of the system and accessibility of individual points in finite steps are given.
Author Mohammad Amin Sarafrazi
Mohammad Amin Sarafrazi,,
, Ewa Pawłuszewicz (FME/DARM)
Ewa Pawłuszewicz,,
- Department of Automatic Control and Robotics
, Zbigniew Bartosiewicz (FCS/DM)
Zbigniew Bartosiewicz,,
- Department of Mathematics
, Ülle Kotta
Ülle Kotta,,
Journal seriesInternational Journal of Control, ISSN 0020-7179, e-ISSN 1366-5820, (N/A 100 pkt)
Issue year2020
Publication size in sheets0.50
Keywords in Englishaccessibility, generic accessibility, nonlinear control system, discrete-time system
ASJC Classification Computer Science Applications1706; Control and Systems Engineering2207
URL https://www.tandfonline.com/doi/abs/10.1080/00207179.2019.1706102?journalCode=tcon20
Internal identifierROC 19-20
Languageen angielski
Score (nominal)100
Score sourcejournalList
ScoreMinisterial score = 100.0, 26-03-2020, ArticleFromJournal
Publication indicators Scopus SNIP (Source Normalised Impact per Paper): 2018 = 1.285; WoS Impact Factor: 2018 = 2.930 (2) - 2018=2.642 (5)
Citation count*
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?