Pub Date : 2026-01-16DOI: 10.1016/j.automatica.2026.112826
Adrian P. Kennedy , Ashutosh Prasad , Suresh P. Sethi , Chi Chung Siu , Sheung Chi Phillip Yam
This paper studies the optimal advertising policy over the product life cycle of a semi-durable good whose failure rate is a design decision. The product’s adoption process draws from three sources of consumers, viz., innovators who find the product directly, consumers influenced by advertising, and loyal customers making replacements. The revenue stream is composed of the sales of new products, maintenance fees, and replacement sales. We propose a product diffusion model with both durable and non-durable properties and solve it using optimal control. The guidelines for advertising during new product diffusion are simple to implement due to explicit solutions. We make recommendations for the design of product durability and observe cases where higher failure rates are optimal. Finally, we extend our analysis to a game-theoretic framework, showcasing that the optimal advertising decisions remain tractable even in the context of competing manufacturers.
{"title":"Optimal advertising and product durability decisions in new product diffusion","authors":"Adrian P. Kennedy , Ashutosh Prasad , Suresh P. Sethi , Chi Chung Siu , Sheung Chi Phillip Yam","doi":"10.1016/j.automatica.2026.112826","DOIUrl":"10.1016/j.automatica.2026.112826","url":null,"abstract":"<div><div>This paper studies the optimal advertising policy over the product life cycle of a semi-durable good whose failure rate is a design decision. The product’s adoption process draws from three sources of consumers, viz., innovators who find the product directly, consumers influenced by advertising, and loyal customers making replacements. The revenue stream is composed of the sales of new products, maintenance fees, and replacement sales. We propose a product diffusion model with both durable and non-durable properties and solve it using optimal control. The guidelines for advertising during new product diffusion are simple to implement due to explicit solutions. We make recommendations for the design of product durability and observe cases where higher failure rates are optimal. Finally, we extend our analysis to a game-theoretic framework, showcasing that the optimal advertising decisions remain tractable even in the context of competing manufacturers.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112826"},"PeriodicalIF":5.9,"publicationDate":"2026-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145982057","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}
Pub Date : 2026-01-16DOI: 10.1016/j.automatica.2026.112827
Minghao Han , Kiwan Wong , Adrian Wing-Keung Law , Xunyuan Yin
In this work, we propose a meta-learning-based Koopman modeling and predictive control approach for nonlinear systems with parametric uncertainties. An adaptive deep meta-learning-based modeling approach, called Meta Adaptive Koopman Operator (MAKO), is proposed. Without knowledge of the parametric uncertainty, the proposed MAKO approach can learn a meta-model from a multi-modal dataset and efficiently adapt to new systems with previously unseen parameter settings by using online data. Based on the learned meta Koopman model, a predictive control scheme is developed, and the stability of the closed-loop system is ensured even in the presence of previously unseen parameter settings. Through extensive simulations, our proposed approach demonstrates superior performance in both modeling accuracy and control efficacy as compared to competitive baselines.
{"title":"MAKO: Meta-Adaptive Koopman Operators for learning-based model predictive control of parametrically uncertain nonlinear systems","authors":"Minghao Han , Kiwan Wong , Adrian Wing-Keung Law , Xunyuan Yin","doi":"10.1016/j.automatica.2026.112827","DOIUrl":"10.1016/j.automatica.2026.112827","url":null,"abstract":"<div><div>In this work, we propose a meta-learning-based Koopman modeling and predictive control approach for nonlinear systems with parametric uncertainties. An adaptive deep meta-learning-based modeling approach, called Meta Adaptive Koopman Operator (MAKO), is proposed. Without knowledge of the parametric uncertainty, the proposed MAKO approach can learn a meta-model from a multi-modal dataset and efficiently adapt to new systems with previously unseen parameter settings by using online data. Based on the learned meta Koopman model, a predictive control scheme is developed, and the stability of the closed-loop system is ensured even in the presence of previously unseen parameter settings. Through extensive simulations, our proposed approach demonstrates superior performance in both modeling accuracy and control efficacy as compared to competitive baselines.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112827"},"PeriodicalIF":5.9,"publicationDate":"2026-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145982058","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}
Pub Date : 2026-01-15DOI: 10.1016/j.automatica.2026.112830
Xiaomeng Chen , Kemi Ding , Subhrakanti Dey , Ling Shi
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.
{"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-01-15","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}
Pub Date : 2026-01-15DOI: 10.1016/j.automatica.2026.112836
Wenji Cao , Lu Liu , Dan Zhang , Gang Feng
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.
{"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-01-15","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}
Pub Date : 2026-01-15DOI: 10.1016/j.automatica.2026.112838
Juan Javier Palacios Roman , Sigurdur Hafstein , Peter Giesl , Sebastiaan van den Eijnden , Stefania Andersen , W.P.M.H. Heemels
In this paper, we present a method for constructing continuous piecewise quadratic (CPQ) Lyapunov functions for continuous-time switched and conewise linear systems using linear programming (LP). Key in our approach is the formulation of effective sufficient conditions for the copositivity of matrices via diagonal dominance. This formulation consists of linear constraints and can be expressed as an LP. It is shown that the sufficient conditions are also necessary conditions for the existence of a Lyapunov function, given a sufficiently refined CPQ function. We provide an in-depth comparison between our new method and other computational methods in the literature, and provide extensive numerical experiments on various switched and conewise linear systems. In particular, we show that the proposed method is the most accurate of the LP-based methods for constructing Lyapunov functions and is a numerically competitive alternative to LMI-based methods.
{"title":"Constructing piecewise quadratic Lyapunov functions with linear programming for continuous-time switched and conewise linear systems","authors":"Juan Javier Palacios Roman , Sigurdur Hafstein , Peter Giesl , Sebastiaan van den Eijnden , Stefania Andersen , W.P.M.H. Heemels","doi":"10.1016/j.automatica.2026.112838","DOIUrl":"10.1016/j.automatica.2026.112838","url":null,"abstract":"<div><div>In this paper, we present a method for constructing continuous piecewise quadratic (CPQ) Lyapunov functions for continuous-time switched and conewise linear systems using linear programming (LP). Key in our approach is the formulation of effective sufficient conditions for the copositivity of matrices via diagonal dominance. This formulation consists of linear constraints and can be expressed as an LP. It is shown that the sufficient conditions are also necessary conditions for the existence of a Lyapunov function, given a sufficiently refined CPQ function. We provide an in-depth comparison between our new method and other computational methods in the literature, and provide extensive numerical experiments on various switched and conewise linear systems. In particular, we show that the proposed method is the most accurate of the LP-based methods for constructing Lyapunov functions and is a numerically competitive alternative to LMI-based methods.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"186 ","pages":"Article 112838"},"PeriodicalIF":5.9,"publicationDate":"2026-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963137","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}
Pub Date : 2026-01-14DOI: 10.1016/j.automatica.2026.112835
Yuxin Sun, Feng Xu
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.
{"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-01-14","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}
Pub Date : 2026-01-14DOI: 10.1016/j.automatica.2026.112834
Ling Ma , Nicolas Vanspranghe , Daniele Astolfi , Vincent Andrieu , Mathieu Bajodek , Xuyang Lou
This paper addresses the feedback stabilization problem for a gantry crane system with input constraints. Such a system is described by a wave equation interconnected at the boundary conditions with a double integrator, which represents the top cart’s position and its speed. We propose a simple nested-saturation proportional derivative feedback which ensures that the control inputs remain within certain given limits. Global asymptotic stability of the origin of the closed-loop system is established. To this end, a new weak Lyapunov functional and a new methodology to study pre-compactness of solutions are introduced. Numerical simulations are presented to illustrate the effectiveness of the proposed control method.
{"title":"Nested saturation proportional–derivative control for conservative PDE–ODE interconnections: The gantry crane example","authors":"Ling Ma , Nicolas Vanspranghe , Daniele Astolfi , Vincent Andrieu , Mathieu Bajodek , Xuyang Lou","doi":"10.1016/j.automatica.2026.112834","DOIUrl":"10.1016/j.automatica.2026.112834","url":null,"abstract":"<div><div>This paper addresses the feedback stabilization problem for a gantry crane system with input constraints. Such a system is described by a wave equation interconnected at the boundary conditions with a double integrator, which represents the top cart’s position and its speed. We propose a simple nested-saturation proportional derivative feedback which ensures that the control inputs remain within certain given limits. Global asymptotic stability of the origin of the closed-loop system is established. To this end, a new weak Lyapunov functional and a new methodology to study pre-compactness of solutions are introduced. Numerical simulations are presented to illustrate the effectiveness of the proposed control method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112834"},"PeriodicalIF":5.9,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145962443","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}
In this paper, we propose a novel distributed state-feedback design for robust synchronization of networks of identical discrete-time nonlinear agents under generic time-invariant communication graphs. We focus on the class of almost differentiable (possibly time-varying) dynamics that are linear in the input. By generalizing results on synchronization of linear agents, we build strong links between the solution to the synchronization problem in the linear and nonlinear framework. This is also enabled by the introduction of new results on design of incrementally stabilizing controllers based on contraction analysis. Finally, we propose numerically tractable sufficient conditions for the synchronization of networks of non-smooth Lur’e systems.
{"title":"Incremental stabilization and multi-agent synchronization of discrete-time nonlinear systems","authors":"Samuele Zoboli , Daniele Astolfi , Vincent Andrieu , Giacomo Casadei , Luca Zaccarian","doi":"10.1016/j.automatica.2026.112832","DOIUrl":"10.1016/j.automatica.2026.112832","url":null,"abstract":"<div><div>In this paper, we propose a novel distributed state-feedback design for robust synchronization of networks of identical discrete-time nonlinear agents under generic time-invariant communication graphs. We focus on the class of almost differentiable (possibly time-varying) dynamics that are linear in the input. By generalizing results on synchronization of linear agents, we build strong links between the solution to the synchronization problem in the linear and nonlinear framework. This is also enabled by the introduction of new results on design of incrementally stabilizing controllers based on contraction analysis. Finally, we propose numerically tractable sufficient conditions for the synchronization of networks of non-smooth Lur’e systems.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112832"},"PeriodicalIF":5.9,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145978176","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}
Pub Date : 2026-01-12DOI: 10.1016/j.automatica.2025.112798
Luke Rickard , Alessandro Abate , Kostas Margellos
We investigate the problem of verifying different properties of discrete time dynamical systems, namely, reachability, safety and reach-while-avoid. To achieve this, we adopt a data-driven perspective and, using past system trajectories as data, we aim at learning a specific function termed certificate for each property we wish to verify. We seek to minimize a loss function, designed to encompass conditions on the certificate to be learned that encode the satisfaction of the associated property. Besides learning a certificate, we quantify probabilistically its generalization properties, namely, how likely it is for a certificate to be valid (and hence for the associated property to be satisfied) when it comes to a new system trajectory not included in the training data set. We view this problem under the realm of probably approximately correct (PAC) learning under the notion of compression, and use recent advancements of the so-called scenario approach to obtain scalable generalization bounds on the learned certificates. To achieve this, we design a novel algorithm that minimizes the loss function and hence constructs a certificate, and at the same time determines a quantity termed compression, which is instrumental in obtaining meaningful probabilistic guarantees. This process is novel per se and provides a constructive mechanism for compression set calculation, thus opening the road for its use to more general non-convex optimization problems. We verify the efficacy of our methodology on several numerical case studies, and compare it (both theoretically and numerically) with closely related results on data-driven property verification.
{"title":"Data-driven certificate synthesis","authors":"Luke Rickard , Alessandro Abate , Kostas Margellos","doi":"10.1016/j.automatica.2025.112798","DOIUrl":"10.1016/j.automatica.2025.112798","url":null,"abstract":"<div><div>We investigate the problem of verifying different properties of discrete time dynamical systems, namely, reachability, safety and reach-while-avoid. To achieve this, we adopt a data-driven perspective and, using past system trajectories as data, we aim at learning a specific function termed <em>certificate</em> for each property we wish to verify. We seek to minimize a loss function, designed to encompass conditions on the certificate to be learned that encode the satisfaction of the associated property. Besides learning a certificate, we quantify probabilistically its generalization properties, namely, how likely it is for a certificate to be valid (and hence for the associated property to be satisfied) when it comes to a new system trajectory not included in the training data set. We view this problem under the realm of probably approximately correct (PAC) learning under the notion of compression, and use recent advancements of the so-called scenario approach to obtain scalable generalization bounds on the learned certificates. To achieve this, we design a novel algorithm that minimizes the loss function and hence constructs a certificate, and at the same time determines a quantity termed compression, which is instrumental in obtaining meaningful probabilistic guarantees. This process is novel per se and provides a constructive mechanism for compression set calculation, thus opening the road for its use to more general non-convex optimization problems. We verify the efficacy of our methodology on several numerical case studies, and compare it (both theoretically and numerically) with closely related results on data-driven property verification.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112798"},"PeriodicalIF":5.9,"publicationDate":"2026-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145978177","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}
Pub Date : 2026-01-12DOI: 10.1016/j.automatica.2026.112833
Zhihua Guo, Xinjun Wang, Mingliang Tian, Jianing Hu
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 -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.
{"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-01-12","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号