{"title":"局部一致性技术在鲁棒控制器设计中的应用","authors":"J. Monreal, J. Bondia, J. Picó","doi":"10.1109/CACSD.2004.1393870","DOIUrl":null,"url":null,"abstract":"The synthesis of controllers with robust performance is addressed. Tracking specifications are defined by a family of reference models describing the desired frequency response. The synthesis problem is then formulated as a set inclusion problem in the frequency domain. It is shown that the problem can be cast as a constraint satisfaction problem and solved by branch-and-prune algorithms. Different branching and pruning methodologies are explored and compared","PeriodicalId":111199,"journal":{"name":"2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Application of local consistency techniques to the design of controllers with robust performance\",\"authors\":\"J. Monreal, J. Bondia, J. Picó\",\"doi\":\"10.1109/CACSD.2004.1393870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The synthesis of controllers with robust performance is addressed. Tracking specifications are defined by a family of reference models describing the desired frequency response. The synthesis problem is then formulated as a set inclusion problem in the frequency domain. It is shown that the problem can be cast as a constraint satisfaction problem and solved by branch-and-prune algorithms. Different branching and pruning methodologies are explored and compared\",\"PeriodicalId\":111199,\"journal\":{\"name\":\"2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CACSD.2004.1393870\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CACSD.2004.1393870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Application of local consistency techniques to the design of controllers with robust performance
The synthesis of controllers with robust performance is addressed. Tracking specifications are defined by a family of reference models describing the desired frequency response. The synthesis problem is then formulated as a set inclusion problem in the frequency domain. It is shown that the problem can be cast as a constraint satisfaction problem and solved by branch-and-prune algorithms. Different branching and pruning methodologies are explored and compared