On the finiteness of accessibility test for nonlinear discrete-time systems
From MaRDI portal
Publication:5165309
DOI10.1080/00207179.2019.1706102zbMath1478.93040arXiv1905.10154OpenAlexW2996038019WikidataQ126536028 ScholiaQ126536028MaRDI QIDQ5165309
Mohammad Amin Sarafrazi, Zbigniew Bartosiewicz, Yu. R. Kotta, Ewa Pawłuszewicz
Publication date: 16 November 2021
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.10154
Nonlinear systems in control theory (93C10) Discrete-time control/observation systems (93C55) Attainable sets, reachability (93B03)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic criteria of global observability of polynomial systems
- Observability at an initial state for polynomial systems
- Implicit discrete-time systems and accessibility
- Local observability of nonlinear systems
- Manifolds, tensor analysis, and applications.
- Commutative algebraic methods for controllability of discrete-time polynomial systems
- A Linear Algebraic Framework for the Analysis of Discrete-Time Nonlinear Systems
- Controllability of Nonlinear Discrete-Time Systems: A Lie-Algebraic Approach
- Linearization of Discrete-Time Systems
- Le théorème des zéros en géométries algébrique et analytique réelles
- Discrete-Time Transitivity and Accessibility: Analytic Systems
- Dead beat controllability of polynomial systems: symbolic computation approaches
- Controllability of structured polynomial systems
- Forward and Backward Shifts of Vector Fields: Towards the Dual Algebraic Framework
- Simple Sufficient Conditions for Reachability of Discrete-Time Polynomial Systems
- Controllability, Realization and Stability of Discrete-Time Systems
