Abstract

The reachability and controllability of descriptor systems is studied. Since discrete time descriptor systems are subject to certain consistency conditions in order for a solution to exist, we consider the problem of constructing an admissible input that can drive the system in any reachable state (or the origin) and that also satisfies the consistency conditions. This is done by first decomposing the system into its two subsystems, via the Weierstrass decomposition. Furthermore, algebraic criteria regarding the reachability and controllability of a descriptor system that involve its causal and non-causal subsystems are formulated.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.