Automatica最新文献_第3页

Functional interval estimation for continuous-time linear systems with time-invariant uncertainties

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2024.112017

Youdao Ma , Zhenhua Wang , Nacim Meslem , Tarek Raïssi

引用次数: 0

Data-driven invariant set for nonlinear systems with application to command governors

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2024.112010

Ali Kashani, Claus Danielson

{"title":"Data-driven invariant set for nonlinear systems with application to command governors","authors":"Ali Kashani, Claus Danielson","doi":"10.1016/j.automatica.2024.112010","DOIUrl":"10.1016/j.automatica.2024.112010","url":null,"abstract":"<div><div>This paper presents a novel approach to synthesize positive invariant sets for unmodeled nonlinear systems using direct data-driven techniques. The data-driven invariant sets are used to design a data-driven command governor that selects a command for the closed-loop system to enforce constraints. Using basis functions, we solve a semi-definite program to learn a sum-of-squares Lyapunov-like function whose unity level-set is a constraint admissible positive invariant set, which determines the constraint admissible states and input commands. Leveraging Lipschitz properties of the system, we prove that tightening the model-based design ensures robustness of the invariant set to the inherent plant uncertainty in a data-driven framework. To mitigate the curse-of-dimensionality, we repose the semi-definite program into a linear program. We validate our approach through two examples: First, we present an illustrative example where we can analytically compute the maximum positive invariant set and compare with the presented data-driven invariant set. Second, we present a practical autonomous driving scenario to demonstrate the utility of the presented method for nonlinear systems.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"172 ","pages":"Article 112010"},"PeriodicalIF":4.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143095092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Event-triggered stabilization of uncertain switched linear systems under finite feedback bit rate

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-02-01 DOI: 10.1016/j.automatica.2024.111988

Jin Zhu , Zhi Xie , Geir E. Dullerud

引用次数: 0

Integrity attacks on state estimation with varying data access: From visibility to full restriction

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-01-31 DOI: 10.1016/j.automatica.2025.112162

Jinyuan Wei, Jing Zhou, Tongwen Chen

{"title":"Integrity attacks on state estimation with varying data access: From visibility to full restriction","authors":"Jinyuan Wei, Jing Zhou, Tongwen Chen","doi":"10.1016/j.automatica.2025.112162","DOIUrl":"10.1016/j.automatica.2025.112162","url":null,"abstract":"<div><div>This paper explores optimal integrity attacks with varying data access to innovations transmitted from smart sensors to remote state estimators. The data access refers to attackers’ capability or authorization to eavesdrop on and tamper with raw data packets. Unlike prior studies where the innovations were entirely intercepted and modified by attackers, different restrictions on data access are considered in this work. Within this context, entries of each innovation are separated into two parts: safe data and suspicious data. The first level of data access enables the interception of complete data, while modifications are limited to the suspicious data only. The second level restricts eavesdropping or tampering with the safe data, permitting only the interception and modification of suspicious data. To maintain stealthiness, the integrity attacks must adhere to stringent constraints, ensuring the statistical characteristics of the entire innovations remain unaltered. In this varying setting, optimal attack policies that make full utilization of available information are proposed and the corresponding coefficients are derived explicitly. Moreover, the optimality of proposed strategies is demonstrated rigorously, showing that no existing attack outperforms the proposed ones. Finally, the effectiveness of theoretical results is demonstrated through numerical examples and comparative studies.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"174 ","pages":"Article 112162"},"PeriodicalIF":4.8,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143130490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Stabilization of linear systems with multiple unknown time-varying input delays by linear time-varying feedback

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-01-31 DOI: 10.1016/j.automatica.2025.112175

Bin Zhou, Kai Zhang

引用次数: 0

Adaptive output tracking control with reference model system uncertainties

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-01-31 DOI: 10.1016/j.automatica.2025.112174

Gang Tao

引用次数: 0

On algorithms verifying initial-and-final-state opacity: Complexity, special cases, and comparison

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-01-31 DOI: 10.1016/j.automatica.2025.112171

Tomáš Masopust, Petr Osička

引用次数: 0

Kinematics-informed neural network control on SO(3)

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-01-31 DOI: 10.1016/j.automatica.2025.112172

Joel Reis , Carlos Silvestre

引用次数: 0

Recursive state estimation in relay channels with enhanced security against eavesdropping: An innovative encryption–decryption framework

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-01-31 DOI: 10.1016/j.automatica.2025.112159

Lei Zou , Zidong Wang , Bo Shen , Hongli Dong

{"title":"Recursive state estimation in relay channels with enhanced security against eavesdropping: An innovative encryption–decryption framework","authors":"Lei Zou , Zidong Wang , Bo Shen , Hongli Dong","doi":"10.1016/j.automatica.2025.112159","DOIUrl":"10.1016/j.automatica.2025.112159","url":null,"abstract":"<div><div>In this paper, the problem of secure recursive state estimation is addressed for a networked linear system over a relay channel. We consider the scenario where the transmitted signals and the internal state of the relay node might be intercepted by potential eavesdroppers. To prevent the system states from being inferred by potential eavesdroppers via overheard measurement signals, an encryption–decryption mechanism is adopted to protect the transmitted measurement signals over the communication links. Furthermore, for the purpose of preserving data privacy during the relaying process, a decryption-free relaying protocol is constructed, where a matrix-inequality-based method is proposed for the design of the desired parameters for the relaying protocol. Following this, a recursive state estimator is developed to generate state estimates through a set of recursions. Sufficient conditions are then derived to ensure the ultimate boundedness of the resultant estimation error variance matrix. Finally, the effectiveness of the proposed secure recursive state estimation scheme is demonstrated through a simulation example.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"174 ","pages":"Article 112159"},"PeriodicalIF":4.8,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143130489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Model-free H∞ control of Itô stochastic system via off-policy reinforcement learning

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-01-31 DOI: 10.1016/j.automatica.2025.112144

Weihai Zhang , Jing Guo , Xiushan Jiang

{"title":"Model-free H∞ control of Itô stochastic system via off-policy reinforcement learning","authors":"Weihai Zhang , Jing Guo , Xiushan Jiang","doi":"10.1016/j.automatica.2025.112144","DOIUrl":"10.1016/j.automatica.2025.112144","url":null,"abstract":"<div><div>The stochastic <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> control is studied for a linear stochastic Itô system with an unknown system model. It is known that the linear stochastic <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> control issue can be transformed into the problem of solving a so-called generalized algebraic Riccati equation (GARE), which is a nonlinear equation that is typically difficult to solve analytically. Worse, model-based techniques cannot be utilized to approximately solve a GARE when an accurate system model is unavailable or prohibitively expensive to construct in reality. To address these issues, an off-policy reinforcement learning (RL) approach is presented to learn the solution of a GARE from real system data rather than a system model; its convergence is demonstrated, and the robustness of RL to errors in the learning process is investigated. In the off-policy RL approach, the system data may be created with behavior policies rather than the target policies, which is highly significant and promising for use in actual systems. Finally, the proposed off-policy RL approach is validated on a two-mass spring system.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"174 ","pages":"Article 112144"},"PeriodicalIF":4.8,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143130712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0