{"title":"通过稳定的反射向量多面体实现鲁棒极点配置","authors":"Ü. Nurges","doi":"10.3176/phys.math.2006.2.01","DOIUrl":null,"url":null,"abstract":"A robust version of the output controller design for discrete-time systems is introduced. Instead of a single stable point a stable polytope (or simplex) is preselected in the coefficient space of closed-loop characteristic polynomials. A constructive procedure for generating stable simplexes is given starting from the unit hypercube of reflection coefficients of monic polynomials. This procedure is quite straightforward, because for a special family of polynomials the linear cover of so-called reflection vectors is stable. The root placement of reflection vectors is studied. If a stable target simplex is preselected, then the robust output controller design task is solved by the quadratic programming approach.","PeriodicalId":308961,"journal":{"name":"Proceedings of the Estonian Academy of Sciences. Physics. Mathematics","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Robust pole assignment via stable polytopes of reflection vectors\",\"authors\":\"Ü. Nurges\",\"doi\":\"10.3176/phys.math.2006.2.01\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A robust version of the output controller design for discrete-time systems is introduced. Instead of a single stable point a stable polytope (or simplex) is preselected in the coefficient space of closed-loop characteristic polynomials. A constructive procedure for generating stable simplexes is given starting from the unit hypercube of reflection coefficients of monic polynomials. This procedure is quite straightforward, because for a special family of polynomials the linear cover of so-called reflection vectors is stable. The root placement of reflection vectors is studied. If a stable target simplex is preselected, then the robust output controller design task is solved by the quadratic programming approach.\",\"PeriodicalId\":308961,\"journal\":{\"name\":\"Proceedings of the Estonian Academy of Sciences. Physics. Mathematics\",\"volume\":\"114 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Estonian Academy of Sciences. Physics. Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3176/phys.math.2006.2.01\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Estonian Academy of Sciences. Physics. Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3176/phys.math.2006.2.01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Robust pole assignment via stable polytopes of reflection vectors
A robust version of the output controller design for discrete-time systems is introduced. Instead of a single stable point a stable polytope (or simplex) is preselected in the coefficient space of closed-loop characteristic polynomials. A constructive procedure for generating stable simplexes is given starting from the unit hypercube of reflection coefficients of monic polynomials. This procedure is quite straightforward, because for a special family of polynomials the linear cover of so-called reflection vectors is stable. The root placement of reflection vectors is studied. If a stable target simplex is preselected, then the robust output controller design task is solved by the quadratic programming approach.