AutomaticaPub Date : 2025-05-28DOI: 10.1016/j.automatica.2025.112384
Yu Zhang , Zhuo Jin , Jiaqin Wei , George Yin
{"title":"A hybrid deep learning method for finite-horizon mean-field game problems","authors":"Yu Zhang , Zhuo Jin , Jiaqin Wei , George Yin","doi":"10.1016/j.automatica.2025.112384","DOIUrl":"10.1016/j.automatica.2025.112384","url":null,"abstract":"<div><div>This paper develops a new deep learning algorithm to solve a class of finite-horizon mean-field games. The proposed hybrid algorithm uses Markov chain approximation method combined with a stochastic approximation-based iterative deep learning algorithm. Under the framework of finite-horizon mean-field games, the induced measure and Monte-Carlo algorithm are adopted to establish the iterative mean-field interaction in Markov chain approximation method and deep learning, respectively. The Markov chain approximation method plays a key role in constructing the iterative algorithm and estimating an initial value of a neural network, whereas stochastic approximation is used to find accurate parameters in a bounded region. The convergence of the hybrid algorithm is proved; two numerical examples are provided to illustrate the results.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112384"},"PeriodicalIF":4.8,"publicationDate":"2025-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144154358","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":"Almost sure convergence of distributed optimization with imperfect information sharing","authors":"Hadi Reisizadeh , Anand Gokhale , Behrouz Touri , Soheil Mohajer","doi":"10.1016/j.automatica.2025.112391","DOIUrl":"10.1016/j.automatica.2025.112391","url":null,"abstract":"<div><div>We study convex distributed optimization problems where a set of agents are interested in solving a separable optimization problem collaboratively with imperfect information sharing over time-varying networks. A robust algorithm is designed to reduce communication load and meet rate constraints. We study the almost sure convergence of a two-time-scale decentralized gradient descent algorithm to reach the consensus on an optimizer of the objective loss function. One time scale fades out the imperfect incoming information from neighboring agents, and the second one adjusts the local loss functions’ gradients. We show that under certain conditions on the connectivity of the underlying time-varying network and the time-scale sequences, the dynamics converge almost surely to an optimal point supported in the optimizer set of the loss function.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112391"},"PeriodicalIF":4.8,"publicationDate":"2025-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144154338","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 : 2025-05-28DOI: 10.1016/j.automatica.2025.112386
Feng Yu, Dakuo He, Runda Jia, Zhizhong Mao
{"title":"Structure identification of time delay polynomial Hammerstein models","authors":"Feng Yu, Dakuo He, Runda Jia, Zhizhong Mao","doi":"10.1016/j.automatica.2025.112386","DOIUrl":"10.1016/j.automatica.2025.112386","url":null,"abstract":"<div><div>The structure identification of block-oriented nonlinear models is of great significance; however, the research in this area is still far from mature. This paper focuses on the structure identification of time delay Hammerstein models with polynomial nonlinearity. Identification involves estimating the order of the linear part, the order of the polynomial function, and the time delay. The proposed algorithm is derived by analyzing specific information matrices, which are based on sufficient excitation conditions. Additionally, this paper investigates the structure identification of the Hammerstein systems with arbitrary nonlinearities under the influence of measurement noise. An improved criterion is proposed to identify the structure of the linear part, which can also offer important information for determining the order of the polynomial function. Simulation experiments validate the effectiveness of the proposed algorithm.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112386"},"PeriodicalIF":4.8,"publicationDate":"2025-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144154356","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 : 2025-05-28DOI: 10.1016/j.automatica.2025.112394
Wenlu Liu , Chuandong Li , Xiaodi Li
{"title":"ISS-equilibrium with stability analysis for disturbed game-based impulsive systems","authors":"Wenlu Liu , Chuandong Li , Xiaodi Li","doi":"10.1016/j.automatica.2025.112394","DOIUrl":"10.1016/j.automatica.2025.112394","url":null,"abstract":"<div><div>This paper focuses on a class of two-player differential games subject to exogenous disturbances, where one player employs piecewise-continuous control, and the other uses impulsive control. Particularly, the exploration of equilibrium solution in differential games is accompanied by the stability performance analysis of relevant system. To be more specific, the construction of saddle point in zero-sum differential game and Nash equilibrium in nonzero-sum differential game is established under the Lyapunov criteria for input-to-state stability (<em>ISS</em>). Furthermore, owing to the existence of external disturbances and the characterization of <em>ISS</em> property, two extended equilibrium solution concepts are introduced. We propose the definition of <span><math><mi>ϵ</mi></math></span>-<em>ISS</em> saddle point and <span><math><mi>ϵ</mi></math></span>-<em>ISS</em> Nash equilibrium for which the corresponding verification theorems are formulated. Finally, two numerical experiments are provided to illustrate the proposed results.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112394"},"PeriodicalIF":4.8,"publicationDate":"2025-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144154357","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 : 2025-05-28DOI: 10.1016/j.automatica.2025.112387
Feng Ye , Xianghui Cao , Lin Cai , Mo-Yuen Chow
{"title":"False Noise Attack Detection for differentially-private distributed control of microgrids","authors":"Feng Ye , Xianghui Cao , Lin Cai , Mo-Yuen Chow","doi":"10.1016/j.automatica.2025.112387","DOIUrl":"10.1016/j.automatica.2025.112387","url":null,"abstract":"<div><div>Privacy preserving in distributed control is getting more attention, and differential privacy (DP) is the common tool to protect data privacy, in which additive noise is applied in the algorithm function. However, DP can be leveraged by false noise (FN) attacks because attack vectors can be disguised as artificial noise in DP. FN attacks are a concern as the stealth attacks are hard to detect. Moreover, DP in distributed control makes FN attack detection more difficult. Hence, detecting FN attacks in privacy-preserving distributed control is critical and challenging. In this paper, taking distributed energy management systems as the control object, we propose a novel peer-to-peer attack detection approach, named False Noise Attack Detection (FNAD). In FNAD, each device observes the power decisions of its neighbors based on the data from its two-hop neighbors, estimates the power decisions of its neighbors by a Kalman filter, and updates the detection index of each neighbor according to the residues of the Kalman filter at each iteration. The detection index is developed based on information entropy, without any prior knowledge of the FN attacks. If a device’s detection index is out of well-defined thresholds, its neighbors can perform a majority vote to decide whether it is malicious. We theoretically prove the detection effect of FNAD against three representative attacks in the literature and analyze the advantages of FNAD compared with the traditional methods. The effectiveness of FNAD is demonstrated by extensive simulations.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112387"},"PeriodicalIF":4.8,"publicationDate":"2025-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144154336","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 : 2025-05-23DOI: 10.1016/j.automatica.2025.112380
Brenner S. Rego , Davide M. Raimondo , Guilherme V. Raffo
{"title":"Line zonotopes: A tool for state estimation and fault diagnosis of unbounded and descriptor systems","authors":"Brenner S. Rego , Davide M. Raimondo , Guilherme V. Raffo","doi":"10.1016/j.automatica.2025.112380","DOIUrl":"10.1016/j.automatica.2025.112380","url":null,"abstract":"<div><div>This paper proposes new methods for set-based state estimation and active fault diagnosis (AFD) of linear descriptor systems (LDS). Unlike intervals, ellipsoids, and zonotopes, constrained zonotopes (CZs) can directly incorporate linear static constraints on state variables – typical of descriptor systems – into their mathematical representation, leading to less conservative enclosures. However, for LDS that are unstable or not fully observable, a bounded representation cannot ensure a valid enclosure of the states over time. To address this limitation, we introduce line zonotopes, a new representation for unbounded sets that retains key properties of CZs, including polynomial time complexity reduction methods, while enabling the description of strips, hyperplanes, and the entire <span><math><mi>n</mi></math></span>-dimensional Euclidean space. This extension not only generalizes the use of CZs to unbounded settings but can also enhance set-based estimation and AFD in both stable and unstable scenarios. Additionally, we extend the AFD method for LDS from Rego et al. (2020) to operate over reachable tubes rather than solely on the reachable set at the final time of the considered horizon. This reduces conservatism in input separation and enables more accurate fault diagnosis based on the entire output sequence. The advantages of the proposed methods over existing CZ-based approaches are demonstrated through numerical examples.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112380"},"PeriodicalIF":4.8,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144115140","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 : 2025-05-22DOI: 10.1016/j.automatica.2025.112381
Nan Bai , Qishao Wang , Zhisheng Duan , Changxin Liu
{"title":"Distributed model predictive control for optimal output consensus of multi-agent systems over directed graphs","authors":"Nan Bai , Qishao Wang , Zhisheng Duan , Changxin Liu","doi":"10.1016/j.automatica.2025.112381","DOIUrl":"10.1016/j.automatica.2025.112381","url":null,"abstract":"<div><div>In this paper, a distributed model predictive control (MPC) scheme is established to solve the optimal output consensus problem of heterogeneous multi-agent systems over directed graphs. Within the framework of MPC, we take both the control input and the consistent output state as decision variables to formulate a constrained optimization problem. Inspired by the primal decomposition technique and the push-sum dual average method, a distributed algorithm is designed to address the optimization problem. The convergence analysis of the proposed algorithm is given, which shows the convergence properties related to the number of iterations. Then, considering the limited computational resources in practical applications, an improved MPC-based approach with premature termination is further developed. The closed-loop stability is analyzed under the suboptimal MPC framework, deriving appropriate terminal conditions to guarantee the asymptotic consensus of multi-agent systems. Finally, numerical simulations demonstrate the effectiveness of the theoretical results.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"178 ","pages":"Article 112381"},"PeriodicalIF":4.8,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144116383","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 : 2025-05-21DOI: 10.1016/j.automatica.2025.112382
Tobias K.S. Ritschel , John Wyller
{"title":"An algorithm for distributed time delay identification without a priori knowledge of the kernel","authors":"Tobias K.S. Ritschel , John Wyller","doi":"10.1016/j.automatica.2025.112382","DOIUrl":"10.1016/j.automatica.2025.112382","url":null,"abstract":"<div><div>Time delays are ubiquitous in industry and nature, and they significantly affect both transient dynamics and stability properties. Consequently, it is often necessary to identify and account for the delays when, e.g., designing a model-based control strategy. However, identifying delays in differential equations is not straightforward and requires specialized methods. Furthermore, existing approaches for identifying <em>distributed</em> time delays in delay differential equations (DDEs) require that the functional form of the involved kernel (also called memory function) is known. In this work, we propose an algorithm for identifying distributed delays, which does not require a priori knowledge of the kernel. Specifically, we 1) approximate the unknown kernel in the DDEs by the probability density function of a mixed Erlang distribution and 2) use the linear chain trick (LCT) to transform the resulting DDEs into ODEs. Finally, the parameters in the kernel approximation are estimated as the solution to a dynamical maximum likelihood problem, and we use a single-shooting approach to approximate this solution. We demonstrate the efficacy of the algorithm using a numerical example that involves a point reactor kinetics model of a molten salt nuclear fission reactor.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"178 ","pages":"Article 112382"},"PeriodicalIF":4.8,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144107684","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":"Adaptive boundary control of the Kuramoto–Sivashinsky equation under intermittent sensing","authors":"Mohamed Camil Belhadjoudja, Mohamed Adlene Maghenem, Emmanuel Witrant, Christophe Prieur","doi":"10.1016/j.automatica.2025.112379","DOIUrl":"10.1016/j.automatica.2025.112379","url":null,"abstract":"<div><div>We study in this paper boundary stabilization, in the <span><math><msup><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> sense, of the perturbed Kuramoto–Sivashinsky (KS) equation subject to intermittent sensing. We assume that we measure the state on a given spatial subdomain during certain time intervals, while we measure the state on the remaining spatial subdomain during the remaining time intervals. We assign a feedback law at the boundary of the spatial domain and force to zero the value of the state at the junction of the two subdomains. Throughout the study, the equation’s destabilizing coefficient is assumed to be unknown and possibly space dependent but bounded. As a result, adaptive boundary controllers are designed under different assumptions on the perturbation. In particular, we guarantee input-to-state stability (ISS) when an upperbound on the perturbation’s size is known. Otherwise, only global uniform ultimate boundedness (GUUB) is guaranteed. In contrast, when the state is measured at every spatial point all the time (full state measurement), convergence to an arbitrarily-small neighborhood of the origin is guaranteed, even if the perturbation’s maximal size is unknown. Numerical simulations are performed to illustrate our results.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"178 ","pages":"Article 112379"},"PeriodicalIF":4.8,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144107683","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 : 2025-05-21DOI: 10.1016/j.automatica.2025.112371
Xiaodi Li , Ying Xing , Shiji Song
{"title":"Nonlinear impulsive control for stability of dynamical systems","authors":"Xiaodi Li , Ying Xing , Shiji Song","doi":"10.1016/j.automatica.2025.112371","DOIUrl":"10.1016/j.automatica.2025.112371","url":null,"abstract":"<div><div>This paper studies the stability problems for dynamical systems via nonlinear impulsive control, where the nonlinearity of the impulses is fully considered. We provide a set of Lyapunov-based sufficient conditions for local asymptotic stability (<em>LAS</em>) and the estimation of the domain of attraction, where a relationship among nonlinearity, the system structure, and impulse time sequences is established. To show the effects of nonlinearity on system performance, a novel finite-time contractive stability (<em>FTCS</em>) concept that characterizes the boundedness and finite-time contractive property of the system on the infinite domain is introduced. It shows that the nonlinearity is conducive to the stability of the system under certain conditions. Moreover, it can lead to a faster convergence speed compared to the linear case. Finally, two illustrative examples are given to verify the validity of the theoretical results.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"178 ","pages":"Article 112371"},"PeriodicalIF":4.8,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144107685","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}