{"title":"Resilient abstraction-based hierarchical control of linear systems","authors":"Elnaz Firouzmand, H.A. Talebi, Iman Sharifi","doi":"10.1016/j.sysconle.2025.106028","DOIUrl":"10.1016/j.sysconle.2025.106028","url":null,"abstract":"<div><div>This paper develops a resilient hierarchical control structure for cyber–physical systems (CPSs) using an extended resilient approximate simulation function. Data transmission through wireless communication channels in CPSs is vulnerable to cyber-attacks. Furthermore, these systems may be modeled using linear dynamics with high-state dimensions. Hence, the control synthesis problem for concrete systems is computationally challenging. The extended resilient approximate simulation function introduced in this paper enables the use of an abstract system for computationally efficient controller design. This function is mathematically defined as the sum of the resilient approximate simulation function between the abstract model and the unknown input observer (UIO), and the simple approximate simulation function between the UIO and the concrete system. Accordingly, the controller can first be designed for the abstract system and then refined for the concrete system by introducing an appropriate interface controller. This controller constitutes an observer-based robust control law based on <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> to guarantee the desired performance despite external disturbances and includes an adaptive compensator to mitigate the effect of attacks on the simulation relation. The applicability of the presented approach is demonstrated through two case studies: load frequency control in a power system and frequency regulation in an isolated area of the New England 39-Bus Test System.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"197 ","pages":"Article 106028"},"PeriodicalIF":2.1,"publicationDate":"2025-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143171856","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":"Practical considerations for implementing robust-to-early termination model predictive control","authors":"Mohsen Amiri, Mehdi Hosseinzadeh","doi":"10.1016/j.sysconle.2024.106018","DOIUrl":"10.1016/j.sysconle.2024.106018","url":null,"abstract":"<div><div>Model Predictive Control (MPC) is widely used to achieve performance objectives, while enforcing operational and safety constraints. Despite its high performance, MPC often demands significant computational resources, making it challenging to implement in systems with limited computing capacity. A recent approach to address this challenge is to use the Robust-to-Early Termination (REAP) strategy. At any time instant, REAP converts the MPC problem into the evolution of a virtual dynamical system whose trajectory converges to the optimal solution, and provides guaranteed sub-optimal and feasible solution whenever its evolution is terminated due to limited computational power. REAP has been introduced as a continuous-time scheme and its theoretical properties have been derived under the assumption that it performs all the computations in continuous time. However, REAP should be practically implemented in discrete-time. This paper focuses on the discrete-time implementation of REAP, exploring conditions under which anytime feasibility and convergence properties are maintained when the computations are performed in discrete time. The proposed methodology is validated and evaluated through extensive simulation and experimental studies.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106018"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182057","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":"Model-free predictive iterative learning safety-critical consensus control for multi-agent systems with randomly varying trial lengths","authors":"Rui Xu, Hua Chen, Yao Tang, Xinyuan Long","doi":"10.1016/j.sysconle.2024.105987","DOIUrl":"10.1016/j.sysconle.2024.105987","url":null,"abstract":"<div><div>In this paper, a model-free predictive iterative learning control (MFPILC) is proposed for a class of nonlinear and nonaffine single-input multiple-output (SIMO) discrete-time multi-agent systems with randomly varying trial lengths, input time-varying delay and nonrepetitive external disturbances to deal with the safety-critical consensus control problem. First, the agent dynamics are transformed into a novel dynamic linearization data model along the iteration axis containing the upper and lower bound of the unknown input time delay with an unknown system parameter pseudo gradient (PG). A steepest-descent estimation algorithm updated along the iterative learning axis is applied to deal with the unknown PG and the unknown non-repetitive external disturbances. Further, the predictive compensation mechanisms are proposed to address the problem of data loss caused by the varying trial lengths at each iteration of the MASs. Therefore, a predictive iterative learning consensus control method is designed for MASs based on consensus error and data compensation mechanisms. Moreover, a new model-free predictive iterative learning safety-critical consensus control combined with a discrete-time iterative learning control barrier function (ILCBF) is presented to ensure the output safety of nonlinear MASs. Finally, simulation results further verify the effectiveness of the proposed method.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105987"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183241","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}
José E. Márquez-Prado , Onésimo Hernández-Lerma , Héctor Jasso-Fuentes
{"title":"Myopic optimal strategies for a class of continuous-time deterministic and stochastic control problems","authors":"José E. Márquez-Prado , Onésimo Hernández-Lerma , Héctor Jasso-Fuentes","doi":"10.1016/j.sysconle.2024.106016","DOIUrl":"10.1016/j.sysconle.2024.106016","url":null,"abstract":"<div><div>We give conditions for a class of continuous-time deterministic and stochastic optimal control problems to have <em>myopic optimal strategies</em>, that is, optimal controls obtained by solving optimization problems independent of the state trajectory. We show how these sufficient conditions are the same for the deterministic and stochastic cases, which means that the <em>certainty equivalence principle</em> is satisfied. Moreover, for the infinite-horizon time-homogeneous case, myopic optimal strategies are obtained by solving a single optimization problem; hence, optimal controls are constant functions.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106016"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adaptive output feedback containment control for parabolic PDE multi-agent systems","authors":"Li Tang, Feixia Liu","doi":"10.1016/j.sysconle.2024.105994","DOIUrl":"10.1016/j.sysconle.2024.105994","url":null,"abstract":"<div><div>This paper investigates the output feedback containment control problem of multi-agent systems (MASs) with multiple leaders described by partial differential equations (PDEs). In contrast to MASs modeled by ODEs, the PDEs system studied in this paper considers additional spatial variables, which leads to traditional ODEs control design methods inapplicable, then the design of observer based adaptive distributed protocols is more challenging. Considering that leaders may be task-driven, the control inputs of the leaders are non-zero and time-varying. Through the introduction of nonlinear terms in the containment controller to eliminate the influence of leader control inputs, the paper ultimately achieves bounded tracking errors and containment errors for agents under undirected graph topologies. Finally, the designed control scheme is validated through examples.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105994"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183652","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":"Adaptive leaderless consensus of MIMO multi-agent systems with unknown dynamics and nonlinear dynamic uncertainties","authors":"Yanhua Yang, Jie Mei, Guangfu Ma","doi":"10.1016/j.sysconle.2024.105983","DOIUrl":"10.1016/j.sysconle.2024.105983","url":null,"abstract":"<div><div>In this paper, the bipartite consensus problem of a class of unknown uncertain multi-agent systems (MASs) under a signed graph is investigated via a filter-based model-free reinforcement learning (RL) based fully distributed control scheme. First, considering the completely unknown dynamics of the agents, a novel filter-based model-free RL algorithm is proposed to learn the stabilizable feedback gain matrix via the online input–output data. Then, fully distributed algorithm with adaptive control gains is designed such that all agents reach bipartite consensus in the presence of dynamic uncertainties. Finally, a numerical simulation is illustrated to demonstrate the correctness and effectiveness of the proposed control scheme.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105983"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183246","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":"Formal safety verification of non-deterministic systems based on probabilistic reachability computation","authors":"Yuminghao Xiao, Tianbing Xia, Hongdong Wang","doi":"10.1016/j.sysconle.2024.106014","DOIUrl":"10.1016/j.sysconle.2024.106014","url":null,"abstract":"<div><div>In this paper, we develop a formal safety verification method based on analytic probabilistic reachability computation, which can estimate the probability of controlled non-deterministic systems entering unsafe states subject to disturbances. Specifically, we employ stochastic differential equations (SDEs) to describe the dynamics of the system and resort to a regularized indicator function to express the collision probability between the state trajectory of the system and unsafe states. We proceed to formulate this collision probability as the viscosity solution to a second-order variational-inequality and provide a rigorous proof for such a novel interpretation. Moreover, we discuss the ENO-Godunov scheme for solving the deduced variational-inequality, which obviates the need for Monte-Carlo simulations and the optimality condition along a complex boundary. The developed framework offers a structured approach to identify potential risks in safety critical systems and maintains a user-friendly implementation. Lastly, we demonstrate the above application in a safety verification problem related to maritime navigation.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106014"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182972","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":"On computation of approximate solutions to large-scale backstepping kernel equations via continuum approximation","authors":"Jukka-Pekka Humaloja, Nikolaos Bekiaris-Liberis","doi":"10.1016/j.sysconle.2024.105982","DOIUrl":"10.1016/j.sysconle.2024.105982","url":null,"abstract":"<div><div>We provide two methods for computation of continuum backstepping kernels that arise in control of continua (ensembles) of linear hyperbolic PDEs and which can approximate backstepping kernels arising in control of a large-scale, PDE system counterpart (with computational complexity that does not grow with the number of state components of the large-scale system). In the first method, we provide explicit formulae for the solution to the continuum kernels PDEs, employing a (triple) power series representation of the continuum kernel and establishing its convergence properties. In this case, we also provide means for reducing computational complexity by properly truncating the power series (in the powers of the ensemble variable). In the second method, we identify a class of systems for which the solution to the continuum (and hence, also an approximate solution to the respective large-scale) kernel equations can be constructed in closed form. We also present numerical examples to illustrate computational efficiency/accuracy of the approaches, as well as to validate the stabilization properties of the approximate control kernels, constructed based on the continuum.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105982"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182995","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}
Muhammad Zaki Almuzakki , Bayu Jayawardhana , Aneel Tanwani , Antonis I. Vakis
{"title":"Exponential stabilization of linear systems using nearest-action control with countable input set","authors":"Muhammad Zaki Almuzakki , Bayu Jayawardhana , Aneel Tanwani , Antonis I. Vakis","doi":"10.1016/j.sysconle.2024.105992","DOIUrl":"10.1016/j.sysconle.2024.105992","url":null,"abstract":"<div><div>This paper studies stabilization of linear time-invariant (LTI) systems when control actions can only be realized in <em>finitely</em> many directions where it is possible to actuate uniformly or logarithmically extended positive scaling factors in each direction. Furthermore, a nearest-action selection approach is used to map the continuous measurements to a realizable action where we show that the approach satisfies a <em>weak</em> sector condition for multiple-input multiple-output (MIMO) systems. Using the notion of input-to-state stability, under some assumptions imposed on the transfer function of the system, we show that the closed-loop system converges to the target ball exponentially fast. Moreover, when logarithmic extension for the scaling factors is realizable, the closed-loop system is able to achieve asymptotic stability instead of only practical stability. Finally, we present an example of the application that confirms our analysis.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105992"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182999","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":"Detectability of linear stochastic impulsive systems with state-dependent noises","authors":"Shixian Luo , Xin Chen , Feiqi Deng , Yan Jiang","doi":"10.1016/j.sysconle.2024.105989","DOIUrl":"10.1016/j.sysconle.2024.105989","url":null,"abstract":"<div><div>This paper focuses on the characterization of moment detectability and almost sure detectability for linear stochastic impulsive systems. The concepts and characterizations of the <span><math><mrow><mn>2</mn><mi>p</mi></mrow></math></span>th moment detectability and almost sure detectability are first introduced. Two expanded systems, the state-expanded stochastic system and the moment equation, are established by utilizing the generalized <span><math><mi>H</mi></math></span>-representation technique. A series of geometric and algebraic conditions for the <span><math><mrow><mn>2</mn><mi>p</mi></mrow></math></span>th moment detectability of the linear stochastic impulsive systems are established by analyzing the 2nd moment detectability of the state-expanded system and the complete detectability of the moment equation. Subsequently, by introducing a strictly positive-definite quasi-periodic composite polynomial Lyapunov candidate, almost sure detectability criteria are framed in terms of linear matrix inequalities, showing that almost sure detectability is less conservative than moment detectability. Finally, two numerical examples with comparisons are provided to illustrate the proposed theoretical results.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105989"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183644","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}