为易受攻击的网络物理系统提供具有分布稳健约束的随机控制

IF 2.5 3区 计算机科学 Q2 AUTOMATION & CONTROL SYSTEMS
Nishanth Venkatesh , Aditya Dave , Ioannis Faros , Andreas A. Malikopoulos
{"title":"为易受攻击的网络物理系统提供具有分布稳健约束的随机控制","authors":"Nishanth Venkatesh ,&nbsp;Aditya Dave ,&nbsp;Ioannis Faros ,&nbsp;Andreas A. Malikopoulos","doi":"10.1016/j.ejcon.2024.101044","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we investigate the control of a cyber–physical system (CPS) while accounting for its vulnerability to external attacks. We formulate a constrained stochastic problem with a robust constraint to ensure robust operation against potential attacks. We seek to minimize the expected cost subject to a constraint limiting the worst-case expected damage an attacker can impose on the CPS. We present a dynamic programming decomposition to compute the optimal control strategy in this robust-constrained formulation and prove its recursive feasibility. We also illustrate the utility of our results by applying them to a numerical simulation.</div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101044"},"PeriodicalIF":2.5000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Stochastic control with distributionally robust constraints for cyber–physical systems vulnerable to attacks\",\"authors\":\"Nishanth Venkatesh ,&nbsp;Aditya Dave ,&nbsp;Ioannis Faros ,&nbsp;Andreas A. Malikopoulos\",\"doi\":\"10.1016/j.ejcon.2024.101044\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper, we investigate the control of a cyber–physical system (CPS) while accounting for its vulnerability to external attacks. We formulate a constrained stochastic problem with a robust constraint to ensure robust operation against potential attacks. We seek to minimize the expected cost subject to a constraint limiting the worst-case expected damage an attacker can impose on the CPS. We present a dynamic programming decomposition to compute the optimal control strategy in this robust-constrained formulation and prove its recursive feasibility. We also illustrate the utility of our results by applying them to a numerical simulation.</div></div>\",\"PeriodicalId\":50489,\"journal\":{\"name\":\"European Journal of Control\",\"volume\":\"80 \",\"pages\":\"Article 101044\"},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2024-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Control\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0947358024001043\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Control","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0947358024001043","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们研究了网络物理系统(CPS)的控制问题,同时考虑到该系统易受外部攻击的问题。我们提出了一个带有稳健约束的受限随机问题,以确保系统能稳健运行,抵御潜在攻击。我们力求在限制攻击者对 CPS 造成的最坏情况预期损害的约束条件下,使预期成本最小化。我们提出了一种动态编程分解方法,用于计算这种鲁棒受限公式中的最优控制策略,并证明了其递归可行性。我们还将结果应用于数值模拟,以说明这些结果的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stochastic control with distributionally robust constraints for cyber–physical systems vulnerable to attacks
In this paper, we investigate the control of a cyber–physical system (CPS) while accounting for its vulnerability to external attacks. We formulate a constrained stochastic problem with a robust constraint to ensure robust operation against potential attacks. We seek to minimize the expected cost subject to a constraint limiting the worst-case expected damage an attacker can impose on the CPS. We present a dynamic programming decomposition to compute the optimal control strategy in this robust-constrained formulation and prove its recursive feasibility. We also illustrate the utility of our results by applying them to a numerical simulation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
European Journal of Control
European Journal of Control 工程技术-自动化与控制系统
CiteScore
5.80
自引率
5.90%
发文量
131
审稿时长
1 months
期刊介绍: The European Control Association (EUCA) has among its objectives to promote the development of the discipline. Apart from the European Control Conferences, the European Journal of Control is the Association''s main channel for the dissemination of important contributions in the field. The aim of the Journal is to publish high quality papers on the theory and practice of control and systems engineering. The scope of the Journal will be wide and cover all aspects of the discipline including methodologies, techniques and applications. Research in control and systems engineering is necessary to develop new concepts and tools which enhance our understanding and improve our ability to design and implement high performance control systems. Submitted papers should stress the practical motivations and relevance of their results. The design and implementation of a successful control system requires the use of a range of techniques: Modelling Robustness Analysis Identification Optimization Control Law Design Numerical analysis Fault Detection, and so on.
×
引用
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学术官方微信