Mohsen Heydari, Alireza B. Novinzadeh, Morteza Tayefi
This article addresses a solution to one of the main challenges of online data‐driven control (DDC) methods: reducing the sensitivity of the model‐free adaptive control (MFAC) method to initial conditions and control parameters with the new control cost function and added the output error rate and integral along with a new anti‐wind up strategy for multi‐input multi‐output (MIMO) systems. The parameters introduced to the new control law have been validated using the boundary‐input boundary‐output (BIBO) approach to design and converge the controller. The simulation findings on a nonlinear auto‐regressive moving average model with exogenous inputs (NARMAX) system with triangular control input demonstrate that the proposed control rule will outperform to prototype MFAC. Furthermore, to analyze the sensitivity of the controller to the initial conditions and the uncertainties of the control parameters, 30 Monte Carlo simulations were performed with random initial conditions in the presence of disturbance in the control input, and output noise, and the results were compared with the prototype MFAC and conventional PID controller using standard criteria such as integral time absolute error, standard deviation, steady‐state error, and mean maximum error, which shows a noticeable superiority of proposed controller relative to the prototype MFAC.
{"title":"Anti Wind‐Up and Robust Data‐Driven Model‐Free Adaptive Control for MIMO Nonlinear Discrete‐Time Systems","authors":"Mohsen Heydari, Alireza B. Novinzadeh, Morteza Tayefi","doi":"10.1002/acs.3907","DOIUrl":"https://doi.org/10.1002/acs.3907","url":null,"abstract":"This article addresses a solution to one of the main challenges of online data‐driven control (DDC) methods: reducing the sensitivity of the model‐free adaptive control (MFAC) method to initial conditions and control parameters with the new control cost function and added the output error rate and integral along with a new anti‐wind up strategy for multi‐input multi‐output (MIMO) systems. The parameters introduced to the new control law have been validated using the boundary‐input boundary‐output (BIBO) approach to design and converge the controller. The simulation findings on a nonlinear auto‐regressive moving average model with exogenous inputs (NARMAX) system with triangular control input demonstrate that the proposed control rule will outperform to prototype MFAC. Furthermore, to analyze the sensitivity of the controller to the initial conditions and the uncertainties of the control parameters, 30 Monte Carlo simulations were performed with random initial conditions in the presence of disturbance in the control input, and output noise, and the results were compared with the prototype MFAC and conventional PID controller using standard criteria such as integral time absolute error, standard deviation, steady‐state error, and mean maximum error, which shows a noticeable superiority of proposed controller relative to the prototype MFAC.","PeriodicalId":50347,"journal":{"name":"International Journal of Adaptive Control and Signal Processing","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142247448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article is aimed to study the parameter identification of the ExpARX system. To overcome the computational complexity associated with a large number of feature parameters, a parameter separation scheme based on the different features of the identification model is introduced. In terms of the phenomenon that the coupling parameters lead to the inability of algorithms, a separable synchronous interactive estimation method is introduced to eliminate the coupling parameters and perform parameter estimation in accordance with the hierarchical principle. For the purpose of achieving high‐accuracy performance and reducing complexity, a separable synchronous gradient iterative algorithm is derived by means of gradient search. In order to improve the identification accuracy, a separable synchronous multi‐innovation gradient iterative algorithm is proposed by introducing the multi‐innovation identification theory. In order to improve the convergence speed, a separable synchronous multi‐innovation conjugate gradient iterative algorithm is proposed by introducing the conjugate gradient theory. Finally, a simulation example and a real‐life example of piezoelectric ceramics are used to verify the effectiveness of the proposed algorithm.
{"title":"Separable Synchronous Gradient‐Based Iterative Algorithms for the Nonlinear ExpARX System","authors":"Ya Gu, Yuting Hou, Chuanjiang Li, Yanfei Zhu","doi":"10.1002/acs.3904","DOIUrl":"https://doi.org/10.1002/acs.3904","url":null,"abstract":"This article is aimed to study the parameter identification of the ExpARX system. To overcome the computational complexity associated with a large number of feature parameters, a parameter separation scheme based on the different features of the identification model is introduced. In terms of the phenomenon that the coupling parameters lead to the inability of algorithms, a separable synchronous interactive estimation method is introduced to eliminate the coupling parameters and perform parameter estimation in accordance with the hierarchical principle. For the purpose of achieving high‐accuracy performance and reducing complexity, a separable synchronous gradient iterative algorithm is derived by means of gradient search. In order to improve the identification accuracy, a separable synchronous multi‐innovation gradient iterative algorithm is proposed by introducing the multi‐innovation identification theory. In order to improve the convergence speed, a separable synchronous multi‐innovation conjugate gradient iterative algorithm is proposed by introducing the conjugate gradient theory. Finally, a simulation example and a real‐life example of piezoelectric ceramics are used to verify the effectiveness of the proposed algorithm.","PeriodicalId":50347,"journal":{"name":"International Journal of Adaptive Control and Signal Processing","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article proposes a novel method to accelerate the boundary feedback control design of cascaded parabolic difference equations (PDEs) through DeepONet. The backstepping method has been widely used in boundary control problems of PDE systems, but solving the backstepping kernel function can be time‐consuming. To address this, a neural operator (NO) learning scheme is leveraged for accelerating the control design of cascaded parabolic PDEs. DeepONet, a class of deep neural networks designed for approximating nonlinear operators, has shown potential for approximating PDE backstepping designs in recent studies. Specifically, we focus on approximating gain kernel PDEs for two cascaded parabolic PDEs. We utilize neural operators to map only two kernel functions, while the other two are computed using the analytical solution, thus simplifying the training process. We establish the continuity and boundedness of the kernels, and demonstrate the existence of arbitrarily close DeepONet approximations to the kernel PDEs. Furthermore, we demonstrate that the DeepONet approximation gain kernels ensure stability when replacing the exact backstepping gain kernels. Notably, DeepONet operator exhibits computation speeds two orders of magnitude faster than PDE solvers for such gain functions, and their theoretically proven stabilizing capability is validated through simulations.
{"title":"Neural Operator Approximations for Boundary Stabilization of Cascaded Parabolic PDEs","authors":"Kaijing Lv, Junmin Wang, Yuandong Cao","doi":"10.1002/acs.3902","DOIUrl":"https://doi.org/10.1002/acs.3902","url":null,"abstract":"This article proposes a novel method to accelerate the boundary feedback control design of cascaded parabolic difference equations (PDEs) through DeepONet. The backstepping method has been widely used in boundary control problems of PDE systems, but solving the backstepping kernel function can be time‐consuming. To address this, a neural operator (NO) learning scheme is leveraged for accelerating the control design of cascaded parabolic PDEs. DeepONet, a class of deep neural networks designed for approximating nonlinear operators, has shown potential for approximating PDE backstepping designs in recent studies. Specifically, we focus on approximating gain kernel PDEs for two cascaded parabolic PDEs. We utilize neural operators to map only two kernel functions, while the other two are computed using the analytical solution, thus simplifying the training process. We establish the continuity and boundedness of the kernels, and demonstrate the existence of arbitrarily close DeepONet approximations to the kernel PDEs. Furthermore, we demonstrate that the DeepONet approximation gain kernels ensure stability when replacing the exact backstepping gain kernels. Notably, DeepONet operator exhibits computation speeds two orders of magnitude faster than PDE solvers for such gain functions, and their theoretically proven stabilizing capability is validated through simulations.","PeriodicalId":50347,"journal":{"name":"International Journal of Adaptive Control and Signal Processing","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Model‐free iterative learning control (ILC) can lead to high performance by attenuating repeating disturbances completely, using dedicated experiments on the real system to replace the traditional model. The aim of this paper is to develop a fast data‐driven method for MIMO ILC that uses random learning in the form of efficient unbiased gradient estimates. This is achieved by developing a stochastic conjugate gradient algorithm, in which the search direction and optimal step size are generated using dedicated experiments. The approach is applied to MIMO automated feedforward tuning. Simulation and experimental results show that the method is superior to earlier stochastic and deterministic methods.
无模型迭代学习控制（ILC）可以通过在真实系统上进行专门实验来取代传统模型，从而完全减弱重复干扰，实现高性能。本文旨在为 MIMO ILC 开发一种快速数据驱动方法，该方法采用高效无偏梯度估计形式的随机学习。这是通过开发一种随机共轭梯度算法来实现的，其中搜索方向和最佳步长都是通过专门的实验产生的。该方法被应用于 MIMO 自动前馈调整。仿真和实验结果表明，该方法优于早期的随机和确定性方法。
{"title":"Random Learning Leads to Faster Convergence in ‘Model‐Free’ ILC: With Application to MIMO Feedforward in Industrial Printing","authors":"Leontine Aarnoudse, Tom Oomen","doi":"10.1002/acs.3903","DOIUrl":"https://doi.org/10.1002/acs.3903","url":null,"abstract":"Model‐free iterative learning control (ILC) can lead to high performance by attenuating repeating disturbances completely, using dedicated experiments on the real system to replace the traditional model. The aim of this paper is to develop a fast data‐driven method for MIMO ILC that uses random learning in the form of efficient unbiased gradient estimates. This is achieved by developing a stochastic conjugate gradient algorithm, in which the search direction and optimal step size are generated using dedicated experiments. The approach is applied to MIMO automated feedforward tuning. Simulation and experimental results show that the method is superior to earlier stochastic and deterministic methods.","PeriodicalId":50347,"journal":{"name":"International Journal of Adaptive Control and Signal Processing","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SummaryAs wind energy is sustainable, pollution‐free, easily available, and free of cost, it has become an efficient source of renewable energy for electricity generation. But, the problem with wind energy is that it varies with time, seasons, and location. This makes the Wind Energy Conversion System (WECS) unstable as it frequently needs to match the load demands. The balance in power generation by wind energy is essential since it has to be connected to various grids. So, this unbalanced energy production can affect the stability of the associated power grids as well. It also results in expensive regulatory measures, storage options, and load shedding. So, the stable operation of the WECS is highly essential to adapt it as a trustable source of electricity production. The stable operation of the WECS requires a robust and advanced system for control. Better control of the wind power extracting model is achieved by controlling the Maximum Power Point Tracking (MPPT) and blade pitch. So, an Adaptive MPPT and Blade Pitch Controller (BPC) for the WECS have been developed in this article, with the support of a hybrid optimization algorithm. In order to enhance the working principles of this controller, two effective algorithms such as Sand Cat Swarm Optimization (SCSO) and Galactic Swarm Optimization (GSO) are integrated and named Hybrid Sand Cat Galactic Swarm Optimization (HSC‐GSO). With the help of the recommended HSC‐GSO, the functionality of the controller is enhanced and also at the same time this algorithm helps to optimize the three gains in the Proportional Integral Differential (PID) controller of both MPPT and BPC, respectively. Moreover, with the support of the proposed HSC‐GSO the damping oscillations in the WECS output power and voltage are minimized. In the end, the numerical analysis is conducted for the presented system by comparing it with the traditional techniques. From the overall result analysis, the stability of the recommended adaptive WECS is 97, which is higher than the conventional algorithms such as DHOA, SCSO, GSO, and DA. Thus, it has been proved that the proposed HSC‐GSO algorithm for the parameters optimization in the PID controller of MPPT and the PID controller of BPC attains high robustness, increased steady‐state stability, and efficient transient response than the traditional techniques.
{"title":"Hybrid sand cat‐galactic swarm optimization‐based adaptive maximum power point tracking and blade pitch controller for wind energy conversion system","authors":"Menda Ebraheem, T. R. Jyothsna","doi":"10.1002/acs.3890","DOIUrl":"https://doi.org/10.1002/acs.3890","url":null,"abstract":"SummaryAs wind energy is sustainable, pollution‐free, easily available, and free of cost, it has become an efficient source of renewable energy for electricity generation. But, the problem with wind energy is that it varies with time, seasons, and location. This makes the Wind Energy Conversion System (WECS) unstable as it frequently needs to match the load demands. The balance in power generation by wind energy is essential since it has to be connected to various grids. So, this unbalanced energy production can affect the stability of the associated power grids as well. It also results in expensive regulatory measures, storage options, and load shedding. So, the stable operation of the WECS is highly essential to adapt it as a trustable source of electricity production. The stable operation of the WECS requires a robust and advanced system for control. Better control of the wind power extracting model is achieved by controlling the Maximum Power Point Tracking (MPPT) and blade pitch. So, an Adaptive MPPT and Blade Pitch Controller (BPC) for the WECS have been developed in this article, with the support of a hybrid optimization algorithm. In order to enhance the working principles of this controller, two effective algorithms such as Sand Cat Swarm Optimization (SCSO) and Galactic Swarm Optimization (GSO) are integrated and named Hybrid Sand Cat Galactic Swarm Optimization (HSC‐GSO). With the help of the recommended HSC‐GSO, the functionality of the controller is enhanced and also at the same time this algorithm helps to optimize the three gains in the Proportional Integral Differential (PID) controller of both MPPT and BPC, respectively. Moreover, with the support of the proposed HSC‐GSO the damping oscillations in the WECS output power and voltage are minimized. In the end, the numerical analysis is conducted for the presented system by comparing it with the traditional techniques. From the overall result analysis, the stability of the recommended adaptive WECS is 97, which is higher than the conventional algorithms such as DHOA, SCSO, GSO, and DA. Thus, it has been proved that the proposed HSC‐GSO algorithm for the parameters optimization in the PID controller of MPPT and the PID controller of BPC attains high robustness, increased steady‐state stability, and efficient transient response than the traditional techniques.","PeriodicalId":50347,"journal":{"name":"International Journal of Adaptive Control and Signal Processing","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SummaryThe thesis studies a stochastic finite‐time bounded (SFTB) filter design method for time‐varying delay Markov jump systems (MJSs) with partially unknown transition rates. First, a Lyapunov–Krasovskii functional with triple integral is built, the free weight matrix is added for lowering the conservatism. And the condition of SFTB of the error system is analyzed. Then, according to linear matrix inequalities (LMIs), a new filter design method is presented. Moreover, the dimension of the filter obtained is free, and the filter ensures that the error system is SFTB. Finally, the validity and effectiveness of the conclusion of this paper are demonstrated by simulation examples.
{"title":"Finite‐time H∞ filtering for Markov jump systems with partially unknown transition rates","authors":"Juan Zhou, Xinru Ai","doi":"10.1002/acs.3900","DOIUrl":"https://doi.org/10.1002/acs.3900","url":null,"abstract":"SummaryThe thesis studies a stochastic finite‐time bounded (SFTB) filter design method for time‐varying delay Markov jump systems (MJSs) with partially unknown transition rates. First, a Lyapunov–Krasovskii functional with triple integral is built, the free weight matrix is added for lowering the conservatism. And the condition of SFTB of the error system is analyzed. Then, according to linear matrix inequalities (LMIs), a new filter design method is presented. Moreover, the dimension of the filter obtained is free, and the filter ensures that the error system is SFTB. Finally, the validity and effectiveness of the conclusion of this paper are demonstrated by simulation examples.","PeriodicalId":50347,"journal":{"name":"International Journal of Adaptive Control and Signal Processing","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SummaryIn this article, for non‐parameterized nonlinear continuous (NPNC) multiple‐input multiple‐output (MIMO) systems, two combined iteration‐domain and time‐domain adaptive iterative learning control (ILC) algorithms are proposed to track iteration‐varying reference trajectories repetitively over a finite time interval. Different from the general requirement in adaptive control community that the control gain matrices of the controlled systems are real symmetric and positive‐definite, only the nonsingular property of the control gain matrices is assumed. Moreover, there are just two adaption parameters and one adaption parameter involved in the proposed two adaptive ILC algorithms respectively such that the computation load and memory‐space are greatly saved. A simulation example is utilized to illustrate the effectiveness of the two proposed adaptive ILC algorithms with less adaption parameters.
{"title":"Adaptive ILC methods with less adaption parameters for non‐parameterized nonlinear continuous systems with nonsingular control gain matrices","authors":"Ya‐Qiong Ding, Xiao‐Dong Li","doi":"10.1002/acs.3896","DOIUrl":"https://doi.org/10.1002/acs.3896","url":null,"abstract":"SummaryIn this article, for non‐parameterized nonlinear continuous (NPNC) multiple‐input multiple‐output (MIMO) systems, two combined iteration‐domain and time‐domain adaptive iterative learning control (ILC) algorithms are proposed to track iteration‐varying reference trajectories repetitively over a finite time interval. Different from the general requirement in adaptive control community that the control gain matrices of the controlled systems are real symmetric and positive‐definite, only the nonsingular property of the control gain matrices is assumed. Moreover, there are just two adaption parameters and one adaption parameter involved in the proposed two adaptive ILC algorithms respectively such that the computation load and memory‐space are greatly saved. A simulation example is utilized to illustrate the effectiveness of the two proposed adaptive ILC algorithms with less adaption parameters.","PeriodicalId":50347,"journal":{"name":"International Journal of Adaptive Control and Signal Processing","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SummaryThis article studies the dynamic event‐triggered control problem for switched Takagi‐Sugeno (T‐S) fuzzy systems against multiple cyber attacks. A new multiple cyber attack model is established by considering random false data injection attacks and aperiodic denial‐of‐service attacks. Then, to further efficiently utilize network communication resources, a dynamic event‐triggered mechanism (ETM), which includes a nonnegative dynamic variable, is constructed. Furthermore, the time‐delay switched T‐S fuzzy system considering dynamic ETM and multiple cyber attacks is derived by utilizing model transformation methods. Moreover, sufficient conditions for globally asymptotically stability and performance are derived by utilizing multiple Lyapunov functions and average dwell time method. Finally, an example is provided to validate the effectiveness of dynamic ETM.
{"title":"Dynamic event‐triggered H∞ control for switched T‐S fuzzy systems under multiple cyber attacks","authors":"Xiangtong Tan, Xiehuan Li, Guangdeng Zong","doi":"10.1002/acs.3901","DOIUrl":"https://doi.org/10.1002/acs.3901","url":null,"abstract":"SummaryThis article studies the dynamic event‐triggered control problem for switched Takagi‐Sugeno (T‐S) fuzzy systems against multiple cyber attacks. A new multiple cyber attack model is established by considering random false data injection attacks and aperiodic denial‐of‐service attacks. Then, to further efficiently utilize network communication resources, a dynamic event‐triggered mechanism (ETM), which includes a nonnegative dynamic variable, is constructed. Furthermore, the time‐delay switched T‐S fuzzy system considering dynamic ETM and multiple cyber attacks is derived by utilizing model transformation methods. Moreover, sufficient conditions for globally asymptotically stability and performance are derived by utilizing multiple Lyapunov functions and average dwell time method. Finally, an example is provided to validate the effectiveness of dynamic ETM.","PeriodicalId":50347,"journal":{"name":"International Journal of Adaptive Control and Signal Processing","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article considers the problem of edge-based event-triggered output feedback control for linear multi-agent systems (MASs) with state-independent process and measurement noise under undirected communication topologies. The main breakthroughs are the design of distributed event-triggered output feedback control strategy and the stochastic stability analysis. Toward this, first, according to Kalman filtering theory, An observer is contrasted to optimally estimate the state of each agent. Next, a novel edge-based event-triggered mechanism (EBETM) is designed to reduce the communication frequency among agents effectively, and a positive interval between events is enforced in EBETM, which can eliminate the Zeno behavior. Then, stability of the estimation error and the consensus error systems is analyzed, the execution error is estimated and the almost sure consensus is achieved. Finally, a numerical example is given to show that MASs achieves almost sure consensus and there is a positive interval between the events of all edges.
摘要 本文探讨了在无向通信拓扑结构下，对具有状态无关过程和测量噪声的线性多代理系统（MAS）进行基于边缘的事件触发输出反馈控制的问题。主要突破在于分布式事件触发输出反馈控制策略的设计和随机稳定性分析。为此，首先，根据卡尔曼滤波理论，对比了一个观测器来优化估计每个代理的状态。其次，设计了一种新颖的基于边缘的事件触发机制（EBETM），以有效降低代理之间的通信频率，并在 EBETM 中强制执行事件之间的正间隔，从而消除 Zeno 行为。然后，分析了估计误差和共识误差系统的稳定性，估计了执行误差，并实现了几乎确定的共识。最后，举例说明了 MASs 可以实现几乎确定的共识，并且所有边的事件之间都有正间隔。
{"title":"Edge-based event-triggered output feedback control for stochastic multi-agent systems","authors":"Chuanxi Zhu, Beibei Chang","doi":"10.1002/acs.3878","DOIUrl":"10.1002/acs.3878","url":null,"abstract":"<div>\u0000 \u0000 <p>This article considers the problem of edge-based event-triggered output feedback control for linear multi-agent systems (MASs) with state-independent process and measurement noise under undirected communication topologies. The main breakthroughs are the design of distributed event-triggered output feedback control strategy and the stochastic stability analysis. Toward this, first, according to Kalman filtering theory, An observer is contrasted to optimally estimate the state of each agent. Next, a novel edge-based event-triggered mechanism (EBETM) is designed to reduce the communication frequency among agents effectively, and a positive interval between events is enforced in EBETM, which can eliminate the Zeno behavior. Then, stability of the estimation error and the consensus error systems is analyzed, the execution error is estimated and the almost sure consensus is achieved. Finally, a numerical example is given to show that MASs achieves almost sure consensus and there is a positive interval between the events of all edges.</p>\u0000 </div>","PeriodicalId":50347,"journal":{"name":"International Journal of Adaptive Control and Signal Processing","volume":null,"pages":null},"PeriodicalIF":3.9,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SummaryIn this article, for switched nonlinear time‐delay multi‐agent systems (MASs) under directed graphs, an adaptive event‐triggered (ET) consensus problem is investigated. Each agent's switching signal is allowed to be arbitrary and asynchronous. To save communication resources, an adaptive ET consensus strategy is designed. In addition, the Pade approximation approach is introduced to transform the system into an input delay‐free system. A Lyapunov–Krasovskii functional is employed to analyze the effect of time‐varying delays on system stability. It is proved that the consensus errors of switched NMASs are bounded, and the Zeno behavior does not exist. Finally, the presented strategy's effectiveness is verified by simulation results.
{"title":"Distributed adaptive event‐triggered consensus of switched nonlinear multi‐agent systems with state and input delays","authors":"Siwen Liu, Shi Li","doi":"10.1002/acs.3899","DOIUrl":"https://doi.org/10.1002/acs.3899","url":null,"abstract":"SummaryIn this article, for switched nonlinear time‐delay multi‐agent systems (MASs) under directed graphs, an adaptive event‐triggered (ET) consensus problem is investigated. Each agent's switching signal is allowed to be arbitrary and asynchronous. To save communication resources, an adaptive ET consensus strategy is designed. In addition, the Pade approximation approach is introduced to transform the system into an input delay‐free system. A Lyapunov–Krasovskii functional is employed to analyze the effect of time‐varying delays on system stability. It is proved that the consensus errors of switched NMASs are bounded, and the Zeno behavior does not exist. Finally, the presented strategy's effectiveness is verified by simulation results.","PeriodicalId":50347,"journal":{"name":"International Journal of Adaptive Control and Signal Processing","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：