Abstract
In this paper, a novel framework of system identification is introduced to capture the hybrid features of systems subject to both deterministic unmodeled dynamics and stochastic observation disturbances. Using the concepts of persistent identification, control-oriented system modeling and stochastic analysis, we investigate the central issues of irreducible identification errors and time complexity in such identification problems. Upper and lower bounds on errors and speed of persistent identification are obtained. The error bounds are expressed as functions of observation lengths, sizes of unmodeled dynamics, and probability distributions of disturbances. Asymptotic normality and complexity lower bounds are investigated when periodic inputs and LS estimation are applied. Generic features of asymptotic normality are further explored to extend the asymptotic lower bounds to a wider range of signals and identification mappings.
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.
