Abstract
We present a Kalman-style realization theory for linear parameter-varying state-space representations whose matrices depend on the scheduling variables in an affine way (abbreviated as LPV-SSA). We show that minimality of LPV-SSAs is equivalent to observability and span-reachability rank conditions, and that minimal LPV-SSAs of the same input-output map are isomorphic. We present necessary and sufficient conditions for existence of an LPV-SSA in terms of the rank of a Hankel-matrix and a Ho-Kalman-like realization algorithm.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
