{"title":"Identification of multivariable linear parameter-varying systems based on subspace techniques","authors":"Vincent Verdult, M. Verhaegen","doi":"10.1109/CDC.2000.912083","DOIUrl":null,"url":null,"abstract":"Presents a subspace type of identification method for multivariable linear parameter-varying systems in state space representation with affine parameter dependence. It is shown that a major problem with subspace methods for this kind of systems is the enormous dimensions of the data matrices involved. To overcome the curse of dimensionality, we suggest to use only the most dominant rows of the data matrices in estimating the model. An efficient selection algorithm is discussed that does not require the formation of the complete data matrices, but can process them row by row.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2000.912083","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
Abstract
Presents a subspace type of identification method for multivariable linear parameter-varying systems in state space representation with affine parameter dependence. It is shown that a major problem with subspace methods for this kind of systems is the enormous dimensions of the data matrices involved. To overcome the curse of dimensionality, we suggest to use only the most dominant rows of the data matrices in estimating the model. An efficient selection algorithm is discussed that does not require the formation of the complete data matrices, but can process them row by row.