{"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}
{"title":"Impulsive and impulse-free PD solutions of singular LQ control","authors":"Jovan Stefanovski","doi":"10.1016/j.sysconle.2025.106024","DOIUrl":"10.1016/j.sysconle.2025.106024","url":null,"abstract":"<div><div>This paper addresses the singular linear–quadratic (LQ) control problem, considering cases with or without impulses in the state, and with or without stability. The optimal controller obtained includes a derivative of the state. The assumptions made are system stabilizability and the left-invertibility of the plant transfer matrix. Necessary and sufficient conditions for stability and the impulse-freeness of the optimal state are provided. These conditions are related to the absence of invariant zeros on the imaginary axis, and at infinity with orders greater than one, as well as to strong<span><math><msup><mrow></mrow><mrow><mo>∗</mo></mrow></msup></math></span> detectability. When these conditions are not met, the subspace ensuring that the optimal state is impulse-free, if the initial state belongs to that subspace, is determined. Additionally, a suboptimal yet practically realizable controller is presented, along with an explicit expression for the difference between the cost functional values corresponding to the suboptimal and optimal controllers. Illustrative examples are included.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106024"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182440","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}
Ge Guo , Xinxin Zhang , Renyongkang Zhang , Jian Kang
{"title":"Event-triggered predefined-time distributed optimization algorithm based on zero-gradient-sum","authors":"Ge Guo , Xinxin Zhang , Renyongkang Zhang , Jian Kang","doi":"10.1016/j.sysconle.2025.106019","DOIUrl":"10.1016/j.sysconle.2025.106019","url":null,"abstract":"<div><div>This paper presents an event-triggered distributed optimization (DO) algorithm for consensus constraints and strongly convex local cost functions. The algorithm is derived by means of the zero-gradient-sum mechanism and sliding mode control, which is free from any initial conditions or local minimization. In order to avoid continuous communication and measurement, our algorithm enables the interaction between agents solely at event-triggered instants, resulting in conserving communication resources. Importantly, the proposed method drives system to the optimal consensus state within a predefined time. Simulation results demonstrate the effectiveness of our approach.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106019"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182441","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":"Finite-time safe control of probabilistic Boolean networks: An event-triggered approach","authors":"Shao Shao , Linying Xiang , Fei Chen","doi":"10.1016/j.sysconle.2024.106012","DOIUrl":"10.1016/j.sysconle.2024.106012","url":null,"abstract":"<div><div>This paper explores finite-time safe control in probabilistic Boolean control networks (PBCNs) through event-triggered control (ETC), presenting necessary and sufficient conditions as a set-based testing framework for problem solvability under ETC. Despite the unsolvability of the safe control problem in PBCNs with non-intermittent feedback controllers, ETC offers a potential solution. The paper contributes an algorithm to calculate the feasible triggering set and corresponding feedback gain matrices. An illustrative example is included to highlight the practical effectiveness of the proposed approach.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106012"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182986","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":"Approximate linear programming for decentralized policy iteration in cooperative multi-agent Markov decision processes","authors":"Lakshmi Mandal , Chandrashekar Lakshminarayanan , Shalabh Bhatnagar","doi":"10.1016/j.sysconle.2024.106003","DOIUrl":"10.1016/j.sysconle.2024.106003","url":null,"abstract":"<div><div>In this work, we consider a ‘cooperative’ multi-agent Markov decision process (MDP) involving <span><math><mrow><mi>m</mi><mrow><mo>(</mo><mo>></mo><mn>1</mn><mo>)</mo></mrow></mrow></math></span> agents. At each decision epoch, all the <span><math><mi>m</mi></math></span> agents independently select actions in order to minimize a common long-term cost objective. In the policy iteration process of multi-agent setup, the number of actions grows exponentially with the number of agents, incurring huge computational costs. Thus, recent works consider decentralized policy improvement, where each agent improves its decisions unilaterally, assuming that the decisions of the other agents are fixed. However, exact value functions are considered in the literature, which is computationally expensive for a large number of agents with high dimensional state–action space. Thus, we propose approximate decentralized policy iteration algorithms, using approximate linear programming with function approximation to compute the approximate value function for decentralized policy improvement. Further, we consider (both) cooperative multi-agent finite and infinite horizon discounted MDPs and propose suitable algorithms in each case. Moreover, we provide theoretical guarantees for our algorithms and also demonstrate their advantages over existing state-of-the-art algorithms in the literature.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106003"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182988","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":"Maximum correntropy recursive three-step filter","authors":"Yike Zhang , Xinmin Song , Wei Xing Zheng","doi":"10.1016/j.sysconle.2024.106006","DOIUrl":"10.1016/j.sysconle.2024.106006","url":null,"abstract":"<div><div>Recursive three-step filters are often used for state estimation of systems with unknown input direct feedthrough, that is, systems where the unknown input simultaneously affect the state equation and measurement equation. However, when the system is disturbed by non-Gaussian noise, especially heavy-tailed impulsive noise, the performance of such recursive three-step filters will deteriorate. This paper proposes a maximum correntropy recursive three-step filter that can effectively handle non-Gaussian measurement noise pollution. The derivation of this filter is based on the traditional recursive three-step filter and utilizes a maximum correntropy criterion and a fixed-point iterative algorithm to simultaneously estimate the unknown input and state. It is shown that when the kernel bandwidths approach infinity, the derived maximum correntropy recursive three-step filter will degenerate into the traditional recursive three-step filter. Finally, the effectiveness and reliability of the proposed algorithm are demonstrated through simulation experiments.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106006"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182990","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":"The delay feedback control for the McKean–Vlasov stochastic differential equations with common noise","authors":"Xing Chen , Xiaoyue Li , Chenggui Yuan","doi":"10.1016/j.sysconle.2024.105993","DOIUrl":"10.1016/j.sysconle.2024.105993","url":null,"abstract":"<div><div>Since response lags are essential in the feedback loops and are required by most physical systems, it is more appropriate to stabilize McKean–Vlasov stochastic differential equations (MV-SDEs) with common noise through the implementation of delay feedback control mechanisms. The aim of this paper is to design delay feedback control functions such that the controlled system is bounded in infinite horizon and further exponentially stable in the mean square. The designed controller, which depends only on the system state is easier to implement than that in Wu et al. (2022) which was designed to depend on both system state and measure. The existence and uniqueness of the global solution of the controlled system is proved. The Itô formula in both state and measure is derived. The proposed delay feedback control strategies are rendered viable for effective stabilization of MV-SDEs with common noise. Furthermore, the moment Lyapunov exponent, which is intricately linked to the time delays, is meticulously estimated.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105993"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183242","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}
Francesco Tedesco, Gianfranco Gagliardi, Alessandro Casavola
{"title":"Command governor schemes for dynamical systems subject to rate-bounded disturbances","authors":"Francesco Tedesco, Gianfranco Gagliardi, Alessandro Casavola","doi":"10.1016/j.sysconle.2024.106015","DOIUrl":"10.1016/j.sysconle.2024.106015","url":null,"abstract":"<div><div>This paper extends the well-known Command Governor (CG) scheme to the case of rate-bounded persistent disturbances acting as exogenous signals on the plant. The methodology is founded on a multimodal supervisory unit that, during online operations, effectively orchestrates the switching among various CG configurations. These configurations are pre-designed offline based on the magnitude of disturbance occurrences to satisfy the prescribed constraints. To achieve this, a customized notion of <em>transition dwell-time</em> is incorporated within the proposed supervisory framework to determine the necessary duration to facilitate safe transitions among operational modes without compromising constraint satisfaction. Simulation results on two different linear systems indicate that the multimodal CG architecture is markedly less conservative when compared to the traditional single CG scheme.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106015"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183648","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":"The minimal hitting probability of continuous-time controlled Markov systems with countable states","authors":"Yanyun Li , Junping Li","doi":"10.1016/j.sysconle.2024.106002","DOIUrl":"10.1016/j.sysconle.2024.106002","url":null,"abstract":"<div><div>This paper concentrates on the minimal hitting probability of continuous-time controlled Markov systems (CTCMSs) with countable state and finite admissible action spaces. The existence of an optimal policy is first proved. In particular, for a special and important case of controlled branching processes (CBPs), it is proved that the minimal hitting probability is the unique solution to an improved optimal system of equations. Furthermore, a novel and precise improved-policy iteration algorithm of an optimal policy and the minimal hitting probability (minimal extinction probability) is presented for CBPs.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106002"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182987","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":"Improving discrete observers via unreliable direct state reconstruction","authors":"Florian Meiners, Jürgen Adamy","doi":"10.1016/j.sysconle.2024.105991","DOIUrl":"10.1016/j.sysconle.2024.105991","url":null,"abstract":"<div><div>Unknown differences between system states and observer estimates inherently result in, potentially large, initial errors. This paper deals with the mitigation of this problem in discrete LTI systems by using an approximation of the system state directly calculated from past and present values of its input and output. This information is used in a nonlinear modification of the classical linear state observer structure to reduce the transient error and deviations due to disturbances. We show the stability of this extension in the presence and absence of noise. Additionally, we prove the fulfillment of the separation principle. For the case of noisy measurement, we argue that there is a predictable ideal filter length if the noise variance is known. The ideas are subsequently illustrated in simulation.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105991"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183245","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}