IEEE Transactions on Automatic Control最新文献_第3页

From Formal Methods to Data-Driven Safety Certificates of Unknown Large-Scale Networks 从形式化方法到未知大规模网络的数据驱动安全证书

IF 6.8 1区计算机科学

IEEE Transactions on Automatic Control Pub Date : 2026-10-05 DOI: 10.1109/tac.2026.3740610

Omid Akbarzadeh, Behrad Samari, Amy Nejati, Abolfazl Lavaei

引用次数: 0

On the Relationship Between Robust BIBO Stability and Robust Bounded States Stability in Nonlinear Right Coprime Factorization Feedback Systems 非线性右素数分解反馈系统鲁棒BIBO稳定性与鲁棒有界状态稳定性的关系

IF 6.8 1区计算机科学

IEEE Transactions on Automatic Control Pub Date : 2026-10-05 DOI: 10.1109/tac.2026.3740625

Zizhen An, Mingcong Deng

引用次数: 0

Semilinear Dynamic Programming: Analysis, Algorithms, and Certainty Equivalence Properties 半线性动态规划：分析、算法和确定性等价性质

IF 6.8 1区计算机科学

IEEE Transactions on Automatic Control Pub Date : 2026-10-02 DOI: 10.1109/tac.2026.3740067

Yuchao Li, Dimitri P. Bertsekas

引用次数: 0

Multi-Agent Coordination Under Poisson Observations: A Global Game Approach 泊松观测下的多智能体协调：一种全局博弈方法

IF 6.8 1区计算机科学

IEEE Transactions on Automatic Control Pub Date : 2026-10-02 DOI: 10.1109/tac.2026.3740045

Marcos M. Vasconcelos, Behrouz Touri

引用次数: 0

Observers for Timed DESs With Observation Delays and Losses 具有观测延迟和损失的定时dss的观测者

IF 7 1区计算机科学

IEEE Transactions on Automatic Control Pub Date : 2026-10-01 Epub Date: 2026-04-27 DOI: 10.1109/TAC.2026.3687823

Dimitri Lefebvre

引用次数: 0

Sampling-Based Planning Under STL Specifications: A Forward Invariance Approach STL规范下基于抽样的规划：一种前向不变性方法

IF 7 1区计算机科学

IEEE Transactions on Automatic Control Pub Date : 2026-10-01 Epub Date: 2026-03-04 DOI: 10.1109/TAC.2026.3690342

Gregorio Marchesini;Siyuan Liu;Lars Lindemann;Dimos V. Dimarogonas

{"title":"Sampling-Based Planning Under STL Specifications: A Forward Invariance Approach","authors":"Gregorio Marchesini;Siyuan Liu;Lars Lindemann;Dimos V. Dimarogonas","doi":"10.1109/TAC.2026.3690342","DOIUrl":"https://doi.org/10.1109/TAC.2026.3690342","url":null,"abstract":"In this article, we propose a variant of the Rapidly Exploring Random Tree Star (RRT<inline-formula><tex-math>$^{star }$</tex-math></inline-formula>) algorithm for planning trajectories of linear systems under input constraints subject to spatiotemporal specifications expressed in a fragment of signal temporal logic (STL). Compared to existing sampling-based approaches that rely on mixed-integer or nonsmooth optimization, which suffer from poor scalability, we adopt a control-theoretic framework based on set forward invariance. First, STL specifications with polyhedral predicates are encoded as a time-varying set computed via linear programming, such that all trajectories evolving within the set satisfy the specification. Forward invariance of the set for linear systems under input constraints is guaranteed using nonsmooth analysis. Second, a modified RRT<inline-formula><tex-math>$^{star }$</tex-math></inline-formula> algorithm is proposed to efficiently sample dynamically feasible and minimum cost trajectories within this time-varying set, in order to satisfy the given specifications. The effectiveness of the approach is demonstrated on an autonomous inspection mission of the International Space Station and a timed room-servicing task.","PeriodicalId":13201,"journal":{"name":"IEEE Transactions on Automatic Control","volume":"71 10","pages":"6728-6743"},"PeriodicalIF":7.0,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11505760","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149072264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Simple Proof of Nehari’s Theorem Based on Duality 基于对偶的Nehari定理的简单证明

IF 7 1区计算机科学

IEEE Transactions on Automatic Control Pub Date : 2026-10-01 Epub Date: 2026-03-07 DOI: 10.1109/TAC.2026.3691281

Cristian R. Rojas

引用次数: 0

A Transfer Learning Method for Safety Control of Linear Systems Under Input Saturation 输入饱和下线性系统安全控制的迁移学习方法

IF 7 1区计算机科学

IEEE Transactions on Automatic Control Pub Date : 2026-10-01 Epub Date: 2026-03-11 DOI: 10.1109/TAC.2026.3692001

Quanqi Zhang;Chengwei Wu;Ligang Wu

{"title":"A Transfer Learning Method for Safety Control of Linear Systems Under Input Saturation","authors":"Quanqi Zhang;Chengwei Wu;Ligang Wu","doi":"10.1109/TAC.2026.3692001","DOIUrl":"https://doi.org/10.1109/TAC.2026.3692001","url":null,"abstract":"While the safe reinforcement learning (RL) control has been addressed in several studies, achieving safety during the training phase remains a significant challenge. Training directly in hazardous environments through trial and error inherently leads to unsafe behaviors. To address this, we propose a novel safety-certified transfer learning method for linear systems, where an RL controller is first trained to stabilize the system in a risk-free environment and then transferred to the hazardous environment. The primary challenge is to ensure that, after the transfer, the learning-based controller can guarantee safety while preserving stability. To this end, differential geometry tools are employed to analyze the geometric relationship between the systems before and after transfer and design the transferred controller accordingly. Theoretical analysis proves that the transferred controller can stabilize the system and enforce its safety, as long as the original RL controller stabilizes the system. Moreover, the proposed transfer method imposes saturation constraints on the transferred controller to prevent invalid control inputs that may arise from controller modification after transfer. The conditions for the existence of the transferred controller are derived. Finally, the effectiveness of the proposed method is demonstrated by a vehicle control case study.","PeriodicalId":13201,"journal":{"name":"IEEE Transactions on Automatic Control","volume":"71 10","pages":"6962-6969"},"PeriodicalIF":7.0,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149072362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Secure Filtering Against Spatio-Temporal False Data Attacks Under Asynchronous Sampling 异步采样下时空假数据攻击的安全过滤

IF 7 1区计算机科学

IEEE Transactions on Automatic Control Pub Date : 2026-10-01 Epub Date: 2026-04-23 DOI: 10.1109/TAC.2026.3687465

Zishuo Li;Anh Tung Nguyen;André M. H. Teixeira;Yilin Mo;Karl H. Johansson

{"title":"Secure Filtering Against Spatio-Temporal False Data Attacks Under Asynchronous Sampling","authors":"Zishuo Li;Anh Tung Nguyen;André M. H. Teixeira;Yilin Mo;Karl H. Johansson","doi":"10.1109/TAC.2026.3687465","DOIUrl":"10.1109/TAC.2026.3687465","url":null,"abstract":"This article addresses the secure state estimation problem for continuous linear time-invariant systems with non-periodic and asynchronous sampled measurements, where the sensors need to transmit not only measurements but also sampling time-stamps to the fusion center. This measurement and communication setup is well-suited for operating large-scale control systems and, at the same time, introduces new vulnerabilities that can be exploited by adversaries through (i) manipulation of measurements, (ii) manipulation of time-stamps, (iii) elimination of measurements, and (iv) generation of completely new false measurements, or a combination of these attacks. To mitigate these attacks, we propose a decentralized estimation algorithm in which each sensor maintains its local state estimate asynchronously based on its measurements. The local estimates are synchronized through time prediction and fused after time-stamp alignment. In the absence of attacks, state estimates are proven to recover the optimal Kalman estimates by solving a weighted least squares problem. In the presence of attacks, solving this weighted least squares problem with <inline-formula><tex-math>$ell _{1}$</tex-math></inline-formula> regularization provides secure state estimates with a uniformly bounded error under an observability redundancy assumption. The effectiveness of the proposed algorithm is demonstrated using a benchmark example of the IEEE 14-bus system.","PeriodicalId":13201,"journal":{"name":"IEEE Transactions on Automatic Control","volume":"71 10","pages":"6833-6840"},"PeriodicalIF":7.0,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147735587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

IEEE Control Systems Society Information IEEE控制系统学会信息

IF 7 1区计算机科学

IEEE Transactions on Automatic Control Pub Date : 2026-10-01 Epub Date: 2026-09-29 DOI: 10.1109/TAC.2026.3729138

引用次数: 0