Automatica最新文献_第2页

Designated-time fault-tolerant stabilization for planar nonlinear systems with unknown time-varying powers and deferred constraints 具有未知时变功率和延迟约束的平面非线性系统的指定时间容错镇定

IF 5.9 2区计算机科学

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

Zong-Yao Sun , Shiji Ren , Zhuo Wang , Chih-Chiang Chen

引用次数: 0

Finite-time flocking behavior of the Cucker–Smale model on the infinite cylinder 无限圆柱上cucker - small模型的有限时间群集行为

IF 5.9 2区计算机科学

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

Xiaoyu Li , Yuhu Wu , Simone Fiori , Lining Ru

{"title":"Finite-time flocking behavior of the Cucker–Smale model on the infinite cylinder","authors":"Xiaoyu Li , Yuhu Wu , Simone Fiori , Lining Ru","doi":"10.1016/j.automatica.2026.112865","DOIUrl":"10.1016/j.automatica.2026.112865","url":null,"abstract":"<div><div>In this paper, we investigate the finite-time flocking problem for the multi-agent system on the infinite cylinder. We first generalize the finite-time flocking Cucker–Smale model from Euclidean space to the infinite cylinder <span><math><mrow><msup><mrow><mi>S</mi></mrow><mrow><mn>1</mn></mrow></msup><mo>×</mo><mi>R</mi></mrow></math></span> by exploiting the Lie group structure of <span><math><mrow><msup><mrow><mi>S</mi></mrow><mrow><mn>1</mn></mrow></msup><mo>×</mo><mi>R</mi></mrow></math></span>. We then analyze the emergent behavior of the proposed model and provide a sufficient condition for finite-time flocking. It is shown that the emergence of such behavior critically depends on the parameter <span><math><mi>β</mi></math></span> in the interaction weight function of the Cucker–Smale model. In particular, finite-time flocking occurs for <span><math><mrow><mi>β</mi><mo>≤</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></math></span>, while conditional flocking occurs for <span><math><mrow><mi>β</mi><mo>></mo><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></math></span>. Moreover, an upper bound on the convergence time is derived in terms of system parameters and initial states.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112865"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146134384","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

Some remarks on stochastic converse Lyapunov theorems 关于随机逆李雅普诺夫定理的若干注释

IF 5.9 2区计算机科学

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

Pavel Osinenko , Grigory Yaremenko

引用次数: 0

Continuum control design for traffic flow stabilization on circular roads: A microscopic–macroscopic approach 环形道路交通流稳定的连续控制设计：微观-宏观方法

IF 5.9 2区计算机科学

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

Sébastien Fueyo, Carlos Canudas de Wit

引用次数: 0

Observer-based passive/active fault diagnosis: A new optimization design perspective from state sets 基于观测器的被动/主动故障诊断：一种新的状态集优化设计视角

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-01-14 DOI: 10.1016/j.automatica.2026.112835

Yuxin Sun, Feng Xu

{"title":"Observer-based passive/active fault diagnosis: A new optimization design perspective from state sets","authors":"Yuxin Sun, Feng Xu","doi":"10.1016/j.automatica.2026.112835","DOIUrl":"10.1016/j.automatica.2026.112835","url":null,"abstract":"<div><div>This paper proposes a new observer-based method suitable for both passive and active fault diagnosis in discrete linear time-invariant systems, developed from an optimization design perspective using state estimation sets. First, based on the output-consistent state sets explicitly expressed as the Minkowski sum of a constrained zonotope and a subspace, this paper establishes an equivalent interpretation of the fault diagnosis criterion using state estimation sets instead of traditional output estimation sets. This provides a novel state estimation set-based design perspective to enhance fault diagnosis. Second, this paper introduces a new quantitative metric named separation tendency that quantifies the geometric relationship between two constrained zonotopes. The observer gain for each mode is optimized to facilitate fault diagnosis by maximizing the separation tendency of the orthogonal projections of the two constructed state estimation sets of that mode. Third, a distinctive feature of our design method compared to existing approaches is that the design of observer gains does not depend on the current system input, enabling the design of inputs after that of observer gains without the counteracting effect on the inputs from the observer gains. At the end of this paper, numerical examples are used to illustrate the effectiveness of the proposed method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112835"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963136","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

Randomized average consensus based on additive privacy sharing 基于加性隐私共享的随机平均共识

IF 5.9 2区计算机科学

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

Dongyu Li , Shanyao Ren , Hanzhou Wang , Jianwei Liu , Shuzhi Sam Ge

{"title":"Randomized average consensus based on additive privacy sharing","authors":"Dongyu Li , Shanyao Ren , Hanzhou Wang , Jianwei Liu , Shuzhi Sam Ge","doi":"10.1016/j.automatica.2026.112847","DOIUrl":"10.1016/j.automatica.2026.112847","url":null,"abstract":"<div><div>Distributed average consensus plays a crucial role in multi-agent systems. In data-sensitive applications, agents need to exchange state without disclosing true privacy. To address this issue, homomorphic encryption and random perturbations-based schemes are commonly adopted privacy-preserving approaches. However, homomorphic encryption is typically limited to scenarios where agents’ state values are non-negative integers with substantial computational overhead. On the other hand, random perturbation-based schemes often require prior knowledge of the total number of agents, rendering them ineffective in dynamic environments or vulnerable against external eavesdroppers. Motivated by this, we propose an additive secret-sharing method based on multiplication operations to achieve consensus among agents. Specifically, we first introduce random perturbations and exponentiation to true states. Based on this, each agent’s true state is decomposed into secret shares, which are then transmitted over public channels. We design the scheme to enable fundamental operations to be executed in a distributed manner, thereby facilitating distributed average consensus. This solution resists attacks from both honest-but-curious and global eavesdropping agents, under the condition that each node is connected to at least one trusted node. In comparison with differential privacy solutions, our approach achieves consensus by an exact state value. Furthermore, it has a lighter resource consumption and broader applicability than homomorphic encryption schemes. Simulation results show the feasibility and security of our approach.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112847"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189715","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

Passivity-based control of a double-pendulum crane using propagation of vibration suppression 基于振动抑制传播的双摆起重机无源控制

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-01-19 DOI: 10.1016/j.automatica.2026.112818

Ho Duc Tho , Kazuhiko Terashima , Takanori Miyoshi

{"title":"Passivity-based control of a double-pendulum crane using propagation of vibration suppression","authors":"Ho Duc Tho , Kazuhiko Terashima , Takanori Miyoshi","doi":"10.1016/j.automatica.2026.112818","DOIUrl":"10.1016/j.automatica.2026.112818","url":null,"abstract":"<div><div>The second swing angle information may not be strictly required to fully control the double-pendulum overhead crane (DPOC) system. Such an insight stems from the propagation of vibration suppression principle, which states that if either of the two swing angles is suppressed by control, both pendulums will cease to vibrate altogether. This intuition serves as the basis of the augmented passivity-based control law. The trolley velocity — the default command of most industrial cranes — is chosen as the system’s control input. Passivity properties of the system and the control law design are formulated based on a linearized model. The region of attraction (ROA) of the nonlinear closed-loop system is then computed using the sum-of-square (SOS) programming. The established controller does not require measurements or estimations of any rate or velocity signals. In the absence of the second swing angle information, the proposed approach can achieve similar control performance compared to existing full-state feedback controllers. An experimental result on a small-scale DPOC rig is also provided.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112818"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146000582","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

Non-zero-sum games in continuous-time nonlinear systems: Multiplayer cascaded solutions 连续时间非线性系统中的非零和游戏：多人级联解决方案

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-01-20 DOI: 10.1016/j.automatica.2026.112828

Yuzhe Chen , Ci Chen , Frank L. Lewis

{"title":"Non-zero-sum games in continuous-time nonlinear systems: Multiplayer cascaded solutions","authors":"Yuzhe Chen , Ci Chen , Frank L. Lewis","doi":"10.1016/j.automatica.2026.112828","DOIUrl":"10.1016/j.automatica.2026.112828","url":null,"abstract":"<div><div>This paper studies multiplayer nonzero-sum (NZS) games with an infinite horizon for nonlinear continuous-time (CT) systems with an emphasis on addressing the pervasive stability challenges encountered during the application of policy iteration methodologies. Central to this work is the introduction of the framework termed multiplayer cascaded policy iteration (MCPI), devised to iteratively approximate Nash equilibrium solutions within the realm of nonlinear NZS games. A salient feature of MCPI lies in its ability to ensure not only the stability of the iterative process but also its intriguing convergence equivalence with quasi-Newton iteration paradigms. Furthermore, building upon approximate dynamic programming technology, we present an extended effort in the development of an online algorithm. This algorithm leverages input and state data from the system to approximate the optimal solution online, eliminating the need for specific system parameters. Employing the apparatus of the approximation theorem, the algorithm approximates value functions and control policies, with the least squares method serving for weight updates. A rigorous proof of convergence substantiates the efficacy of the approximate solution, ensuring its eventual convergence to optimality. The efficacy of the developed method is validated through a numerical example.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112828"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146006432","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

Non-overshooting output shaping for switched linear systems under arbitrary switching using eigenstructure assignment 基于特征结构赋值的任意开关线性系统非超调输出整形

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-04-01 Epub Date: 2026-01-21 DOI: 10.1016/j.automatica.2026.112831

Kai Wulff , Maria Christine Honecker , Robert Schmid , Johann Reger

引用次数: 0

Data-driven model order reduction via T-SVD 基于T-SVD的数据驱动模型降阶

IF 5.9 2区计算机科学

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

Shenghan Mei , Ziqin He , Yidan Mei , Xin Mao , Anqi Dong , Ren Wang , Can Chen

{"title":"Data-driven model order reduction via T-SVD","authors":"Shenghan Mei , Ziqin He , Yidan Mei , Xin Mao , Anqi Dong , Ren Wang , Can Chen","doi":"10.1016/j.automatica.2026.112862","DOIUrl":"10.1016/j.automatica.2026.112862","url":null,"abstract":"<div><div>Model order reduction plays a crucial role in simplifying complex systems while preserving their essential dynamic characteristics, making it an invaluable tool in a wide range of applications, including robotic systems, signal processing, and fluid dynamics. However, traditional model order reduction techniques like balanced truncation are not designed to handle tensor data directly and instead require unfolding the data, which may lead to the loss of important higher-order structural information. In this article, we introduce a novel framework for data-driven model order reduction of T-product-based dynamical systems (TPDSs), which are often used to capture the evolution of third-order tensor data such as images and videos through the T-product, using tensor decomposition. Specifically, we develop advanced T-product-based techniques, including T-balanced truncation, T-balanced proper orthogonal decomposition, and the T-eigensystem realization algorithm for input–output TPDSs by leveraging the unique properties of T-singular value decomposition, which are fundamentally different from their matrix-based counterparts. We demonstrate that these techniques offer significant memory and computational savings while achieving reduction errors that are comparable to those of conventional methods. The effectiveness of the proposed framework is further validated through both synthetic and real-world examples.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112862"},"PeriodicalIF":5.9,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146134382","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