Simple Sufficient Conditions for Reachability of Discrete-Time Polynomial Systems

DOI10.1109/TAC.2013.2261184MaRDI QIDQ5353443zbMATH OpenFDO

Authors Yu Kawano, T. Ohtsuka

Publication date 8 September 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2013.2261184

Mathematics Subject Classification ID

Attainable sets, reachability (93B03) Algebraic methods (93B25)

Cited in

(5)

• Commutative algebraic methods for controllability of discrete-time polynomial systems
• Weak reachability and controllability of discrete-time nonlinear systems: generic approach and singular points
• Backward Reachability for Polynomial Systems on a Finite Horizon
• On the finiteness of accessibility test for nonlinear discrete-time systems
• Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems

This page was built for publication: Simple Sufficient Conditions for Reachability of Discrete-Time Polynomial Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353443)