Xianju Fang , Baoyong Zhang , Deming Yuan , Honglei Liu , Bo Song
{"title":"Broadcast-based asynchronous convex optimization using quantized distributed stochastic mirror descent algorithm","authors":"Xianju Fang , Baoyong Zhang , Deming Yuan , Honglei Liu , Bo Song","doi":"10.1016/j.sysconle.2025.106159","DOIUrl":"10.1016/j.sysconle.2025.106159","url":null,"abstract":"<div><div>We investigate a distributed convex optimization problem associated with a multi-agent network in this paper. Considering that there is no central coordinator in the network, each agent can only send information to its neighbors. For this case, a broadcast scheme based on asynchronous communication is adopted in this paper. Moreover, due to the limitation of network communication bandwidth, time-varying quantizers are used in data exchange. Then a broadcast-based quantized distributed stochastic mirror descent (B-QDSMD) algorithm is developed to solve the distributed convex optimization problem in the non-Euclidean sense. The performance of the algorithm with constant step size is also analyzed. It can be proved that the convergence of the algorithm is influenced by the selection of quantization solutions and step sizes for each agent. We also provide numerical examples to illustrate the applicability of the proposed algorithm.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"203 ","pages":"Article 106159"},"PeriodicalIF":2.1,"publicationDate":"2025-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144229882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Uniform approximation of exponential stability for an Euler–Bernoulli beam under bending moment feedback","authors":"Jiankang Liu , Bao-Zhu Guo","doi":"10.1016/j.sysconle.2025.106136","DOIUrl":"10.1016/j.sysconle.2025.106136","url":null,"abstract":"<div><div>Uniformly approximating infinite-dimensional systems, such as those described by partial differential equations (PDEs), using infinitely many systems described by ordinary differential equations is crucial for their application in engineering. This paper examines uniform exponential stability for a semi-discrete scheme applied to a one-dimensional Euler–Bernoulli beam with bending moment feedback, which is sharp contrast to scenarios involving shear force feedback control. For decades, establishing the exponential stability of this continuous PDE has posed a significant challenge, primarily due to the absence of an appropriate time domain multiplier. This obstacle, in a way, spurred the advancement of the frequency domain multiplier method in the 1980s. Notably, the frequency multiplier utilized here is a specified exponential function of both concerned varying real numbers and spacial variable, distinguishing it from recent studies on the Schrödinger equation. Consequently, the question of uniform stability for the semi-discrete scheme has remained unresolved for an extended period. In this paper, we first establish the exponential stability of the continuous system using the frequency domain method. Subsequently, we employ an order-reduction technique to devise a spatially semi-discretized finite difference scheme for this continuous system. Ultimately, to demonstrate the uniformly exponential stability of the resulting semi-discretized system, we adopt the discrete frequency domain method, with the proof mirroring the approach used for the continuous system. The approach presented in this paper, which effectively addresses the specified exponential function involving both concerned varying real numbers and spatial variables, holds potential for application to other PDEs that encounter analogous challenges.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"203 ","pages":"Article 106136"},"PeriodicalIF":2.1,"publicationDate":"2025-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144241135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A distributed Tikhonov-regularization algorithm for optimal Nash equilibrium computation in aggregative games","authors":"Xiaoyu Ma, Jinlong Lei, Peng Yi","doi":"10.1016/j.sysconle.2025.106142","DOIUrl":"10.1016/j.sysconle.2025.106142","url":null,"abstract":"<div><div>This paper aims to design a distributed coordination algorithm for solving a multi-agent decision-making problem with a hierarchical structure. The primary goal is to search the Nash equilibrium of a non-cooperative game where each player minimizes its private object with others’ strategies unchanged. Meanwhile, a specific social cost is taken into account during decision-making and is optimized within the equilibria of the underlying game. Such an optimal Nash equilibrium problem can be modeled as a distributed optimization problem with variational inequality constraints. We consider the scenario where the objective functions of both the underlying game and social cost optimization problem have a special aggregation structure. When each player has access only to its local objectives and cannot directly know the decisions of all players, a distributed algorithm is highly recommended. By utilizing the Tikhonov regularization and dynamical average tracking technique, we propose a distributed coordination algorithm by introducing an incentive term to the gradient-based Nash equilibrium seeking, so as to intervene in players’ decisions to improve the system efficiency. We prove its convergence to the optimal Nash equilibrium of a monotone aggregative game, and carry out numerical experiments to empirically demonstrate the algorithm performance.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"203 ","pages":"Article 106142"},"PeriodicalIF":2.1,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144222138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Energy-based approximation of linear systems with polynomial outputs","authors":"Linus Balicki, Serkan Gugercin","doi":"10.1016/j.sysconle.2025.106145","DOIUrl":"10.1016/j.sysconle.2025.106145","url":null,"abstract":"<div><div>Controllability and observability energy functions play a fundamental role in model order reduction and are inherently connected to optimal control problems. For linear dynamical systems the energy functions are known to be quadratic polynomials and various low-rank approximation techniques allow for computing them in a large-scale setting. For nonlinear problems computing the energy functions is significantly more challenging. In this paper, we investigate a special class of nonlinear systems that have a linear state and a polynomial output equation. We show that the energy functions of these systems are again polynomials and investigate under which conditions they can effectively be approximated using low-rank tensors. Further, we introduce a new perspective on the well-established balanced truncation method for linear systems which then readily generalizes to the nonlinear systems under consideration. This new perspective yields a novel energy-based model order reduction procedure that accurately captures the input–output behavior of linear systems with polynomial outputs via a low-dimensional reduced order model. We demonstrate the effectiveness of our approach via two numerical experiments.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"203 ","pages":"Article 106145"},"PeriodicalIF":2.1,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144211918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Privacy-preserving distributed adaptive estimation for non-stationary regression data","authors":"Shuning Chen , Die Gan , Siyu Xie , Jinhu Lü","doi":"10.1016/j.sysconle.2025.106147","DOIUrl":"10.1016/j.sysconle.2025.106147","url":null,"abstract":"<div><div>Distributed adaptive estimation techniques allow agents in multi-agent networks to cooperatively estimate system parameters, but directly sharing information among agents increases the risk of privacy breaches. In this paper, we consider the problem of estimating unknown time-varying parameters in a discrete-time stochastic regression model over multi-agent networks, with a focus on protecting data privacy. We propose a privacy-preserving distributed consensus-based normalized least mean square algorithm that protects the local information of agents by obfuscating the information exchanged. The proposed algorithm achieves rigorous differential privacy for sensitive information by incorporating persistent additive noise to the exchanged estimates. Furthermore, we analyze the stability of the proposed algorithm and establish the upper bound of the estimation error without assuming the independency or stationarity of the regression data. Some simulation results are presented to validate the effectiveness of our theoretical findings.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"203 ","pages":"Article 106147"},"PeriodicalIF":2.1,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144205241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of gradient descent algorithms: Discrete to continuous domains and circuit equivalents","authors":"He Hao , Daniel Silvestre , Carlos Silvestre","doi":"10.1016/j.sysconle.2025.106146","DOIUrl":"10.1016/j.sysconle.2025.106146","url":null,"abstract":"<div><div>In recent years, there have been several advances in iterative optimization algorithms seen as closed-loop control systems in discrete-time that solve unconstrained optimization problems. In this paper, we extend these advances to the continuous setting and leverage circuit equivalence to present a possible implementation of such controllers. Next, we address constrained Quadratic Programming (QP) challenges within a primal–dual framework that appears in many controller definitions. By drawing parallels between second-order ODEs and circuit dynamics, our study bridges theoretical optimization with practical electrical analogues that can be designed and implemented for problems in systems engineering, robotics, and autonomous vehicles that could benefit from the low power and latency of these optimization-based controllers.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"203 ","pages":"Article 106146"},"PeriodicalIF":2.1,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144205240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yuanxiu Teng , Li Yin , Yufeng Chen , Zhiwu Li , Xin Hu , Ahmed M. El-Sherbeeny
{"title":"Application of differential privacy in smart building systems","authors":"Yuanxiu Teng , Li Yin , Yufeng Chen , Zhiwu Li , Xin Hu , Ahmed M. El-Sherbeeny","doi":"10.1016/j.sysconle.2025.106144","DOIUrl":"10.1016/j.sysconle.2025.106144","url":null,"abstract":"<div><div>Smart buildings are an important component of urban intelligence due to their efficient information management and engineering control. The large amount of data stored and shared in smart building systems may expose the privacy of users. This work deals with initial resource configuration information protection in a probabilistic automaton framework, using state-based differential privacy. For given two adjacent initial states, a verification method for state-based differential privacy is provided to verify whether an attacker can identify with which state the system is initialized. An enforcement method is proposed to ensure that two systems with adjacent initial states can generate observations with similar probability distributions. The examples in this paper show that applying differential privacy in smart building systems can effectively protect initial state information.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"203 ","pages":"Article 106144"},"PeriodicalIF":2.1,"publicationDate":"2025-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144196376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A piecewise deterministic discrete-time model with simultaneous random jumps","authors":"Christian Ebenbauer, Raik Suttner","doi":"10.1016/j.sysconle.2025.106141","DOIUrl":"10.1016/j.sysconle.2025.106141","url":null,"abstract":"<div><div>In this paper, we propose a new stochastic discrete-time model, which is inspired by the established model of a continuous-time piecewise deterministic Markov process. The discrete-time dynamics consist of deterministic motion and random jumps. The deterministic motion is given by the direction of a drift vector field. The random jumps are triggered by a finite number of independent count processes and the corresponding state transitions are given by jump vector fields. One may think of the discrete-time system as an input-affine with drift, where the count processes act as inputs in the directions of the jump vector fields. In each time step, we allow an activation of multiple jump vector fields, which is different from the corresponding continuous-time model in which, almost surely, only one jump occurs at each time instant. The proposed discrete-time model also includes a user-prescribed step size, which allows approximations of continuous-time processes. In the limit of vanishing step size, the sample paths of the discrete-time model converge almost surely to the sample paths of a continuous-time piecewise deterministic Markov process. We also characterize mean-square exponential stability of the model under the assumption of linear drift and jump vector fields. The findings are applied to a linear discrete-time state-feedback system with random state measurements.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"203 ","pages":"Article 106141"},"PeriodicalIF":2.1,"publicationDate":"2025-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144189711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Constrained quadratic control for Markov jump systems with multiplicative noise","authors":"Siqin Liao , Zheng-Guang Wu , Yuanqing Wu","doi":"10.1016/j.sysconle.2025.106097","DOIUrl":"10.1016/j.sysconle.2025.106097","url":null,"abstract":"<div><div>In this paper, the constrained quadratic control problem of discrete-time Markov jump systems with multiplicative noise in both state and control input is studied. An asynchronous hidden Markov model with a partially known transition probability is constructed as the controller model of the system taking into account the mode mismatch between the system and the controller and the unavailable transition probability of the controller. Under the feedback control of the asynchronous controller, the conditions for the system to achieve stochastic stability are given by using the linear matrix inequality method. In addition, when the initial conditions satisfy the invariant set of constraints, the state and control sequences are guaranteed to satisfy the desirable constraints. Solving the linear matrix inequality optimization problem also yields a cost upper bound for quadratic functions. The effectiveness and superiority of the theoretical results are finally validated by numerical instances.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"203 ","pages":"Article 106097"},"PeriodicalIF":2.1,"publicationDate":"2025-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144196375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Boundary stabilization of star-shaped Saint-Venant networks with combined subcritical and supercritical channels","authors":"Amaury Hayat , Yating Hu , Peipei Shang","doi":"10.1016/j.sysconle.2025.106135","DOIUrl":"10.1016/j.sysconle.2025.106135","url":null,"abstract":"<div><div>In this work, we consider the boundary stabilization of a star-shaped water flow network composed by <span><math><mi>n</mi></math></span> (<span><math><mrow><mi>n</mi><mo>≥</mo><mn>3</mn></mrow></math></span>) channels. Each channel is modeled by Saint-Venant equations with arbitrary friction and slope. Among which, two channels are in supercritical regime, while the remaining <span><math><mrow><mi>n</mi><mo>−</mo><mn>2</mn></mrow></math></span> channels are in subcritical regime. We show that in this case, one only needs to apply a static feedback control at the inlet of a supercritical channel to achieve the exponential stability of the non-uniform steady-states in the <span><math><msup><mrow><mi>H</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> norm. The main tool we employ is the Lyapunov approach. To validate our theoretical results, a numerical illustration is also given.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"203 ","pages":"Article 106135"},"PeriodicalIF":2.1,"publicationDate":"2025-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144177825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}