{"title":"模型集验证的概率方法","authors":"T. Miyazato, T. Zhou, S. Hara","doi":"10.1109/CDC.1999.831289","DOIUrl":null,"url":null,"abstract":"We introduce a probabilistic measure named model set unfalsified probability (MSUP) for model set validation, where the model set is described by an LFT (linear fractional transformation) form. We derive upper and lower bounds of MSUP and show that the lower bound computation can be reduced to an LMI-based convex optimization. A numerical example confirms that the probabilistic approach more appropriately evaluates the suitability of a model set in robust controller design than deterministic approaches.","PeriodicalId":137513,"journal":{"name":"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A probabilistic approach to model set validation\",\"authors\":\"T. Miyazato, T. Zhou, S. Hara\",\"doi\":\"10.1109/CDC.1999.831289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a probabilistic measure named model set unfalsified probability (MSUP) for model set validation, where the model set is described by an LFT (linear fractional transformation) form. We derive upper and lower bounds of MSUP and show that the lower bound computation can be reduced to an LMI-based convex optimization. A numerical example confirms that the probabilistic approach more appropriately evaluates the suitability of a model set in robust controller design than deterministic approaches.\",\"PeriodicalId\":137513,\"journal\":{\"name\":\"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1999.831289\",\"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 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1999.831289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We introduce a probabilistic measure named model set unfalsified probability (MSUP) for model set validation, where the model set is described by an LFT (linear fractional transformation) form. We derive upper and lower bounds of MSUP and show that the lower bound computation can be reduced to an LMI-based convex optimization. A numerical example confirms that the probabilistic approach more appropriately evaluates the suitability of a model set in robust controller design than deterministic approaches.