Equi-normalized robust positively invariant sets for linear difference inclusions

IF 4.8 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
{"title":"Equi-normalized robust positively invariant sets for linear difference inclusions","authors":"","doi":"10.1016/j.automatica.2024.111930","DOIUrl":null,"url":null,"abstract":"<div><p>This note establishes the characterization, existence and uniqueness of equi-normalized polytopic robust positively invariant sets for linear difference inclusions. The computation of this set results in a nonconvex optimization problem. Although this may be reformulated exactly as a mixed integer linear programme, we propose a more practical and tractable alternative in the form of a fixed-point iteration based on linear programming. Convergence of the algorithm is established.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8000,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824004242/pdfft?md5=296bd675522f3c88e6856b48384e7426&pid=1-s2.0-S0005109824004242-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automatica","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0005109824004242","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This note establishes the characterization, existence and uniqueness of equi-normalized polytopic robust positively invariant sets for linear difference inclusions. The computation of this set results in a nonconvex optimization problem. Although this may be reformulated exactly as a mixed integer linear programme, we propose a more practical and tractable alternative in the form of a fixed-point iteration based on linear programming. Convergence of the algorithm is established.

线性差分夹杂的等归一化稳健正不变集
本说明确定了线性差分夹杂的等归一化多顶稳健正不变集的特征、存在性和唯一性。该集合的计算会产生一个非凸优化问题。虽然这个问题可以精确地重新表述为混合整数线性规划,但我们提出了一个更实用、更简单的替代方案,即基于线性规划的定点迭代。我们确定了算法的收敛性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Automatica
Automatica 工程技术-工程:电子与电气
CiteScore
10.70
自引率
7.80%
发文量
617
审稿时长
5 months
期刊介绍: Automatica is a leading archival publication in the field of systems and control. The field encompasses today a broad set of areas and topics, and is thriving not only within itself but also in terms of its impact on other fields, such as communications, computers, biology, energy and economics. Since its inception in 1963, Automatica has kept abreast with the evolution of the field over the years, and has emerged as a leading publication driving the trends in the field. After being founded in 1963, Automatica became a journal of the International Federation of Automatic Control (IFAC) in 1969. It features a characteristic blend of theoretical and applied papers of archival, lasting value, reporting cutting edge research results by authors across the globe. It features articles in distinct categories, including regular, brief and survey papers, technical communiqués, correspondence items, as well as reviews on published books of interest to the readership. It occasionally publishes special issues on emerging new topics or established mature topics of interest to a broad audience. Automatica solicits original high-quality contributions in all the categories listed above, and in all areas of systems and control interpreted in a broad sense and evolving constantly. They may be submitted directly to a subject editor or to the Editor-in-Chief if not sure about the subject area. Editorial procedures in place assure careful, fair, and prompt handling of all submitted articles. Accepted papers appear in the journal in the shortest time feasible given production time constraints.
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信