Pub Date : 2025-11-21DOI: 10.1016/j.sysconle.2025.106293
Iasson Karafyllis , Filippos Vokos , Miroslav Krstic
This paper presents a complete inverse optimality study for a linearized tank-liquid system where the liquid is described by the viscous Saint-Venant model with surface tension and possible wall friction. We define an appropriate generalized solution notion for which we establish existence/uniqueness results with inputs that do not necessarily satisfy any compatibility condition as well as stabilization results with feedback laws that are constructed with the help of a Control Lyapunov Functional. We show that the proposed family of stabilizing feedback laws is optimal for a certain meaningful quadratic cost functional. Finally, we show that the optimal feedback law guarantees additional stronger stability estimates which are similar to those obtained in the case of classical solutions.
{"title":"A complete inverse optimality study for a tank-liquid system","authors":"Iasson Karafyllis , Filippos Vokos , Miroslav Krstic","doi":"10.1016/j.sysconle.2025.106293","DOIUrl":"10.1016/j.sysconle.2025.106293","url":null,"abstract":"<div><div>This paper presents a complete inverse optimality study for a linearized tank-liquid system where the liquid is described by the viscous Saint-Venant model with surface tension and possible wall friction. We define an appropriate generalized solution notion for which we establish existence/uniqueness results with inputs that do not necessarily satisfy any compatibility condition as well as stabilization results with feedback laws that are constructed with the help of a Control Lyapunov Functional. We show that the proposed family of stabilizing feedback laws is optimal for a certain meaningful quadratic cost functional. Finally, we show that the optimal feedback law guarantees additional stronger stability estimates which are similar to those obtained in the case of classical solutions.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"207 ","pages":"Article 106293"},"PeriodicalIF":2.5,"publicationDate":"2025-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145570066","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}
Pub Date : 2025-11-21DOI: 10.1016/j.sysconle.2025.106291
AnilKumar Badavath, Yogesh V. Hote
Dynamic load-altering attacks (DLAAs) pose a significant threat to power system stability, particularly when amplified by parametric uncertainties in the network model. This paper introduces a novel framework for robust stability analysis that, for the first time, unifies Kharitonov’s theorem for parametric uncertainty with input-to-state stability (ISS) theory for external disturbances. By modeling the perturbed system as a family of linear state–space models with interval parameters, the framework provides a rigorous method to certify stability against the entire uncertainty set. This integrated approach yields analytical bounds on disturbance amplification via the ISS gain and provides a systematic procedure for deriving critical proportional–integral controller gains that guarantee stability for all possible plant variations and bounded DLAAs. Validation on the WSCC 3-machine 9-bus system demonstrates the framework’s efficacy, identifying the most vulnerable parameter configurations and quantifying the system’s resilience with a computed worst-case ISS gain of 0.1462 under 10% parametric uncertainty. The work offers a computationally tractable pathway for vulnerability assessment and robust controller synthesis against coordinated DLAAs in uncertain power networks.
{"title":"Dynamic load-altering attacks in a perturbed power network: A stability analysis","authors":"AnilKumar Badavath, Yogesh V. Hote","doi":"10.1016/j.sysconle.2025.106291","DOIUrl":"10.1016/j.sysconle.2025.106291","url":null,"abstract":"<div><div>Dynamic load-altering attacks (DLAAs) pose a significant threat to power system stability, particularly when amplified by parametric uncertainties in the network model. This paper introduces a novel framework for robust stability analysis that, for the first time, unifies Kharitonov’s theorem for parametric uncertainty with input-to-state stability (ISS) theory for external disturbances. By modeling the perturbed system as a family of linear state–space models with interval parameters, the framework provides a rigorous method to certify stability against the entire uncertainty set. This integrated approach yields analytical bounds on disturbance amplification via the ISS gain and provides a systematic procedure for deriving critical proportional–integral controller gains that guarantee stability for all possible plant variations and bounded DLAAs. Validation on the WSCC 3-machine 9-bus system demonstrates the framework’s efficacy, identifying the most vulnerable parameter configurations and quantifying the system’s resilience with a computed worst-case ISS gain of 0.1462 under 10% parametric uncertainty. The work offers a computationally tractable pathway for vulnerability assessment and robust controller synthesis against coordinated DLAAs in uncertain power networks.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"207 ","pages":"Article 106291"},"PeriodicalIF":2.5,"publicationDate":"2025-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145570067","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}
Pub Date : 2025-11-15DOI: 10.1016/j.sysconle.2025.106288
Defeng He, Dingchao Wang, Jianbin Mu
This paper addresses the robustness and computational burden issues of economic model predictive control (MPC) for constrained nonlinear systems subject to unknown but bounded disturbances. A novel event-triggered robust economic MPC strategy is proposed for the uncertain systems within a min–max optimization framework. The controller is determined by online solving the receding horizon economic min–max optimal control problem subject to the contractive constraint of robust control objective function. Then the event-triggering mechanism on the constraint is designed to reduce the computational burden of solving the min–max optimization problem. Furthermore, sufficient conditions are established to guarantee the recursive feasibility and input-to-state stability of the robust economic MPC with respect to the disturbance. Finally, the effectiveness of the proposed strategy is validated through comparison simulations on a continuously stirred tank reactor.
{"title":"Event-triggered robust economic MPC of constrained nonlinear systems with bounded disturbances","authors":"Defeng He, Dingchao Wang, Jianbin Mu","doi":"10.1016/j.sysconle.2025.106288","DOIUrl":"10.1016/j.sysconle.2025.106288","url":null,"abstract":"<div><div>This paper addresses the robustness and computational burden issues of economic model predictive control (MPC) for constrained nonlinear systems subject to unknown but bounded disturbances. A novel event-triggered robust economic MPC strategy is proposed for the uncertain systems within a min–max optimization framework. The controller is determined by online solving the receding horizon economic min–max optimal control problem subject to the contractive constraint of robust control objective function. Then the event-triggering mechanism on the constraint is designed to reduce the computational burden of solving the min–max optimization problem. Furthermore, sufficient conditions are established to guarantee the recursive feasibility and input-to-state stability of the robust economic MPC with respect to the disturbance. Finally, the effectiveness of the proposed strategy is validated through comparison simulations on a continuously stirred tank reactor.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"207 ","pages":"Article 106288"},"PeriodicalIF":2.5,"publicationDate":"2025-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145570065","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}
In multi-agent networks, the objectives of the agents are often in conflict with each other. Most existing distributed optimization models optimize a single performance metric, which is usually a weighted sum of individual objectives. Thus it cannot fully reflect the trade-off among the objectives. In this paper, multi-objective distributed convex optimization problems with local optimal consensus in multi-agent systems are studied. A multi-objective distributed optimization algorithm based on the -constraint method is proposed and the convergence of the algorithm is proved. By changing value, the algorithm provides the decision maker with a set of representative efficient solutions to aid decision analysis. The effectiveness of the proposed method is verified through two numerical simulation examples. Furthermore, the proposed algorithm is applied to the classification problem with distributed data storage. The experimental results show that the proposed algorithm can effectively solve large-scale multi-objective optimization problems with distributed data storage.
{"title":"Local consensus based multi-objective distributed optimization and its application","authors":"Jieyuan Guo , Lizhen Shao , Quanxiu Lv , Shu Liang","doi":"10.1016/j.sysconle.2025.106290","DOIUrl":"10.1016/j.sysconle.2025.106290","url":null,"abstract":"<div><div>In multi-agent networks, the objectives of the agents are often in conflict with each other. Most existing distributed optimization models optimize a single performance metric, which is usually a weighted sum of individual objectives. Thus it cannot fully reflect the trade-off among the objectives. In this paper, multi-objective distributed convex optimization problems with local optimal consensus in multi-agent systems are studied. A multi-objective distributed optimization algorithm based on the <span><math><mi>ɛ</mi></math></span>-constraint method is proposed and the convergence of the algorithm is proved. By changing <span><math><mi>ɛ</mi></math></span> value, the algorithm provides the decision maker with a set of representative efficient solutions to aid decision analysis. The effectiveness of the proposed method is verified through two numerical simulation examples. Furthermore, the proposed algorithm is applied to the classification problem with distributed data storage. The experimental results show that the proposed algorithm can effectively solve large-scale multi-objective optimization problems with distributed data storage.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"207 ","pages":"Article 106290"},"PeriodicalIF":2.5,"publicationDate":"2025-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145521138","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}
Pub Date : 2025-11-12DOI: 10.1016/j.sysconle.2025.106285
Vivek S. Borkar
It has been observed by Belkin et al. that over-parametrized neural networks exhibit a ‘double descent’ phenomenon. That is, as the model complexity (as reflected in the number of features) increases, the test error initially decreases, then increases, and then decreases again. A counterpart of this phenomenon in the time domain has been noted in the context of epoch-wise training, viz., the test error decreases with the number of iterates, then increases, then decreases again. Another anomalous phenomenon is that of grokking wherein two regimes of descent are interrupted by a third regime wherein the mean loss remains almost constant. This note presents a plausible explanation for these and related phenomena by using the theory of two time scale stochastic approximation, applied to the continuous time limit of the gradient dynamics. This gives a novel perspective for an already well studied theme.
{"title":"A dynamic view of some anomalous phenomena in SGD for over-parametrized neural networks","authors":"Vivek S. Borkar","doi":"10.1016/j.sysconle.2025.106285","DOIUrl":"10.1016/j.sysconle.2025.106285","url":null,"abstract":"<div><div>It has been observed by Belkin et al. that over-parametrized neural networks exhibit a ‘double descent’ phenomenon. That is, as the model complexity (as reflected in the number of features) increases, the test error initially decreases, then increases, and then decreases again. A counterpart of this phenomenon in the time domain has been noted in the context of epoch-wise training, viz., the test error decreases with the number of iterates, then increases, then decreases again. Another anomalous phenomenon is that of <em>grokking</em> wherein two regimes of descent are interrupted by a third regime wherein the mean loss remains almost constant. This note presents a plausible explanation for these and related phenomena by using the theory of two time scale stochastic approximation, applied to the continuous time limit of the gradient dynamics. This gives a novel perspective for an already well studied theme.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"207 ","pages":"Article 106285"},"PeriodicalIF":2.5,"publicationDate":"2025-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145486183","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}
Pub Date : 2025-11-10DOI: 10.1016/j.sysconle.2025.106287
Arjan van der Schaft , Rodolphe Sepulchre , Thomas Chaffey
Physical systems with symmetry structures arise abundantly in applications, often admit scalable control laws, and are important building blocks in synthesis problems. The present paper focusses on linear reciprocal systems and input–output Hamiltonian systems. Their characterization is studied from an input–output, as well as from a state space point of view. Geometrically both are seen to define Lagrangian subspaces with corresponding generating functionals. Furthermore, the relation of reciprocity and input–output Hamiltonian structure with time reversibility is analyzed.
{"title":"Symmetry structures in linear physical systems","authors":"Arjan van der Schaft , Rodolphe Sepulchre , Thomas Chaffey","doi":"10.1016/j.sysconle.2025.106287","DOIUrl":"10.1016/j.sysconle.2025.106287","url":null,"abstract":"<div><div>Physical systems with symmetry structures arise abundantly in applications, often admit scalable control laws, and are important building blocks in synthesis problems. The present paper focusses on linear reciprocal systems and input–output Hamiltonian systems. Their characterization is studied from an input–output, as well as from a state space point of view. Geometrically both are seen to define Lagrangian subspaces with corresponding generating functionals. Furthermore, the relation of reciprocity and input–output Hamiltonian structure with time reversibility is analyzed.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"206 ","pages":"Article 106287"},"PeriodicalIF":2.5,"publicationDate":"2025-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145520544","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}
Pub Date : 2025-11-08DOI: 10.1016/j.sysconle.2025.106280
Peter E. Caines , Minyi Huang , Rinel Foguen-Tchuendom , Shuang Gao
Graphon Mean Field Games (GMFGs) (Caines and Huang, 2021) constitute generalizations of Mean Field Games (MFGs) for which the agents form subpopulations associated with the nodes of large graphs, where infinite cardinality graph node and edge limits are considered with limit graphons , The work in (Foguen-Tchuendom et al., (2021, 2022) [10],[11]) analyzed the stationarity of Nash equilibrium values with respect to node location for large populations of non-cooperative agents with linear dynamics on large graphs together with their limit graphons. The analysis in (Foguen-Tchuendom et al.,(2021, 2022) [10],[11]) is extended in this investigation to agent systems lying in the class of control affine non-linear systems (see Isidori (1985)). Specifically, control affine GMFG systems in an infinite network are treated where (i) at each node the drift of each generic agent system is affine in the control function, and (ii) the running costs at each node are exponentiated negative inverse quadratic functions of the difference between a generic state and the graphon weighted local mean field , which involves representing agent state distributions at different nodes. The GMFG equation system is proved to have a unique solution under a contraction condition, and the main result is that Nash equilibrium values are stationary with respect to the node location if the corresponding graphon weighted local mean field is stationary with respect to node location; the converse also holds if the model only has cost-coupling.
Graphon Mean Field game (gfgs) （Caines and Huang, 2021）构成了Mean Field game （MFGs）的泛化，其中agent形成与大图节点相关的子种群，其中无限基数图节点和边缘限制被考虑为极限图g(α,β), (α,β)∈[0,1]×[0,1]。（Foguen-Tchuendom et al.,(2021, 2022)[10],[11]）中的工作分析了在大图及其极限图上具有线性动态的大型非合作智能体群体的纳什均衡值相对于节点位置的平稳性。（Foguen-Tchuendom et al.,(2021, 2022)[10],[11]）中的分析在本研究中扩展到控制仿射非线性系统中的代理系统（见Isidori(1985)）。具体地说，对无限网络中的控制仿射GMFG系统进行处理，其中(i)在每个节点上α∈[0,1]，每个一般agent系统的漂移在控制函数中是仿射的；（ii）在每个节点上α的运行代价是一般状态与graphon g加权局部平均场Zα，g之差的负二次幂函数，其中涉及到代表不同节点上agent状态分布的μG - β，β∈[0,1]}。证明了GMFG方程系统在收缩条件下的唯一解，主要结果是：若对应的石墨加权局部平均场Zα，g相对于节点位置平稳，则纳什均衡值Vα相对于节点位置平稳；如果模型只有成本耦合，反之也成立。
{"title":"GMFG critical nodes for control affine systems with exponentiated costs","authors":"Peter E. Caines , Minyi Huang , Rinel Foguen-Tchuendom , Shuang Gao","doi":"10.1016/j.sysconle.2025.106280","DOIUrl":"10.1016/j.sysconle.2025.106280","url":null,"abstract":"<div><div>Graphon Mean Field Games (GMFGs) (Caines and Huang, 2021) constitute generalizations of Mean Field Games (MFGs) for which the agents form subpopulations associated with the nodes of large graphs, where infinite cardinality graph node and edge limits are considered with limit graphons <span><math><mrow><mi>g</mi><mrow><mo>(</mo><mi>α</mi><mo>,</mo><mi>β</mi><mo>)</mo></mrow></mrow></math></span>, <span><math><mrow><mrow><mo>(</mo><mi>α</mi><mo>,</mo><mi>β</mi><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow><mo>×</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow><mo>.</mo></mrow></math></span> The work in (Foguen-Tchuendom et al., (2021, 2022) [10],[11]) analyzed the stationarity of Nash equilibrium values with respect to node location for large populations of non-cooperative agents with linear dynamics on large graphs together with their limit graphons. The analysis in (Foguen-Tchuendom et al.,(2021, 2022) [10],[11]) is extended in this investigation to agent systems lying in the class of control affine non-linear systems (see Isidori (1985)). Specifically, control affine GMFG systems in an infinite network are treated where (i) at each node <span><math><mrow><mi>α</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow></mrow></math></span> the drift of each generic agent system is affine in the control function, and (ii) the running costs at each node <span><math><mi>α</mi></math></span> are exponentiated negative inverse quadratic functions of the difference between a generic state and the graphon <span><math><mi>g</mi></math></span> weighted local mean field <span><math><msup><mrow><mi>Z</mi></mrow><mrow><mi>α</mi><mo>,</mo><mi>g</mi></mrow></msup></math></span>, which involves <span><math><mrow><msub><mrow><mi>μ</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>≔</mo><mrow><mo>{</mo><msup><mrow><mi>μ</mi></mrow><mrow><mi>β</mi></mrow></msup><mo>,</mo><mi>β</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow><mo>}</mo></mrow></mrow></math></span> representing agent state distributions at different nodes. The GMFG equation system is proved to have a unique solution under a contraction condition, and the main result is that Nash equilibrium values <span><math><msup><mrow><mi>V</mi></mrow><mrow><mi>α</mi></mrow></msup></math></span> are stationary with respect to the node location <span><math><mrow><mi>α</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow></mrow></math></span> if the corresponding graphon weighted local mean field <span><math><msup><mrow><mi>Z</mi></mrow><mrow><mi>α</mi><mo>,</mo><mi>g</mi></mrow></msup></math></span> is stationary with respect to node location; the converse also holds if the model only has cost-coupling.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"206 ","pages":"Article 106280"},"PeriodicalIF":2.5,"publicationDate":"2025-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145467991","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}
Pub Date : 2025-11-07DOI: 10.1016/j.sysconle.2025.106286
Wenyang Jiang , Fenghe Li , Qingxiang Zhang , Fengwei Jing , Jin Guo
This paper investigates asymptotically consistent identification for finite impulse response (FIR) systems with binary-valued observations subject to sequence-type replay attacks. First, based on the attack frequency, all defense methods are categorized into two scenarios: known attack frequency and unknown attack frequency. Second, for these two cases, their respective convergence and asymptotic normality are analyzed. When the attack frequency is known, an improved identification algorithm based on error compensation is designed. For the unknown attack frequency scenario, the identifiability of the replay attack sequence is creatively analyzed, and an identification algorithm is developed to achieve optimal estimation accordingly. Finally, numerical simulations are conducted to validate the effectiveness of the proposed methods.
{"title":"Asymptotically consistent identification of FIR systems with binary-valued observations subject to sequence-type replay attacks","authors":"Wenyang Jiang , Fenghe Li , Qingxiang Zhang , Fengwei Jing , Jin Guo","doi":"10.1016/j.sysconle.2025.106286","DOIUrl":"10.1016/j.sysconle.2025.106286","url":null,"abstract":"<div><div>This paper investigates asymptotically consistent identification for finite impulse response (FIR) systems with binary-valued observations subject to sequence-type replay attacks. First, based on the attack frequency, all defense methods are categorized into two scenarios: known attack frequency and unknown attack frequency. Second, for these two cases, their respective convergence and asymptotic normality are analyzed. When the attack frequency is known, an improved identification algorithm based on error compensation is designed. For the unknown attack frequency scenario, the identifiability of the replay attack sequence is creatively analyzed, and an identification algorithm is developed to achieve optimal estimation accordingly. Finally, numerical simulations are conducted to validate the effectiveness of the proposed methods.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"206 ","pages":"Article 106286"},"PeriodicalIF":2.5,"publicationDate":"2025-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145467988","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}
Pub Date : 2025-11-05DOI: 10.1016/j.sysconle.2025.106282
Zhuo Ren, Yu Xue, Tingting Yu
This paper investigates the global exponential synchronization problem for multi-weighted coupled neural networks (MWCNNs) with multiple time-varying delays. A bounded real lemma (BRL) is firstly established based on the solutions of delayed MWCNNs, which can be used to derive that delayed MWCNNs reach global exponential synchronization. On the basis of the proposed BRL, an aperiodically intermittent controller (AIC) for delayed MWCNNs is proposed to improve synchronization performance. As no Lyapunov–Krasovskii functional (LKF) is constructed in the proposed method, the computational complexity is significantly reduced. Finally, the theoretical result is verified through a numerical example, and applied to encryption and decryption of color images.
{"title":"Global exponential H∞ synchronization of multi-weighted coupled neural networks with multiple time-varying delays","authors":"Zhuo Ren, Yu Xue, Tingting Yu","doi":"10.1016/j.sysconle.2025.106282","DOIUrl":"10.1016/j.sysconle.2025.106282","url":null,"abstract":"<div><div>This paper investigates the global exponential <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> synchronization problem for multi-weighted coupled neural networks (MWCNNs) with multiple time-varying delays. A bounded real lemma (BRL) is firstly established based on the solutions of delayed MWCNNs, which can be used to derive that delayed MWCNNs reach global exponential <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> synchronization. On the basis of the proposed BRL, an aperiodically intermittent controller (AIC) for delayed MWCNNs is proposed to improve synchronization performance. As no Lyapunov–Krasovskii functional (LKF) is constructed in the proposed method, the computational complexity is significantly reduced. Finally, the theoretical result is verified through a numerical example, and applied to encryption and decryption of color images.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"206 ","pages":"Article 106282"},"PeriodicalIF":2.5,"publicationDate":"2025-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145467989","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}
Pub Date : 2025-11-04DOI: 10.1016/j.sysconle.2025.106279
Anthony Hastir, Birgit Jacob
We study the Linear-Quadratic optimal control problem for a general class of infinite-dimensional passive systems, allowing for unbounded input and output operators. We show that under mild assumptions, the finite cost condition is always satisfied. Moreover, we give an explicit bound on the norm of the optimal cost operator. In the case where the system is energy preserving, the unique optimal control is given together with the corresponding optimal cost operator. In this case, we derive an explicit solution to an adapted operator Riccati equation. We apply our results to boundary control systems, first-order port-Hamiltonian systems and an Euler–Bernoulli beam with shear force control.
{"title":"LQ optimal control for infinite-dimensional passive systems","authors":"Anthony Hastir, Birgit Jacob","doi":"10.1016/j.sysconle.2025.106279","DOIUrl":"10.1016/j.sysconle.2025.106279","url":null,"abstract":"<div><div>We study the Linear-Quadratic optimal control problem for a general class of infinite-dimensional passive systems, allowing for unbounded input and output operators. We show that under mild assumptions, the finite cost condition is always satisfied. Moreover, we give an explicit bound on the norm of the optimal cost operator. In the case where the system is energy preserving, the unique optimal control is given together with the corresponding optimal cost operator. In this case, we derive an explicit solution to an adapted operator Riccati equation. We apply our results to boundary control systems, first-order port-Hamiltonian systems and an Euler–Bernoulli beam with shear force control.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"206 ","pages":"Article 106279"},"PeriodicalIF":2.5,"publicationDate":"2025-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145467990","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号