{"title":"凸多边形有界非线性系统的非线性控制算法","authors":"Olli Jansson, Matt Harris","doi":"10.1109/ietc54973.2022.9796775","DOIUrl":null,"url":null,"abstract":"This paper describes a technique for controlling nonlinear systems. It is assumed that the nonlinearity takes values in a convex polytope, the control appears linearly, and the system can be discretized in time. The technique requires the solution of a finite number of linear feasibility (programming) problems and reconstructs the nonlinear control from these solutions. Several examples are provided to illustrate the technique and results are compared to feedback linearization.","PeriodicalId":251518,"journal":{"name":"2022 Intermountain Engineering, Technology and Computing (IETC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nonlinear Control Algorithm for Systems with Convex Polytope Bounded Nonlinearities\",\"authors\":\"Olli Jansson, Matt Harris\",\"doi\":\"10.1109/ietc54973.2022.9796775\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a technique for controlling nonlinear systems. It is assumed that the nonlinearity takes values in a convex polytope, the control appears linearly, and the system can be discretized in time. The technique requires the solution of a finite number of linear feasibility (programming) problems and reconstructs the nonlinear control from these solutions. Several examples are provided to illustrate the technique and results are compared to feedback linearization.\",\"PeriodicalId\":251518,\"journal\":{\"name\":\"2022 Intermountain Engineering, Technology and Computing (IETC)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 Intermountain Engineering, Technology and Computing (IETC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ietc54973.2022.9796775\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Intermountain Engineering, Technology and Computing (IETC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ietc54973.2022.9796775","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Nonlinear Control Algorithm for Systems with Convex Polytope Bounded Nonlinearities
This paper describes a technique for controlling nonlinear systems. It is assumed that the nonlinearity takes values in a convex polytope, the control appears linearly, and the system can be discretized in time. The technique requires the solution of a finite number of linear feasibility (programming) problems and reconstructs the nonlinear control from these solutions. Several examples are provided to illustrate the technique and results are compared to feedback linearization.