Computation of Maximal Admissible Robust Positive Invariant Sets for Linear Systems With Parametric and Additive Uncertainties

IF 2.4 Q2 AUTOMATION & CONTROL SYSTEMS IEEE Control Systems Letters Pub Date : 2024-06-17 DOI:10.1109/LCSYS.2024.3415489
Anchita Dey;Shubhendu Bhasin
{"title":"Computation of Maximal Admissible Robust Positive Invariant Sets for Linear Systems With Parametric and Additive Uncertainties","authors":"Anchita Dey;Shubhendu Bhasin","doi":"10.1109/LCSYS.2024.3415489","DOIUrl":null,"url":null,"abstract":"In this letter, we address the problem of computing the maximal admissible robust positive invariant (MARPI) set for discrete-time linear time-varying systems with parametric uncertainties and additive disturbances. The system state and input are subject to hard constraints, and the system parameters and the exogenous disturbance are assumed to belong to known convex polytopes. We provide necessary and sufficient conditions for the existence of the non-empty MARPI set, and explore relevant features of the set that lead to an efficient finite-time converging algorithm with a suitable stopping criterion. The analysis hinges on backward reachable sets defined using recursively computed halfspaces and the minimal RPI set. A numerical example is used to validate the theoretical development.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4000,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Control Systems Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10559215/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In this letter, we address the problem of computing the maximal admissible robust positive invariant (MARPI) set for discrete-time linear time-varying systems with parametric uncertainties and additive disturbances. The system state and input are subject to hard constraints, and the system parameters and the exogenous disturbance are assumed to belong to known convex polytopes. We provide necessary and sufficient conditions for the existence of the non-empty MARPI set, and explore relevant features of the set that lead to an efficient finite-time converging algorithm with a suitable stopping criterion. The analysis hinges on backward reachable sets defined using recursively computed halfspaces and the minimal RPI set. A numerical example is used to validate the theoretical development.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有参数和添加不确定性的线性系统的最大可容许稳健正不变集的计算
在这封信中,我们探讨了如何计算具有参数不确定性和外加扰动的离散时线性时变系统的最大容许鲁棒正不变量(MARPI)集的问题。系统状态和输入都受到硬约束,系统参数和外生扰动被假定属于已知的凸多面体。我们提供了非空 MARPI 集存在的必要条件和充分条件,并探讨了该集的相关特征,从而提出了一种具有合适停止准则的高效有限时间收敛算法。分析的关键是使用递归计算的半空间和最小 RPI 集定义的后向可达集。一个数值示例用于验证理论的发展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Control Systems Letters
IEEE Control Systems Letters Mathematics-Control and Optimization
CiteScore
4.40
自引率
13.30%
发文量
471
期刊最新文献
Rationality of Learning Algorithms in Repeated Normal-Form Games Impact of Opinion on Disease Transmission With Waterborne Pathogen and Stubborn Community Numerical and Lyapunov-Based Investigation of the Effect of Stenosis on Blood Transport Stability Using a Control-Theoretic PDE Model of Cardiovascular Flow Almost Sure Convergence and Non-Asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm Opinion Dynamics With Set-Based Confidence: Convergence Criteria and Periodic Solutions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1