{"title":"Extensions of the linear fractional representation toolbox (LFRT)","authors":"J. Magni","doi":"10.1109/CACSD.2004.1393886","DOIUrl":null,"url":null,"abstract":"The initial version of linear fractional representation toolbox was mostly devoted to modelling with a special emphasis to LFT order reduction. An LFT representation can be viewed as the realization of a symbolic expression, therefore, scheduled gains are LFTs. This paper presents an extension of this toolbox to scheduled feedback design in LFT form. The well-posedness problem of such feedback gains is addressed. In addition, some classical analysis techniques (Nyquist, Bode, step responses...) are adapted to LFT objects via parameter gridding","PeriodicalId":111199,"journal":{"name":"2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","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.1393886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The initial version of linear fractional representation toolbox was mostly devoted to modelling with a special emphasis to LFT order reduction. An LFT representation can be viewed as the realization of a symbolic expression, therefore, scheduled gains are LFTs. This paper presents an extension of this toolbox to scheduled feedback design in LFT form. The well-posedness problem of such feedback gains is addressed. In addition, some classical analysis techniques (Nyquist, Bode, step responses...) are adapted to LFT objects via parameter gridding
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
