K. Srinivasarengan, J. Ragot, C. Aubrun, D. Maquin
{"title":"非线性LPV模型的参数可辨识性","authors":"K. Srinivasarengan, J. Ragot, C. Aubrun, D. Maquin","doi":"10.34768/amcs-2022-0019","DOIUrl":null,"url":null,"abstract":"Abstract Linear parameter varying (LPV) models are being increasingly used as a bridge between linear and nonlinear models. From a mathematical point of view, a large class of nonlinear models can be rewritten in LPV or quasi-LPV forms easing their analysis. From a practical point of view, that kind of model can be used for introducing varying model parameters representing, for example, nonconstant characteristics of a component or an equipment degradation. This approach is frequently employed in several model-based system maintenance methods. The identifiability of these parameters is then a key issue for estimating their values based on which a decision can be made. However, the problem of identifiability of these models is still at a nascent stage. In this paper, we propose an approach to verify the identifiability of unknown parameters for LPV or quasi-LPV state-space models. It makes use of a parity-space like formulation to eliminate the states of the model. The resulting input-output-parameter equation is analyzed to verify the identifiability of the original model or a subset of unknown parameters. This approach provides a framework for both continuous-time and discrete-time models and is illustrated through various examples.","PeriodicalId":50339,"journal":{"name":"International Journal of Applied Mathematics and Computer Science","volume":"3 1","pages":"255 - 269"},"PeriodicalIF":1.6000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parameter Identifiability for Nonlinear LPV Models\",\"authors\":\"K. Srinivasarengan, J. Ragot, C. Aubrun, D. Maquin\",\"doi\":\"10.34768/amcs-2022-0019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Linear parameter varying (LPV) models are being increasingly used as a bridge between linear and nonlinear models. From a mathematical point of view, a large class of nonlinear models can be rewritten in LPV or quasi-LPV forms easing their analysis. From a practical point of view, that kind of model can be used for introducing varying model parameters representing, for example, nonconstant characteristics of a component or an equipment degradation. This approach is frequently employed in several model-based system maintenance methods. The identifiability of these parameters is then a key issue for estimating their values based on which a decision can be made. However, the problem of identifiability of these models is still at a nascent stage. In this paper, we propose an approach to verify the identifiability of unknown parameters for LPV or quasi-LPV state-space models. It makes use of a parity-space like formulation to eliminate the states of the model. The resulting input-output-parameter equation is analyzed to verify the identifiability of the original model or a subset of unknown parameters. This approach provides a framework for both continuous-time and discrete-time models and is illustrated through various examples.\",\"PeriodicalId\":50339,\"journal\":{\"name\":\"International Journal of Applied Mathematics and Computer Science\",\"volume\":\"3 1\",\"pages\":\"255 - 269\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2022-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Applied Mathematics and Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.34768/amcs-2022-0019\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Applied Mathematics and Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.34768/amcs-2022-0019","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
Parameter Identifiability for Nonlinear LPV Models
Abstract Linear parameter varying (LPV) models are being increasingly used as a bridge between linear and nonlinear models. From a mathematical point of view, a large class of nonlinear models can be rewritten in LPV or quasi-LPV forms easing their analysis. From a practical point of view, that kind of model can be used for introducing varying model parameters representing, for example, nonconstant characteristics of a component or an equipment degradation. This approach is frequently employed in several model-based system maintenance methods. The identifiability of these parameters is then a key issue for estimating their values based on which a decision can be made. However, the problem of identifiability of these models is still at a nascent stage. In this paper, we propose an approach to verify the identifiability of unknown parameters for LPV or quasi-LPV state-space models. It makes use of a parity-space like formulation to eliminate the states of the model. The resulting input-output-parameter equation is analyzed to verify the identifiability of the original model or a subset of unknown parameters. This approach provides a framework for both continuous-time and discrete-time models and is illustrated through various examples.
期刊介绍:
The International Journal of Applied Mathematics and Computer Science is a quarterly published in Poland since 1991 by the University of Zielona Góra in partnership with De Gruyter Poland (Sciendo) and Lubuskie Scientific Society, under the auspices of the Committee on Automatic Control and Robotics of the Polish Academy of Sciences.
The journal strives to meet the demand for the presentation of interdisciplinary research in various fields related to control theory, applied mathematics, scientific computing and computer science. In particular, it publishes high quality original research results in the following areas:
-modern control theory and practice-
artificial intelligence methods and their applications-
applied mathematics and mathematical optimisation techniques-
mathematical methods in engineering, computer science, and biology.