{"title":"A nonlinear static output controller design for polynomial systems: An iterative sums of squares approach","authors":"S. Saat, Matthias Krug, S. Nguang","doi":"10.1109/ICOM.2011.5937186","DOIUrl":null,"url":null,"abstract":"This paper presents an iterative sum of squares approach for designing a nonlinear static output feedback control for polynomial systems. In this work, the problem of designing a nonlinear static output feedback controller is converted into solvability conditions of polynomial matrix inequalities. An iterative algorithm based on the sum of squares decomposition technique is proposed to resolve the non-convex terms issue and convert it to the convex problem, hence a feasible solution for polynomial matrix inequalities can be obtained efficiently. Numerical examples are provided at the end of the paper as to demonstrate the validity of applied method.","PeriodicalId":376337,"journal":{"name":"2011 4th International Conference on Mechatronics (ICOM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 4th International Conference on Mechatronics (ICOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOM.2011.5937186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
This paper presents an iterative sum of squares approach for designing a nonlinear static output feedback control for polynomial systems. In this work, the problem of designing a nonlinear static output feedback controller is converted into solvability conditions of polynomial matrix inequalities. An iterative algorithm based on the sum of squares decomposition technique is proposed to resolve the non-convex terms issue and convert it to the convex problem, hence a feasible solution for polynomial matrix inequalities can be obtained efficiently. Numerical examples are provided at the end of the paper as to demonstrate the validity of applied method.