{"title":"不稳定无限维植物的H∞灵敏度最小化","authors":"Armando A. Rodriguez, J. Cloutier","doi":"10.23919/ACC.1993.4793263","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of designing nearoptimal finite-dimensional compensators for unstable infinite-dimensional plants. Standard weighted H∞ sensitivity measures are used to define the notion of optimality. The method of solution is based on finite-dimensional techniques applied to finite-dimensional approximants of the original plant. The difficulties which arise from such an approach can be attributed to two factors. First, there is the lack of continuity of the performance measures with respect to perturbations in the plant, even with the graph topology. Second, there are many infinite-dimensional plants which cannot be approximated uniformly in the graph topology. It is shown in this paper, for the sensitivity minimization problem, that it is sufficient to obtain approximants of the plant on compact sets, provided that the inner part of the plant's \"numerator coprime factor\" is approximated in some sense. Constructive algorithms are presented. New results on the convergence of actual closed loop transfer functions are also given.","PeriodicalId":162700,"journal":{"name":"1993 American Control Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"H∞ sensitivity minimization for unstable infinite-dimensional plants\",\"authors\":\"Armando A. Rodriguez, J. Cloutier\",\"doi\":\"10.23919/ACC.1993.4793263\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of designing nearoptimal finite-dimensional compensators for unstable infinite-dimensional plants. Standard weighted H∞ sensitivity measures are used to define the notion of optimality. The method of solution is based on finite-dimensional techniques applied to finite-dimensional approximants of the original plant. The difficulties which arise from such an approach can be attributed to two factors. First, there is the lack of continuity of the performance measures with respect to perturbations in the plant, even with the graph topology. Second, there are many infinite-dimensional plants which cannot be approximated uniformly in the graph topology. It is shown in this paper, for the sensitivity minimization problem, that it is sufficient to obtain approximants of the plant on compact sets, provided that the inner part of the plant's \\\"numerator coprime factor\\\" is approximated in some sense. Constructive algorithms are presented. New results on the convergence of actual closed loop transfer functions are also given.\",\"PeriodicalId\":162700,\"journal\":{\"name\":\"1993 American Control Conference\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ACC.1993.4793263\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ACC.1993.4793263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
H∞ sensitivity minimization for unstable infinite-dimensional plants
This paper considers the problem of designing nearoptimal finite-dimensional compensators for unstable infinite-dimensional plants. Standard weighted H∞ sensitivity measures are used to define the notion of optimality. The method of solution is based on finite-dimensional techniques applied to finite-dimensional approximants of the original plant. The difficulties which arise from such an approach can be attributed to two factors. First, there is the lack of continuity of the performance measures with respect to perturbations in the plant, even with the graph topology. Second, there are many infinite-dimensional plants which cannot be approximated uniformly in the graph topology. It is shown in this paper, for the sensitivity minimization problem, that it is sufficient to obtain approximants of the plant on compact sets, provided that the inner part of the plant's "numerator coprime factor" is approximated in some sense. Constructive algorithms are presented. New results on the convergence of actual closed loop transfer functions are also given.