IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-01-15 DOI: 10.1016/j.automatica.2026.112830

Xiaomeng Chen , Kemi Ding , Subhrakanti Dey , Ling Shi

{"title":"A linearly convergent distributed heavy-ball GNE seeking algorithm for aggregative games over weight-unbalanced digraphs via finite-time consensus","authors":"Xiaomeng Chen , Kemi Ding , Subhrakanti Dey , Ling Shi","doi":"10.1016/j.automatica.2026.112830","DOIUrl":"10.1016/j.automatica.2026.112830","url":null,"abstract":"<div><div>In this paper, we study the generalized Nash equilibrium (GNE) seeking problem for aggregative games with affine coupling constraints in a partial-decision information scenario. In this scenario, all players attempt to seek the GNE by exchanging messages with neighbors over strongly connected and weight-unbalanced directed graphs. To overcome the challenges posed by the asymmetric nature of communication matrices, we propose a novel accelerated distributed discrete-time primal–dual algorithm, which integrates finite-time exact ratio consensus (FTERC) and heavy-ball acceleration. Moreover, it is designed to accommodate uncoordinated stepsizes and momentum parameters, enhancing convergence rate. Despite the challenges introduced by uncoordinated elements and an additional momentum term, we present a rigorous analysis demonstrating that the proposed primal–dual algorithm achieves linear convergence to the GNE with constant uncoordinated stepsizes. Finally, we validate our theoretical results with numerical examples on two different communication graphs, demonstrating the effectiveness of the algorithm and how the momentum term enhances acceleration.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112830"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963135","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

Guaranteed bounds on the H2 performance of uncertain linear systems 不确定线性系统H2性能的保证界

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-02-02 DOI: 10.1016/j.automatica.2026.112853

Tommaso Casati , Clément Roos , Jean-Marc Biannic , Hélène Evain

{"title":"Guaranteed bounds on the H2 performance of uncertain linear systems","authors":"Tommaso Casati , Clément Roos , Jean-Marc Biannic , Hélène Evain","doi":"10.1016/j.automatica.2026.112853","DOIUrl":"10.1016/j.automatica.2026.112853","url":null,"abstract":"<div><div>The <span><math><msub><mrow><mi>H</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> norm is a fundamental metric in many control applications, and it is important to assess how this norm varies in the presence of model uncertainties. This paper proposes sufficient conditions to compute guaranteed lower and upper bounds on the <span><math><msub><mrow><mi>H</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> performance of uncertain linear systems. The proposed approach is particularly interesting as it can be applied to both deterministic and probabilistic evaluation of the <span><math><msub><mrow><mi>H</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> norm on continuous or discrete-time models. The main idea to compute guaranteed <span><math><msub><mrow><mi>H</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-norm bounds consists in solving a SemiDefinite Program characterized by Linear Matrix Inequalities at each point of a frequency grid. A Hamiltonian-based technique is then adopted to validate the results on a continuous frequency range. The method initially developed for deterministic <span><math><msub><mrow><mi>H</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> analysis is then integrated into a Branch and Bound scheme to compute hard bounds on the probability that the <span><math><msub><mrow><mi>H</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> performance of an uncertain system is either satisfied or violated. The developed algorithms are eventually applied to test cases of increasing complexity.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112853"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189717","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

Sign-perturbed sums method for multivariate ARX systems 多元ARX系统的符号摄动和方法

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-02-02 DOI: 10.1016/j.automatica.2026.112848

Masanori Oshima , Sanghong Kim , Yuri A.W. Shardt , Ken-Ichiro Sotowa

{"title":"Sign-perturbed sums method for multivariate ARX systems","authors":"Masanori Oshima , Sanghong Kim , Yuri A.W. Shardt , Ken-Ichiro Sotowa","doi":"10.1016/j.automatica.2026.112848","DOIUrl":"10.1016/j.automatica.2026.112848","url":null,"abstract":"<div><div>Assessing the accuracy of the dynamic model obtained using system identification is important before using it in a model-based control system. In practical situations, only finite-sample data is available to assess model accuracy, that is, it is not guaranteed that asymptotic theory, which assumes infinite-sample data, precisely assesses the model accuracy. The sign-perturbed sums (SPS) method can exactly assess the model accuracy using finite-sample, input–output data. The SPS method calculates the confidence region of the model parameters using the multiple data sets that are generated by randomly perturbing the signs of the noise innovations. This paper proposes an extended SPS method that can handle both open-loop and closed-loop multivariate systems with an autoregressive exogenous input (ARX) structure. Moreover, it is mathematically proved that the extension of the SPS method preserves the exactness of the confidence region. As well, the features of the SPS confidence region, such as star convexity and boundedness, are theoretically discussed for the case where the regressor is uncorrelated with the noise innovations. Finally, a numerical example is considered to show other features of the SPS confidence region, such as the degree of losing the exactness in the presence of violated assumptions and the change of the boundary as a function of the number of samples.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112848"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189719","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

Privacy-preserving distributed state estimation: A modified Paillier cryptosystem-based approach 保护隐私的分布式状态估计：一种改进的基于Paillier密码系统的方法

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-02-06 DOI: 10.1016/j.automatica.2026.112863

Xingquan Fu , Guanghui Wen , Dan Zhao , Christoforos N. Hadjicostis

{"title":"Privacy-preserving distributed state estimation: A modified Paillier cryptosystem-based approach","authors":"Xingquan Fu , Guanghui Wen , Dan Zhao , Christoforos N. Hadjicostis","doi":"10.1016/j.automatica.2026.112863","DOIUrl":"10.1016/j.automatica.2026.112863","url":null,"abstract":"<div><div>Privacy protection in distributed state estimation for multi-agent systems faces significant challenges due to its vulnerability to external eavesdropping and/or internal honest-but-curious (HBC) agents. Traditional methods often fail to adequately address these dual threats, leading to compromised privacy and communication overhead. To address these issues, this paper introduces a novel privacy-preserving distributed state estimation algorithm based on a modified Paillier cryptosystem. Compared with most existing privacy-preserving distributed state estimation algorithms, the proposed algorithm incorporates a secure covariance intersection fusion process that effectively reduces communication frequency while ensuring strong privacy protection. Specifically designed to defend against both external eavesdroppers and colluding HBC agents, the proposed estimator is shown to posses strong privacy guarantees under these threat models. Furthermore, rigorous mathematical proofs confirm the stability of the estimator by establishing that information matrices and estimation errors remain bounded under mild assumptions. Numerical simulations substantiate the algorithm’s effectiveness and superiority, highlighting enhanced estimation accuracy compared to existing privacy-preserving methods.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112863"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146134386","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

Informativity conditions for multiple signals: Properties, experimental design, and applications 多信号的信息性条件：性质、实验设计和应用

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-02-06 DOI: 10.1016/j.automatica.2026.112868

Ao Cao, Fuyong Wang

引用次数: 0

New insights into opacity verification in timed discrete-event systems 时间离散事件系统中不透明度验证的新见解

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-02-06 DOI: 10.1016/j.automatica.2026.112869

Weilin Deng , Daowen Qiu , Jingkai Yang

{"title":"New insights into opacity verification in timed discrete-event systems","authors":"Weilin Deng , Daowen Qiu , Jingkai Yang","doi":"10.1016/j.automatica.2026.112869","DOIUrl":"10.1016/j.automatica.2026.112869","url":null,"abstract":"<div><div>This paper investigates the verification of opacity in timed discrete-event systems (DESs) modeled as timed automata (TA), a problem known to be undecidable in general. We first address a theoretical gap left by recent work of An et al. (FM 2024) by establishing necessary and sufficient conditions for the decidability of <em>current-location timed opacity</em> (CLTO) in TA. As an instantiation of these conditions combined with known results on language inclusion, we show that CLTO is decidable for a subclass of TA, namely timed automata with integer resets (IRTA), and we also provide a corresponding verification algorithm. To enable decidability for general TA, we explore how to reduce the observational power of the intruder model in a way that remains realistic while ensuring decidability. Under the assumption that the intruder can only observe time in discrete units, we introduce the notion of <em>current-location timed opacity against intruders with discrete-time precision</em> (CLTO-IDTP) and develop a corresponding verification algorithm. These results provide a theoretical foundation for the security analysis of timed systems, offering a balance between modeling expressiveness and computational tractability.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112869"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146134385","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

Payload trajectory tracking control for aerial transportation systems with cable length online optimization 基于电缆长度在线优化的航空运输系统有效载荷轨迹跟踪控制

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-02-05 DOI: 10.1016/j.automatica.2026.112864

Hai Yu, Zhichao Yang, Wei He, Jianda Han, Yongchun Fang, Xiao Liang

{"title":"Payload trajectory tracking control for aerial transportation systems with cable length online optimization","authors":"Hai Yu, Zhichao Yang, Wei He, Jianda Han, Yongchun Fang, Xiao Liang","doi":"10.1016/j.automatica.2026.112864","DOIUrl":"10.1016/j.automatica.2026.112864","url":null,"abstract":"<div><div>Cable-suspended aerial transportation systems are employed extensively across various industries. The capability to flexibly adjust the relative position between the multirotor and the payload has spurred growing interest in the system equipped with variable-length cable, promising broader application potential. Compared to systems with fixed-length cables, introducing the variable-length cable adds a new degree of freedom. However, it also results in increased nonlinearity and more complex dynamic coupling among the multirotor, the cable and the payload, posing significant challenges in control design. This paper introduces a backstepping control strategy tailored for aerial transportation systems with variable-length cable, designed to precisely track the payload trajectory while dynamically adjusting cable length. Then, a cable length generator has been developed that achieves online optimization of the cable length while satisfying state constraints, thus balancing the multirotor’s motion and cable length changes without the need for manual trajectory planning. The asymptotic stability of the closed-loop system is guaranteed through Lyapunov techniques and the growth restriction condition. Finally, simulation results confirm the efficacy of the proposed method in managing trajectory tracking and cable length adjustments effectively.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112864"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146134391","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

Authors’ reply to ’Comment on ”Innovative non-asymptotic and robust estimation method using auxiliary modulating dynamical systems” [Automatica, 152(2023) 110953]’ 对“基于辅助调制动力系统的创新非渐近鲁棒估计方法”的评注[自动化学报，152(2023)110953]

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-02-13 DOI: 10.1016/j.automatica.2026.112866

Jie Liu, Da-Yan Liu, Driss Boutat, Xuefeng Zhang, Ze-Hao Wu

引用次数: 0

Optimal advertising and product durability decisions in new product diffusion 新产品扩散中的最优广告和产品耐久性决策

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-01-16 DOI: 10.1016/j.automatica.2026.112826

Adrian P. Kennedy , Ashutosh Prasad , Suresh P. Sethi , Chi Chung Siu , Sheung Chi Phillip Yam

引用次数: 0

Varying horizon learning economic MPC with unknown costs of disturbed nonlinear systems 扰动非线性系统的未知成本变视界学习经济MPC

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-02-03 DOI: 10.1016/j.automatica.2026.112856

Weiliang Xiong , Defeng He , Haiping Du , Jianbin Mu

引用次数: 0

Automatica最新文献