{"title":"Optimal stochastic event-triggered attack on remote state estimation","authors":"Ziyi Guo , Jing Zhou , Tongwen Chen","doi":"10.1016/j.automatica.2025.112463","DOIUrl":null,"url":null,"abstract":"<div><div>This paper designs optimal stealthy deception attacks for Kalman filter-based remote state estimation, focusing on stochastic event-triggered attack scheduling. First, an event-based attack strategy is proposed for adversaries who can intercept innovations transmitted by smart sensors, and the optimality is achieved among all stealthy candidates using the same information set and scheduling. Additionally, the parameters of the employed scheduling are fine-tuned by solving a convex optimization problem. Furthermore, with the help of a variable separation technique for analyzing probability density functions under the event-triggered mechanism, this work designs an optimal attack strategy for attackers who can install additional sensors to measure the system states. Simulations verify the effectiveness of the proposed methods.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112463"},"PeriodicalIF":4.8000,"publicationDate":"2025-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automatica","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0005109825003577","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 paper designs optimal stealthy deception attacks for Kalman filter-based remote state estimation, focusing on stochastic event-triggered attack scheduling. First, an event-based attack strategy is proposed for adversaries who can intercept innovations transmitted by smart sensors, and the optimality is achieved among all stealthy candidates using the same information set and scheduling. Additionally, the parameters of the employed scheduling are fine-tuned by solving a convex optimization problem. Furthermore, with the help of a variable separation technique for analyzing probability density functions under the event-triggered mechanism, this work designs an optimal attack strategy for attackers who can install additional sensors to measure the system states. Simulations verify the effectiveness of the proposed methods.
期刊介绍:
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.