Identification of linear continuous-time systems under irregular and random output sampling. (October 2015)

• Record Type: Journal Article
• Authors: Mu, Biqiang; Guo, Jin; Wang, Le Yi; Yin, George; Xu, Lijian; Zheng, Wei Xing
• Is Part Of: Automatica. Volume 60(2015)
• Page Start: 100
• Page End: 114
• Publication Date: 2015-10
• Subjects: Linear continuous-time system -- Irregular and random sampling -- Identifiability -- Iterative algorithm -- Recursive algorithm -- Strong consistency -- Asymptotical normality; Automatic control -- Periodicals; Automation -- Periodicals; 629.805
• DOI: 10.1016/j.automatica.2015.07.009
• Languages: English
• ISSNs: 0005-1098

Abstract

Abstract: This paper considers the problem of identifiability and parameter estimation of single-input–single-output, linear, time-invariant, stable, continuous-time systems under irregular and random sampling schemes. Conditions for system identifiability are established under inputs of exponential polynomial types and a tight bound on sampling density. Identification algorithms of Gauss–Newton iterative types are developed to generate convergent estimates. When the sampled output is corrupted by observation noises, input design, sampling times, and convergent algorithms are intertwined. Persistent excitation (PE) conditions for strongly convergent algorithms are derived. Unlike the traditional identification, the PE conditions under irregular and random sampling involve both sampling times and input values. Under the given PE conditions, iterative and recursive algorithms are developed to estimate the original continuous-time system parameters. The corresponding convergence results are obtained. Several simulation examples are provided to verify the theoretical results.