Simple sufficient conditions for reachability of discrete-time polynomial systemsKawano, Y. & Ohtsuka, T., Dec-2013, In : IEEE Transactions on Automatic Control. 58, 12, p. 3203-3206 4 p., 6512024.
Research output: Contribution to journal › Article › Academic › peer-review
We consider reachability of discrete-time polynomial systems. The reachability of such systems can be interpreted as the surjectivity of the polynomial mappings defined by the systems. For a polynomial mapping between suitable spaces of the same dimensions, it has been shown that the injectivity of the mapping also implies the surjectivity. By utilizing this fact, we derive sufficient conditions for the reachability of the polynomial systems, which essentially check the injectivity of the polynomial mappings.
|Number of pages||4|
|Journal||IEEE Transactions on Automatic Control|
|Publication status||Published - Dec-2013|
- Algebraic geometry, Commutative algebra, Discrete-time systems, Polynomial systems, Reachability