Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2024.105986
Li Qiu, Lingtao Dong, Zhixing Shao, Shuyou Zhou
The coexistence of network denial of service (DoS) attacks and trigger transmission mechanism poses a challenge to the stability and control accuracy of semi-Markov jump systems (S-MJSs). DoS attacks with random characteristics and event-triggered mechanisms with dynamic parameters are studied in this paper. The communication topology jump process between multiple sub-actuators is modeled as a semi-Markov chain, and a S-MJSs with dual-channel DoS attacks and dynamic event-triggered mechanism (DETM) of sensor-to-controller (S-C) channel is obtained. In order to match the predictive compensation sequence with the trigger time of the S-C channel, a dynamic event-triggered predictive control (ETPC) strategy is designed by combining the controller with the trigger. In addition, the dynamic ETPC strategy proposed in this paper is applied to the tracking control of multi-motor, which effectively guarantees the tracking performance of multi-motor. Finally, the feasibility and superiority of the control strategy are verified by comparing with the network predictive control (NPC) strategy and the static ETPC strategy.
{"title":"Dynamic event-triggered predictive control strategy for networked semi-Markov jump systems","authors":"Li Qiu, Lingtao Dong, Zhixing Shao, Shuyou Zhou","doi":"10.1016/j.sysconle.2024.105986","DOIUrl":"10.1016/j.sysconle.2024.105986","url":null,"abstract":"<div><div>The coexistence of network denial of service (DoS) attacks and trigger transmission mechanism poses a challenge to the stability and control accuracy of semi-Markov jump systems (S-MJSs). DoS attacks with random characteristics and event-triggered mechanisms with dynamic parameters are studied in this paper. The communication topology jump process between multiple sub-actuators is modeled as a semi-Markov chain, and a S-MJSs with dual-channel DoS attacks and dynamic event-triggered mechanism (DETM) of sensor-to-controller (S-C) channel is obtained. In order to match the predictive compensation sequence with the trigger time of the S-C channel, a dynamic event-triggered predictive control (ETPC) strategy is designed by combining the controller with the trigger. In addition, the dynamic ETPC strategy proposed in this paper is applied to the tracking control of multi-motor, which effectively guarantees the tracking performance of multi-motor. Finally, the feasibility and superiority of the control strategy are verified by comparing with the network predictive control (NPC) strategy and the static ETPC strategy.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105986"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182997","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-02-01DOI: 10.1016/j.sysconle.2024.106005
Nan Li , Ilya Kolmanovsky , Hong Chen
In this paper, we propose a novel data-driven moving-horizon control approach for systems subject to time-domain constraints. The approach combines the strengths of control for rejecting disturbances and MPC for handling constraints. In particular, the approach can dynamically adapt disturbance attenuation performance depending on measured system state and forecasted disturbance level to satisfy constraints. We establish theoretical properties of the approach including robust guarantees of closed-loop stability, disturbance attenuation, constraint satisfaction under noisy data, as well as sufficient conditions for recursive feasibility, and illustrate the approach with a numerical example.
{"title":"Data-driven moving-horizon control with adaptive disturbance attenuation for constrained systems","authors":"Nan Li , Ilya Kolmanovsky , Hong Chen","doi":"10.1016/j.sysconle.2024.106005","DOIUrl":"10.1016/j.sysconle.2024.106005","url":null,"abstract":"<div><div>In this paper, we propose a novel data-driven moving-horizon control approach for systems subject to time-domain constraints. The approach combines the strengths of <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> control for rejecting disturbances and MPC for handling constraints. In particular, the approach can dynamically adapt <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> disturbance attenuation performance depending on measured system state and forecasted disturbance level to satisfy constraints. We establish theoretical properties of the approach including robust guarantees of closed-loop stability, disturbance attenuation, constraint satisfaction under noisy data, as well as sufficient conditions for recursive feasibility, and illustrate the approach with a numerical example.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106005"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182989","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-02-01DOI: 10.1016/j.sysconle.2024.106004
Yingkai Song, Kamil A. Khan
Deterministic methods for global optimization typically rely on convex relaxations to infer crucial bounding information. In global dynamic optimization, comparing convex relaxation approaches can be challenging due to limitations in established differential inequality theory. In this article, we provide new comparison results for the Carathéodory solutions of related ordinary differential equations (ODEs). Our results are applicable to certain ODEs whose right-hand side functions need not be quasimonotonic or continuous with respect to state variables; they require only a weakened variant of the standard Lipschitz continuity assumption, along with mild differential inequality requirements motivated by interval analysis. Using our new comparison results, we reveal an intuitive monotonicity result for global dynamic optimization that was previously unknown: when constructing convex relaxations of parametric ODE solutions within a relaxation framework by Scott and Barton (J. Glob. Optim. 57:143–176, 2013), supplying tighter relaxations of the ODE right-hand sides will always translate into relaxations of the ODE solutions that are at least as tight.
{"title":"New inequalities for comparing ordinary differential equations arising in global dynamic optimization","authors":"Yingkai Song, Kamil A. Khan","doi":"10.1016/j.sysconle.2024.106004","DOIUrl":"10.1016/j.sysconle.2024.106004","url":null,"abstract":"<div><div>Deterministic methods for global optimization typically rely on convex relaxations to infer crucial bounding information. In global dynamic optimization, comparing convex relaxation approaches can be challenging due to limitations in established differential inequality theory. In this article, we provide new comparison results for the Carathéodory solutions of related ordinary differential equations (ODEs). Our results are applicable to certain ODEs whose right-hand side functions need not be quasimonotonic or continuous with respect to state variables; they require only a weakened variant of the standard Lipschitz continuity assumption, along with mild differential inequality requirements motivated by interval analysis. Using our new comparison results, we reveal an intuitive monotonicity result for global dynamic optimization that was previously unknown: when constructing convex relaxations of parametric ODE solutions within a relaxation framework by Scott and Barton (J. Glob. Optim. 57:143–176, 2013), supplying tighter relaxations of the ODE right-hand sides will always translate into relaxations of the ODE solutions that are at least as tight.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106004"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182993","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}
Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2024.105972
Vivek S. Borkar
Using the framework of Markov decision processes (equivalently, controlled Markov chains) as a test case, we point out some non-robustness issues that arise in small noise limits in stochastic control. This is used to motivate a novel formulation of multi-chain Markov decision processes.
{"title":"Some big issues with small noise limits in Markov decision processes","authors":"Vivek S. Borkar","doi":"10.1016/j.sysconle.2024.105972","DOIUrl":"10.1016/j.sysconle.2024.105972","url":null,"abstract":"<div><div>Using the framework of Markov decision processes (equivalently, controlled Markov chains) as a test case, we point out some non-robustness issues that arise in small noise limits in stochastic control. This is used to motivate a novel formulation of multi-chain Markov decision processes.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105972"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182996","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-02-01DOI: 10.1016/j.sysconle.2024.105990
Lijun Gao, Suo Yang
This paper is contributing to designing a novel event-triggered control (ETC) policy for switched linear systems, where control systems obtain sampling information only at sampling instants. First, by allowing the length of any sampling interval to exceed the minimum DT of all system modes, an innovative aperiodic sampling programme is presented to avoid the high-frequency sampling. Then, based on the proposed aperiodic sampling method, three improvements are presented: (1) a novel aperiodic sampled-data-based event-triggered mechanism (ASETM) is developed, which is more flexible in scheduling communication resources than periodic sampled-data-based event-triggered mechanism (PSETM); (2) a multiple discontinuous Lyapunov function (MDLF) with adjustable sampling-dependent parameters is constructed, which covers the multiple Lyapunov function (MLF) as a special case and further increases the design flexibility; (3) the state-feedback controller gains and event-triggering parameters are sampling-dependent, which broadens the feasible solution range of matrix inequalities. It is shown that by choosing an appropriate aperiodic sampling intervals sequence and sampling-dependent parameters, a tighter bound on the mode-dependent average dwell time (MDADT) and larger sampling intervals can be achieved. Finally, an example is adopted to illustrate the effectiveness of the proposed approach.
{"title":"Aperiodic sampled-data-based control for switched linear systems: An improved sampling-dependent event-triggered mechanism","authors":"Lijun Gao, Suo Yang","doi":"10.1016/j.sysconle.2024.105990","DOIUrl":"10.1016/j.sysconle.2024.105990","url":null,"abstract":"<div><div>This paper is contributing to designing a novel event-triggered control (ETC) policy for switched linear systems, where control systems obtain sampling information only at sampling instants. First, by allowing the length of any sampling interval to exceed the minimum DT of all system modes, an innovative aperiodic sampling programme is presented to avoid the high-frequency sampling. Then, based on the proposed aperiodic sampling method, three improvements are presented: (1) a novel aperiodic sampled-data-based event-triggered mechanism (ASETM) is developed, which is more flexible in scheduling communication resources than periodic sampled-data-based event-triggered mechanism (PSETM); (2) a multiple discontinuous Lyapunov function (MDLF) with adjustable sampling-dependent parameters is constructed, which covers the multiple Lyapunov function (MLF) as a special case and further increases the design flexibility; (3) the state-feedback controller gains and event-triggering parameters are sampling-dependent, which broadens the feasible solution range of matrix inequalities. It is shown that by choosing an appropriate aperiodic sampling intervals sequence and sampling-dependent parameters, a tighter bound on the mode-dependent average dwell time (MDADT) and larger sampling intervals can be achieved. Finally, an example is adopted to illustrate the effectiveness of the proposed approach.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105990"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183243","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-02-01DOI: 10.1016/j.sysconle.2024.106010
M.d.R. de Pinho , M. Margarida A. Ferreira , Georgi Smirnov
Below we deduce necessary conditions of optimality for problems with nonregular mixed constraints (see Dmitruk(2009), Dmitruk and Osmolovskii(2022)) using the method of penalty functions similar to the one we previously used to solve optimization problems for control sweeping processes (see, e.g., de Pinho et al. (2022)), with pure state constraints de Pinho et al.,2024 and with regular mixed constraints (de Pinho et al.,2024).
We intentionally consider a global minimum and the simplest boundary conditions.
下面,我们将使用惩罚函数方法,推导出具有非规则混合约束(见 Dmitruk(2009)、Dmitruk 和 Osmolovskii(2022))问题的最优性必要条件,该方法类似于我们之前用于解决控制扫频过程优化问题的方法(见 de Pinho 等人(2022)、具有纯状态约束的 de Pinho 等人(2024)和具有规则混合约束的 de Pinho 等人(2024)、我们有意考虑全局最小值和最简单的边界条件。
{"title":"Optimal control problem with nonregular mixed constraints via penalty functions","authors":"M.d.R. de Pinho , M. Margarida A. Ferreira , Georgi Smirnov","doi":"10.1016/j.sysconle.2024.106010","DOIUrl":"10.1016/j.sysconle.2024.106010","url":null,"abstract":"<div><div>Below we deduce necessary conditions of optimality for problems with nonregular mixed constraints (see Dmitruk(2009), Dmitruk and Osmolovskii(2022)) using the method of penalty functions similar to the one we previously used to solve optimization problems for control sweeping processes (see, e.g., de Pinho et al. (2022)), with pure state constraints de Pinho et al.,2024 and with regular mixed constraints (de Pinho et al.,2024).</div><div>We intentionally consider a global minimum and the simplest boundary conditions.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106010"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183645","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-02-01DOI: 10.1016/j.sysconle.2024.106013
Xiaotao Ren , Wenxiao Zhao , Han Zhang
In the paper, recursive identification of the nonlinear nonparametric system is considered, where measurements for identification are subject to an event-triggered scheme and the system itself is of a finite impulse response (FIR) type. First, an adaptive event detector is designed and the measurements for identification are transmitted depending whether the value of the detector is 1 or 0. Second, a recursive identification algorithm is proposed with the help of a kernel-based stochastic approximation algorithm with expanding truncations (SAAWET). Third, under some reasonable assumptions, the estimates are proved to be strongly consistent, i.e., converging almost surely to the values of the unknown function in the system at any fixed points, and the transmission rate of the detector is analyzed as well. Finally, numerical examples are given to justify the theoretical results.
{"title":"Recursive identification of nonlinear nonparametric systems under event-triggered observations","authors":"Xiaotao Ren , Wenxiao Zhao , Han Zhang","doi":"10.1016/j.sysconle.2024.106013","DOIUrl":"10.1016/j.sysconle.2024.106013","url":null,"abstract":"<div><div>In the paper, recursive identification of the nonlinear nonparametric system is considered, where measurements for identification are subject to an event-triggered scheme and the system itself is of a finite impulse response (FIR) type. First, an adaptive event detector is designed and the measurements for identification are transmitted depending whether the value of the detector is 1 or 0. Second, a recursive identification algorithm is proposed with the help of a kernel-based stochastic approximation algorithm with expanding truncations (SAAWET). Third, under some reasonable assumptions, the estimates are proved to be strongly consistent, i.e., converging almost surely to the values of the unknown function in the system at any fixed points, and the transmission rate of the detector is analyzed as well. Finally, numerical examples are given to justify the theoretical results.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106013"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183647","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}
This paper addresses the problem of multi-agent distributed state estimation in switching networks over directed graphs. Specifically, we consider a novel estimation setting for a linear continuous-time system that is broken down into subsystems, each of which is locally estimated by the corresponding agent. This task is undertaken despite the complexities due to interdependencies on both cyber and physical levels, and due to the fact that the system is switching, i.e., the different subsystems/agents can activate (e.g., to accomplish some specific task) or deactivate (e.g., due to a fault) during a transient that ends with a cutoff time, unknown to the agents, after which the topology becomes fixed. In particular, by exploiting the negativizability property – the pair is negativizable if there is a feedback gain such that is negative definite – each agent is able to locally perform the calculation of its own estimation gain matrix. The paper is complemented by the convergence analysis of the estimation error executed by leveraging on nonsmooth analysis and simulations to prove the effectiveness of the proposed results.
{"title":"Distributed state estimation for interdependent and switching multi-agent systems","authors":"Camilla Fioravanti , Andrea Gasparri , Stefano Panzieri , Gabriele Oliva","doi":"10.1016/j.sysconle.2024.105984","DOIUrl":"10.1016/j.sysconle.2024.105984","url":null,"abstract":"<div><div>This paper addresses the problem of multi-agent distributed state estimation in switching networks over directed graphs. Specifically, we consider a novel estimation setting for a linear continuous-time system that is broken down into subsystems, each of which is locally estimated by the corresponding agent. This task is undertaken despite the complexities due to interdependencies on both cyber and physical levels, and due to the fact that the system is <em>switching</em>, i.e., the different subsystems/agents can activate (e.g., to accomplish some specific task) or deactivate (e.g., due to a fault) during a transient that ends with a cutoff time, unknown to the agents, after which the topology becomes fixed. In particular, by exploiting the <em>negativizability</em> property – the pair <span><math><mrow><mo>(</mo><mi>A</mi><mo>,</mo><mi>C</mi><mo>)</mo></mrow></math></span> is negativizable if there is a feedback gain <span><math><mi>K</mi></math></span> such that <span><math><mrow><mi>A</mi><mo>−</mo><mi>K</mi><mi>C</mi></mrow></math></span> is negative definite – each agent is able to locally perform the calculation of its own estimation gain matrix. The paper is complemented by the convergence analysis of the estimation error executed by leveraging on nonsmooth analysis and simulations to prove the effectiveness of the proposed results.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105984"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182998","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-02-01DOI: 10.1016/j.sysconle.2024.106007
Lina Wang , Zicong Xia , Yang Liu , Shun-ichi Azuma , Weihua Gui
In this paper, the finite-time observability and minimal finite-time observability problems of Markovian jump Boolean networks (MJBNs) are addressed. The signal space is partitioned to facilitate the observability analysis, followed by novel criteria for the finite-time observability of MJBNs. To reduce measurement costs, a minimal finite-time observability problem is formulated, involving the injection of the minimum number of sensors necessary for an unobservable MJBN to achieve finite-time observability. By introducing an indicator matrix, the minimal finite-time observability problem is converted into a 0–1 programming problem, and a collaborative neurodynamic optimization approach with multiple recurrent neural networks is developed for obtaining a global optimal solution. Two illustrative examples, including a biological simulation, are provided to demonstrate the theoretical results.
{"title":"Minimal finite-time observability of Markovian jump Boolean networks","authors":"Lina Wang , Zicong Xia , Yang Liu , Shun-ichi Azuma , Weihua Gui","doi":"10.1016/j.sysconle.2024.106007","DOIUrl":"10.1016/j.sysconle.2024.106007","url":null,"abstract":"<div><div>In this paper, the finite-time observability and minimal finite-time observability problems of Markovian jump Boolean networks (MJBNs) are addressed. The signal space is partitioned to facilitate the observability analysis, followed by novel criteria for the finite-time observability of MJBNs. To reduce measurement costs, a minimal finite-time observability problem is formulated, involving the injection of the minimum number of sensors necessary for an unobservable MJBN to achieve finite-time observability. By introducing an indicator matrix, the minimal finite-time observability problem is converted into a 0–1 programming problem, and a collaborative neurodynamic optimization approach with multiple recurrent neural networks is developed for obtaining a global optimal solution. Two illustrative examples, including a biological simulation, are provided to demonstrate the theoretical results.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106007"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183646","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-01-30DOI: 10.1016/j.sysconle.2025.106025
Zelin Yang, Jian-An Wang, Jie Zhang, Mingjie Li, Hui Shi
This paper studies the synchronization issue of complex networks via event-dependent intermittent discrete-time observation control (EIDOC) for the first time. Three non-negative real domains are characterized by introducing two boundary functions. The work and rest time of intermittent control rely on the relationship between the Lyapunov function trajectory and non-negative regions. The proposed aperiodically intermittent control is based on discrete-time state observation rather than continuous observation during the work interval. Some sufficient criteria are derived for ensuring synchronization of the network. The theoretical results are employed to deal with single pendulum systems, and numerical simulation have demonstrated the effectiveness of the derived method.
{"title":"Event-dependent intermittent synchronization of complex networks based on discrete-time state observation","authors":"Zelin Yang, Jian-An Wang, Jie Zhang, Mingjie Li, Hui Shi","doi":"10.1016/j.sysconle.2025.106025","DOIUrl":"10.1016/j.sysconle.2025.106025","url":null,"abstract":"<div><div>This paper studies the synchronization issue of complex networks via event-dependent intermittent discrete-time observation control (EIDOC) for the first time. Three non-negative real domains are characterized by introducing two boundary functions. The work and rest time of intermittent control rely on the relationship between the Lyapunov function trajectory and non-negative regions. The proposed aperiodically intermittent control is based on discrete-time state observation rather than continuous observation during the work interval. Some sufficient criteria are derived for ensuring synchronization of the network. The theoretical results are employed to deal with single pendulum systems, and numerical simulation have demonstrated the effectiveness of the derived method.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"197 ","pages":"Article 106025"},"PeriodicalIF":2.1,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143171855","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}