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

Robust Distributed Optimization for Multiagent Systems With General Linear Models 具有一般线性模型的多智能体系统鲁棒分布优化

IF 7 1区计算机科学

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

Tong Liu;Michelangelo Bin;Ivano Notarnicola;Thomas Parisini;Zhong-Ping Jiang

引用次数: 0

Distributed Nominal Configuration Design for Linear Formations 线性地层的分布式标称配置设计

IF 7 1区计算机科学

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

Xiaozhen Zhang;Xianlin Zeng;Qingkai Yang;Hao Fang;Lihua Xie;Jie Chen

{"title":"Distributed Nominal Configuration Design for Linear Formations","authors":"Xiaozhen Zhang;Xianlin Zeng;Qingkai Yang;Hao Fang;Lihua Xie;Jie Chen","doi":"10.1109/TAC.2026.3689360","DOIUrl":"https://doi.org/10.1109/TAC.2026.3689360","url":null,"abstract":"Linear formation is a recently introduced concept in formation control that characterizes the formation shape through a linear mapping from a high-dimensional nominal configuration to agents’ workspace. However, the abstract nature of high-dimensional spaces renders the design of such nominal configurations challenging. This article transforms the distributed design of nominal configurations into the problem of solving nonlinear equations in distributed manners. It is shown that the gradient-based method may fall into undesired equilibria when local solutions are near the origin. To address this issue, an exponential coordinate mapping is introduced to restrict the solution search to the positive orthant of the state space, thereby avoiding undesired equilibria. In addition, auxiliary variables are employed to shift the desired equilibrium, ensuring the solvability of the nonlinear equation and enhancing the convergence behavior of the system. This equilibrium shift is also shown to be compatible with the original nominal configuration design problem. Finally, numerical simulations are provided to verify the effectiveness of the proposed method.","PeriodicalId":13201,"journal":{"name":"IEEE Transactions on Automatic Control","volume":"71 10","pages":"6841-6848"},"PeriodicalIF":7.0,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149072299","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

Consensus in Opinion Dynamics With Convictions Under Fixed and Switching Digraphs 固定有向图与转换有向图下信念动态的共识

IF 7 1区计算机科学

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

Linglong Du;Yu Huang

引用次数: 0

Local Verification of Current-State Opacity and Static-State Opacity in Distributed Discrete-Event Systems 分布式离散事件系统中当前状态不透明度和静态状态不透明度的局部验证

IF 7 1区计算机科学

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

Yin Tong;Kai Cai

{"title":"Local Verification of Current-State Opacity and Static-State Opacity in Distributed Discrete-Event Systems","authors":"Yin Tong;Kai Cai","doi":"10.1109/TAC.2026.3695799","DOIUrl":"https://doi.org/10.1109/TAC.2026.3695799","url":null,"abstract":"The integration of physical processes and cyber-networks in cyber-physical systems has made information security crucial, particularly in preventing unauthorized access and data leakage. Current-state opacity (CSO) in discrete-event systems (DESs) formalizes the security property that an intruder can never infer secret states based on its observation. This article addresses CSO and its verification in distributed DESs composed of multiple local systems. Existing methods of verifying CSO in distributed DESs either rely on sufficient conditions for local verification or require costly synchronization of local systems and observers. This article first proposes necessary and sufficient conditions for locally verifying CSO of distributed DESs, reducing the time complexity from <inline-formula><tex-math>$mathcal {O}(2^{n^{m}})$</tex-math></inline-formula> to <inline-formula><tex-math>$mathcal {O}(mn)$</tex-math></inline-formula>, where <inline-formula><tex-math>$m$</tex-math></inline-formula> is the number of local systems and <inline-formula><tex-math>$n$</tex-math></inline-formula> is the largest state number of local systems. We also introduce static-state opacity (SSO), a new information security notion for distributed systems characterizing intruders’ incapability to deduce global secrets from local ones. We show that SSO can be verified (necessarily and sufficiently) through a matrix involving CSO of local systems with a time complexity of <inline-formula><tex-math>$mathcal {O}(m2^{n})$</tex-math></inline-formula>. Furthermore, we explore the relationship between CSO and SSO, showing scenarios where they are equivalent.","PeriodicalId":13201,"journal":{"name":"IEEE Transactions on Automatic Control","volume":"71 10","pages":"6990-6997"},"PeriodicalIF":7.0,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149072335","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

Viscosity Solutions of Hamilton–Jacobi–Bellman Equations for Nonzero-Sum Differential Games With Safety Consideration 考虑安全的非零和微分对策Hamilton-Jacobi-Bellman方程的粘性解

IF 7 1区计算机科学

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

Chunhe Ma;Zhi Feng;Shuo Feng;Yipeng Pang;Guoqiang Hu

{"title":"Viscosity Solutions of Hamilton–Jacobi–Bellman Equations for Nonzero-Sum Differential Games With Safety Consideration","authors":"Chunhe Ma;Zhi Feng;Shuo Feng;Yipeng Pang;Guoqiang Hu","doi":"10.1109/TAC.2026.3692002","DOIUrl":"https://doi.org/10.1109/TAC.2026.3692002","url":null,"abstract":"In this article, the solutions of a class of infinite-horizon, nonzero-sum differential games are studied in the viscosity solution sense while considering the system's safety. The value functions, which are solutions of Hamilton–Jacobi–Bellman equations, are assumed to be continuous so that the safety constraint defined by the control barrier function can be incorporated. We present a new idea for solving nonzero-sum differential games by approximating their closed-loop solutions via a collection of static noncooperative games. Novel algorithms based on fixed-point iteration and static noncooperative games are proposed to approximate the solutions of nonzero-sum differential games, both with and without the safety constraint. The cost function values, evaluated at the Nash equilibrium (NE) points of unconstrained static noncooperative games and at the generalized NE points of constrained static noncooperative games, converge to the solutions of the associated nonzero-sum differential games under the proposed fixed-point iteration scheme. The approximation errors of the proposed algorithms are analyzed. Numerical examples are provided at the end to demonstrate the effectiveness of the proposed methods.","PeriodicalId":13201,"journal":{"name":"IEEE Transactions on Automatic Control","volume":"71 10","pages":"6773-6788"},"PeriodicalIF":7.0,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149072255","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

Risk-Sensitive Control With Multiarmed Bandit Adaptive Sampling 多臂强盗自适应采样的风险敏感控制

IF 7 1区计算机科学

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

Brian W. Rybicki;Jill K. Nelson

引用次数: 0

Learning to Avoid Tragedies: Boundedly Rational Agents in Feedback-Evolving Games 学习避免悲剧：反馈进化游戏中的有限理性代理

IF 7 1区计算机科学

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

R. Gavin;K. Paarporn;M. Cao

{"title":"Learning to Avoid Tragedies: Boundedly Rational Agents in Feedback-Evolving Games","authors":"R. Gavin;K. Paarporn;M. Cao","doi":"10.1109/TAC.2026.3685548","DOIUrl":"https://doi.org/10.1109/TAC.2026.3685548","url":null,"abstract":"Many populations of individuals interact with a common pool of resources. Examples include fishermen and their fisheries and herders and their common land for pasture. The framework of feedback-evolving games incorporates this game-environment feedback, in which a population’s actions affect a shared environment, and in turn, the changing environment shapes incentives for future behaviors. A primary assumption in these models is that agents employ imitative learning processes, leading to the replicator equation describing their behavior. In this article, we investigate the dynamics when agents follow the logit protocol, a boundedly rational and information-based learning process. The primary question we seek to address is whether this more sophisticated learning process can avert tragic outcomes in scenarios where simpler, imitative learning cannot. To do so, we fully characterize stability properties for all two-strategy evolutionary games with environmental feedback, and find that there are regimes where logit learning can avoid tragedies where imitation learning cannot. Interestingly, this can only occur for intermediate levels of rationality. Then, we propose optimal incentive policies that a system operator could implement to promote the health of the environment. We identify cases where, counterintuitively, raising the population’s rationality level leads to worse environmental outcomes when applying the optimal incentive policy.","PeriodicalId":13201,"journal":{"name":"IEEE Transactions on Automatic Control","volume":"71 10","pages":"6401-6415"},"PeriodicalIF":7.0,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149072279","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

Indefinite Time-Inconsistent Stochastic Linear-Quadratic Optimal Control Problem With Application 不定时间不一致随机线性二次最优控制问题及其应用

IF 7 1区计算机科学

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

Min Li;Na Li;Yuan Wang;Zhen Wu

引用次数: 0

Parameter Identification for FIR Systems With Simultaneously Quantized Inputs and Outputs Against Replay Attacks: A Stochastic Defense Scheme 同时量化输入和输出的FIR系统参数辨识对抗重放攻击：随机防御方案

IF 7 1区计算机科学

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

Qingxiang Zhang;Yanlong Zhao;Wenchao Xue;Jin Guo

{"title":"Parameter Identification for FIR Systems With Simultaneously Quantized Inputs and Outputs Against Replay Attacks: A Stochastic Defense Scheme","authors":"Qingxiang Zhang;Yanlong Zhao;Wenchao Xue;Jin Guo","doi":"10.1109/TAC.2026.3687459","DOIUrl":"10.1109/TAC.2026.3687459","url":null,"abstract":"Replay attacks disrupt the temporal correspondence between system inputs and outputs, significantly complicating system identification. While existing methods predominantly employ fixed time-point strategies for attack estimation, such deterministic approaches exhibit vulnerability to attacker reconnaissance, resulting in degraded detection performance or potential failures. This article proposes a stochastic defense scheme to enhance detection effectiveness and identification accuracy. Furthermore, diverging from conventional studies focused solely on single-threshold output quantization, we investigate system identification problem for finite impulse response with simultaneously quantized inputs and outputs against replay attacks. Regarding attack behavior analysis, random replay attacks' degradation effect on the nonattack quasi-convex combination estimator is evaluated. An energy-constrained optimization problem establishes optimal attack configurations that maximize NA-QCCE impairment while minimizing energy expenditure. For defense research, an indirect identification framework is developed using the stochastic data processing scheme. Corresponding defense algorithms via compensation-enhanced identification achieve consistent convergence in both attack strategy and system parameter. Feasibility of this algorithm preserves its asymptotic normality in parameter estimation. Minimum-variance identification is obtained via defense parameter optimization, with an actual implementation process provided for optimal deployment. All theorems and conclusions are experimentally validated via numerical simulations.","PeriodicalId":13201,"journal":{"name":"IEEE Transactions on Automatic Control","volume":"71 10","pages":"6541-6555"},"PeriodicalIF":7.0,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147739638","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

Toward Step-Size-Free Distributed Optimization: A Port-Hamiltonian Approach 迈向无步长分布优化：一个port - hamilton方法

IF 7 1区计算机科学

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

Rodrigo Aldana-López;Alessandro Macchelli;Giuseppe Notarstefano;Rosario Aragüés;Carlos Sagüés

{"title":"Toward Step-Size-Free Distributed Optimization: A Port-Hamiltonian Approach","authors":"Rodrigo Aldana-López;Alessandro Macchelli;Giuseppe Notarstefano;Rosario Aragüés;Carlos Sagüés","doi":"10.1109/TAC.2026.3687481","DOIUrl":"10.1109/TAC.2026.3687481","url":null,"abstract":"This article presents a novel distributed optimization technique that, under suitable assumptions on problem and communication graph, is able to operate with any step-size parameter, a capability not evident in previous methods. Traditionally, selecting the step size in distributed optimization often leads to a conservative performance, resulting in slow convergence or even divergence if the step size is incorrectly chosen. In this work, we propose a systems theory approach based on the port-Hamiltonian formalism to develop algorithms for consensus optimization problems. Starting from a continuous-time flow, we propose a distributed algorithm based on a discretized port-Hamiltonian system that works regardless of the step size. In addition, we introduce mixed implicit discretization, which lowers communication overhead while maintaining, under suitable conditions, the ability to converge with any step size. This feature is formally verified in specific scenarios and demonstrated experimentally in general cases with large step sizes. These results illustrate that the proposed method can utilize step sizes several orders of magnitude larger than those in previous work, where conventional methods fail, ultimately enhancing convergence speed.","PeriodicalId":13201,"journal":{"name":"IEEE Transactions on Automatic Control","volume":"71 10","pages":"6432-6446"},"PeriodicalIF":7.0,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11494283","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147735583","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