AutomaticaPub Date : 2026-03-01Epub Date: 2026-01-09DOI: 10.1016/j.automatica.2026.112824
Na Li , Lei Zou , Jiayue Sun , Derui Ding
{"title":"Fusion estimation for multi-rate systems with probabilistic quantization and transmission power constraints: A federated-filtering-based method","authors":"Na Li , Lei Zou , Jiayue Sun , Derui Ding","doi":"10.1016/j.automatica.2026.112824","DOIUrl":"10.1016/j.automatica.2026.112824","url":null,"abstract":"<div><div>The federated-filtering-based (FFB) fusion estimation problem is investigated in this paper for networked multi-rate systems, where the measurement signals are transmitted over a wireless network with limited transmission power. A probabilistic quantization mechanism is introduced to handle the raw measurement signals for the purpose of facilitating digital communication over network. Certain transmission models are proposed to describe the behaviors under the effects of multi-rate dynamics, probabilistic quantization and limited transmission power. A delicately designed FFB fusion scheme is proposed to acquire the desired state estimates, where the local filters will receive feedback from the fusion center to reset their estimates. The parameters for the local filters are calculated by recursively minimizing their upper-bounds for the estimation error covariances. Furthermore, new conditions have been derived to analyze the ultimately boundedness of the estimation error covariance for the fusion center. Subsequently, a power allocation strategy is designed by minimizing such ultimate bound subject to the given transmission power constraint. Finally, the effectiveness of the proposed fusion estimation strategy and its optimal power allocation scheme is verified through a simulation example.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112824"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145939237","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-22DOI: 10.1016/j.automatica.2025.112722
Masih Haseli , Jorge Cortés
{"title":"Modeling nonlinear control systems via Koopman Control Family: Universal forms and subspace invariance proximity","authors":"Masih Haseli , Jorge Cortés","doi":"10.1016/j.automatica.2025.112722","DOIUrl":"10.1016/j.automatica.2025.112722","url":null,"abstract":"<div><div>This paper introduces the Koopman Control Family (KCF), a mathematical framework for modeling general (not necessarily control-affine) discrete-time nonlinear control systems with the aim of providing a solid theoretical foundation for the use of Koopman-based methods in systems with inputs. We demonstrate that the concept of KCF captures the behavior of nonlinear control systems on a (potentially infinite-dimensional) function space. By employing a generalized notion of subspace invariance under the KCF, we establish a universal form for finite-dimensional models, which encompasses the commonly used lifted linear, bilinear, and linear switched models as specific instances. In cases where the subspace is not invariant under the KCF, we propose a method for approximating models in general form and characterize the model’s accuracy using the concept of invariance proximity. We end by discussing how the proposed framework naturally lends itself to data-driven modeling of control systems.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112722"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841742","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2026-01-15DOI: 10.1016/j.automatica.2026.112836
Wenji Cao , Lu Liu , Dan Zhang , Gang Feng
{"title":"Resilient fixed-time cooperative output regulation of heterogeneous linear multi-agent systems under denial-of-service attacks over detail-balanced directed graphs","authors":"Wenji Cao , Lu Liu , Dan Zhang , Gang Feng","doi":"10.1016/j.automatica.2026.112836","DOIUrl":"10.1016/j.automatica.2026.112836","url":null,"abstract":"<div><div>This paper investigates the resilient fixed-time cooperative output regulation problem of heterogeneous linear multi-agent systems under denial-of-service attacks over detail-balanced directed graphs. First, a novel distributed resilient fixed-time observer is proposed by accounting for denial-of-service attacks and detail-balanced directed graphs. Then, a novel distributed resilient fixed-time controller based on the proposed observer is developed. It is shown that under the proposed distributed controller, the resilient fixed-time cooperative output regulation problem for heterogeneous linear multi-agent systems under denial-of-service attacks over detail-balanced directed graphs is solved. Specifically, it is shown that the regulated output converges to zero in fixed time, where the upper bound of the settling time does not depend on the initial conditions of the concerned multi-agent system and is explicitly given. Finally, a simulation example is given to demonstrate the effectiveness of the proposed controller.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112836"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145978175","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2026-01-12DOI: 10.1016/j.automatica.2026.112833
Zhihua Guo, Xinjun Wang, Mingliang Tian, Jianing Hu
{"title":"Zonotopic state estimation and fault detection for discrete-time linear systems under DoS attacks: A switching controller design mechanism","authors":"Zhihua Guo, Xinjun Wang, Mingliang Tian, Jianing Hu","doi":"10.1016/j.automatica.2026.112833","DOIUrl":"10.1016/j.automatica.2026.112833","url":null,"abstract":"<div><div>This paper investigates the issues of zonotopic-based set-membership state estimation and fault detection for discrete-time linear systems with unknown but bounded (UBB) disturbance and noise under nonperiodic denial-of-service (DoS) attacks. Firstly, a novel zonotopic state observer is designed to obtain point-valued estimations for the considered system. To improve estimation accuracy, a decoupling method is simultaneously proposed to separate the disturbance from the error dynamics. Secondly, the discrete-time linear systems subjected to intermittent nonperiodic DoS attacks are restructured into a class of augmented switched systems, which comprises both a stable subsystem and an unstable subsystem. To guarantee the stability of the augmented system, a switching law is designed, which solves the instability problem of system under long-term or high-frequency DoS attacks. Based on Lyapunov stability theory, the exponential stability analysis and <span><math><msub><mrow><mi>l</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-gain performance analysis are presented for the augmented switched system. Moreover, the reachable set of the system state under nonperiodic DoS attacks and fault-free scenarios is obtained through reachability analysis. In addition, a more reliable set-membership fault detection strategy with the obtained reachable set and the residual signals is developed. Finally, some simulation results are provided to show the advantages of the theoretic results.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112833"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145978260","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-19DOI: 10.1016/j.automatica.2025.112782
Liwei An , Can Zhao , Guang-Hong Yang
{"title":"CBF-based safety design for adaptive control of uncertain nonlinear strict-feedback systems","authors":"Liwei An , Can Zhao , Guang-Hong Yang","doi":"10.1016/j.automatica.2025.112782","DOIUrl":"10.1016/j.automatica.2025.112782","url":null,"abstract":"<div><div>This paper studies the problem of adaptive tracking control for nonlinear strict-feedback systems with parametric uncertainties and safety constraints. A co-design strategy of control barrier functions (CBFs) and barrier Lyapunov functions (BLFs) is proposed, which inherits the robustness and stability of traditional adaptive backstepping controllers. First, a safe virtual control signal is generated by the CBF-induced quadratic programming (QP), which is the suboptimal and smooth solution of the QP with a shifting function. Then, a BLF-based backstepping controller is designed by following the safe virtual control signal. It is shown that the co-design can minimize the damage to the original tracking performance on the premise of safety guarantees. The distinguishing point of the safety design over the existing results is to avoid constructing the high-order CBFs that lead to conservative feasible sets of inputs for ensuring high-relative-degree safety constraints. The simulation results show that the proposed scheme achieves better tracking performance compared with the existing high-order CBF-based method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112782"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799183","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}
{"title":"The role of network connectivity in distributed k-agreement protocols","authors":"Gianluca Bianchin , Miguel Vaquero , Jorge Cortés , Emiliano Dall’Anese","doi":"10.1016/j.automatica.2025.112753","DOIUrl":"10.1016/j.automatica.2025.112753","url":null,"abstract":"<div><div>Given a network of agents, we say that the agents achieve a <span><math><mi>k</mi></math></span>-<em>agreement</em> when their state variables converge to a point that corresponds to the projection of the agents’ states onto a <span><math><mi>k</mi></math></span>-dimensional linear subspace. The <span><math><mi>k</mi></math></span>-agreement problem generalizes the classical consensus problem; unlike in consensus, where the agents’ states must asymptotically coincide, in <span><math><mi>k</mi></math></span>-agreement the agents reach an agreement in a generalized sense (within a linear subspace, where the states do not necessarily coincide). In this paper, we investigate which interaction topologies enable a network of agents to reach an agreement on a prescribed <span><math><mi>k</mi></math></span>-dimensional subspace through local coordination algorithms. We show that achieving <span><math><mi>k</mi></math></span>-agreement requires communication over highly connected graphs; specifically, the number of edges in the interaction graph must grow linearly with the dimension <span><math><mi>k</mi></math></span> of the agreement subspace. Our characterization reveals that the presence of cycles in the communication graph (particularly, independent families of cycles) constitutes the fundamental structural feature enabling the agents to achieve <span><math><mi>k</mi></math></span>-agreement. We also investigate the use of common graph topologies, such as path and circulant graphs, for <span><math><mi>k</mi></math></span>-agreement, deriving insights into the relationship between the subspace dimension <span><math><mi>k</mi></math></span> and the required network connectivity. The effectiveness of the proposed framework is demonstrated through simulations in robotic formation control problems.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112753"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884874","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-19DOI: 10.1016/j.automatica.2025.112790
Julian D. Schiller, Matthias A. Müller
{"title":"Nonlinear moving horizon estimation for robust state and parameter estimation","authors":"Julian D. Schiller, Matthias A. Müller","doi":"10.1016/j.automatica.2025.112790","DOIUrl":"10.1016/j.automatica.2025.112790","url":null,"abstract":"<div><div>We propose a moving horizon estimation scheme to estimate the states and the unknown constant parameters of general nonlinear uncertain discrete-time systems. The proposed framework and analysis explicitly do not involve the <em>a priori</em> verification of a particular excitation condition for the parameters. Instead, we use online information about the actual excitation of the parameters at any time during operation and ensure that the regularization term in the cost function is always automatically selected appropriately. This ensures that the state and parameter estimation error is bounded for all times, even if the parameters are never (or only rarely) excited during operation. Robust exponential stability of the state and parameter estimation error emerges under an additional uniform condition on the maximum duration of insufficient excitation. The theoretical results are illustrated by a numerical example.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112790"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145784443","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-19DOI: 10.1016/j.automatica.2025.112791
Zhenhua Deng, Cong Liu
{"title":"Distributed local-constraint-satisfied strategy for noncooperative games of autonomous general linear players and its application to smart grids","authors":"Zhenhua Deng, Cong Liu","doi":"10.1016/j.automatica.2025.112791","DOIUrl":"10.1016/j.automatica.2025.112791","url":null,"abstract":"<div><div>This paper studies constrained noncooperative games (NGs), which take the general linear dynamics of players into account. In the formulation, each player has local convex set constraints, and all players are restricted by coupling nonlinear inequality constraints. Notably, the majority of existing results for NGs with physical systems do not involve local constraints, let alone general convex sets. Besides, nearly all of related results cannot guarantee local constraints to be satisfied all the time, because physical players cannot control their decisions directly due to system dynamics. Here we develop a distributed adaptive strategy on the basis of gradient descent, projection operators, primal–dual methods and state feedback. The strategy is fully distributed. We analyze the strategy via variational analysis and Lyapunov theory. With our strategy, the players seek the exact variational generalized Nash equilibrium (v-GNE), and always satisfy local constraints, in contrast to existing results. Lastly, our method is applied to the electricity market games of doubly-fed induction generators.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112791"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145784447","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}
{"title":"qLPV state space models in companion form via realization of factorable neural networks","authors":"Deepti Khimani , Machhindranath Patil , Sharad Bhartiya","doi":"10.1016/j.automatica.2025.112812","DOIUrl":"10.1016/j.automatica.2025.112812","url":null,"abstract":"<div><div>This paper introduces novel companion form realizations for quasi-Linear Parameter Varying (qLPV) state space models obtained from input–output models, which are identified using neural networks (NN). The data for training the NN is generated from a multi-input, multi-output (MIMO) dynamic system. The method, at first, trains a (possibly deep) neural network to minimize one-step or multi-step prediction errors. If the layer activation functions of the NN satisfy a certain property, labeled as Lipschitz factorability, then the NN can be cast into a quasi-linear difference equation that describe the input–output dynamics of the nonlinear MIMO system. Such a NN consisting of Lipschitz factorable activation layers is termed as a Lipschitz factorable NN. Next, the input–output, qLPV difference equation is then realized into qLPV MIMO state space model in companion form via suitable state definitions. To demonstrate the effectiveness of the proposed method, such a realized qLPV state space model, identified from a trained NN, is used as the prediction model in a simulated sub-optimal nonlinear Model Predictive Control (MPC) example for a benchmark quadruple tank system, wherein voltages of two pumps are manipulated to control levels of two tanks.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112812"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145822794","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2026-01-03DOI: 10.1016/j.automatica.2025.112809
Yihuai Zhang , Jean Auriol , Huan Yu
{"title":"Operator learning for robust stabilization of linear Markov-jumping hyperbolic PDEs","authors":"Yihuai Zhang , Jean Auriol , Huan Yu","doi":"10.1016/j.automatica.2025.112809","DOIUrl":"10.1016/j.automatica.2025.112809","url":null,"abstract":"<div><div>This paper addresses the problem of robust stabilization for linear hyperbolic Partial Differential Equations (PDEs) with Markov-jumping parameter uncertainty. We consider a 2 × 2 heterogeneous hyperbolic PDE and propose a control law using operator learning and the backstepping method. Specifically, the backstepping kernels used to construct the control law are approximated with neural operators (NO) in order to improve computational efficiency. The key challenge lies in deriving the stability conditions with respect to the Markov-jumping parameter uncertainty and NO approximation errors. The mean-square exponential stability of the stochastic system is achieved through Lyapunov analysis, indicating that the system can be stabilized if the random parameters are sufficiently close to the nominal parameters on average, and NO approximation errors are small enough. The theoretical results are applied to freeway traffic control under stochastic upstream demands and then validated through numerical simulations.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112809"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884873","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}