Pub Date : 2025-03-05DOI: 10.1109/TCNS.2025.3548155
Duong Thuy Anh Nguyen;Duong Tung Nguyen;Angelia Nedić
This article proposes a distributed algorithm to find the Nash equilibrium in a class of noncooperative convex games with partial-decision information. Our method employs a distributed projected gradient play approach alongside consensus dynamics, with individual agents minimizing their local costs through gradient steps and local information exchange with neighbors via a time-varying directed communication network. Addressing time-varying directed graphs presents significant challenges. Existing methods often circumvent this by focusing on static graphs or specific types of directed graphs or by requiring the stepsizes to scale with the Perron–Frobenius eigenvectors. In contrast, we establish novel results that provide a contraction property for the mixing terms associated with time-varying row-stochastic weight matrices. Our approach explicitly expresses the contraction coefficient based on the characteristics of the weight matrices and graph connectivity structures, rather than implicitly through the second-largest singular value of the weight matrix as in prior studies. The established results facilitate proving geometric convergence of the proposed algorithm and advance convergence analysis for distributed algorithms in time-varying directed communication networks. Numerical results on a Nash–Cournot game demonstrate the efficacy of the proposed method.
{"title":"Distributed Nash Equilibrium Seeking Over Time-Varying Directed Communication Networks","authors":"Duong Thuy Anh Nguyen;Duong Tung Nguyen;Angelia Nedić","doi":"10.1109/TCNS.2025.3548155","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3548155","url":null,"abstract":"This article proposes a distributed algorithm to find the Nash equilibrium in a class of noncooperative convex games with partial-decision information. Our method employs a distributed projected gradient play approach alongside consensus dynamics, with individual agents minimizing their local costs through gradient steps and local information exchange with neighbors via a time-varying directed communication network. Addressing time-varying directed graphs presents significant challenges. Existing methods often circumvent this by focusing on static graphs or specific types of directed graphs or by requiring the stepsizes to scale with the Perron–Frobenius eigenvectors. In contrast, we establish novel results that provide a contraction property for the mixing terms associated with time-varying row-stochastic weight matrices. Our approach explicitly expresses the contraction coefficient based on the characteristics of the weight matrices and graph connectivity structures, rather than implicitly through the second-largest singular value of the weight matrix as in prior studies. The established results facilitate proving geometric convergence of the proposed algorithm and advance convergence analysis for distributed algorithms in time-varying directed communication networks. Numerical results on a Nash–Cournot game demonstrate the efficacy of the proposed method.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"1917-1929"},"PeriodicalIF":5.0,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315441","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-03-02DOI: 10.1109/TCNS.2025.3566318
Xudong Chen;Bahman Gharesifard
We consider continuum ensembles of linear time-invariant control systems with single inputs. A sparsity pattern is said to be structurally averaged controllable if it admits an averaged controllable linear ensemble system. We provide a necessary and sufficient condition for a sparsity pattern to be structurally averaged controllable.
{"title":"Structural Averaged Controllability for Linear Ensemble Systems: Single-Input Case","authors":"Xudong Chen;Bahman Gharesifard","doi":"10.1109/TCNS.2025.3566318","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3566318","url":null,"abstract":"We consider continuum ensembles of linear time-invariant control systems with single inputs. A sparsity pattern is said to be structurally averaged controllable if it admits an averaged controllable linear ensemble system. We provide a necessary and sufficient condition for a sparsity pattern to be structurally averaged controllable.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2314-2324"},"PeriodicalIF":5.0,"publicationDate":"2025-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110267","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-03-01DOI: 10.1109/TCNS.2025.3566319
Zhaolong Wu;Xiaowei Zhao
This article presents a prediction-correction proximal method (PCPM) for the general nonsmooth convex optimization problem with linear equality and inequality constraints. The proposed algorithm includes three crucial points, i.e., proximal-point regularizer, primal-dual method, and inertial update rule. For the first point, we use a proximal quadratic-form term to regularize the Lagrangian function to maintain the strong-convex property for the primal and dual subproblems. Then, a primal-dual method is adopted to update the predicted solutions of primal and dual subproblems, which are subsequently corrected by an inertial update rule. An alternating iterative procedure is carried out between the primal-dual method and the inertial update rule to find the optimal solution. We present the convergence analysis based on the strongly convex characteristic of the proximal operator and the saddle-point theorem and prove that our algorithm has the worst case $mathcal {O}({1}/{k})$ convergence rate for the general nonsmooth convex optimization problems. Furthermore, we present an algorithmic extension of PCPM to solve the separable convex optimization problems. The numerical experiments on a nonsmooth convex optimization problem, a multiblock separable convex optimization problem, and a networked optimization problem have verified the validity and performance of our method.
{"title":"A Prediction-Correction Proximal Method for Convex Optimization With Linear Equality and Inequality Constraints","authors":"Zhaolong Wu;Xiaowei Zhao","doi":"10.1109/TCNS.2025.3566319","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3566319","url":null,"abstract":"This article presents a prediction-correction proximal method (PCPM) for the general nonsmooth convex optimization problem with linear equality and inequality constraints. The proposed algorithm includes three crucial points, i.e., proximal-point regularizer, primal-dual method, and inertial update rule. For the first point, we use a proximal quadratic-form term to regularize the Lagrangian function to maintain the strong-convex property for the primal and dual subproblems. Then, a primal-dual method is adopted to update the predicted solutions of primal and dual subproblems, which are subsequently corrected by an inertial update rule. An alternating iterative procedure is carried out between the primal-dual method and the inertial update rule to find the optimal solution. We present the convergence analysis based on the strongly convex characteristic of the proximal operator and the saddle-point theorem and prove that our algorithm has the worst case <inline-formula><tex-math>$mathcal {O}({1}/{k})$</tex-math></inline-formula> convergence rate for the general nonsmooth convex optimization problems. Furthermore, we present an algorithmic extension of PCPM to solve the separable convex optimization problems. The numerical experiments on a nonsmooth convex optimization problem, a multiblock separable convex optimization problem, and a networked optimization problem have verified the validity and performance of our method.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2300-2313"},"PeriodicalIF":5.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110282","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-03-01DOI: 10.1109/TCNS.2025.3566322
Pascale Bendotti;Nadia Oudjane;Cheng Wan
In this article, an original technique is proposed to control the aggregated electrical consumption of a population of flexible devices in order to follow a target consumption profile. The approach relies on an inversion technique, which takes advantage of the large number of devices to be controlled by mean-field approximations. Theoretical results justify the relevance of the proposed mean-field inversion technique. Finally, numerical simulations involving a population of water heaters show a good tradeoff between performance and amount of control input compared to a proportional–integral controller.
{"title":"Distributed Control of Flexible Loads by Mean-Field Inversion","authors":"Pascale Bendotti;Nadia Oudjane;Cheng Wan","doi":"10.1109/TCNS.2025.3566322","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3566322","url":null,"abstract":"In this article, an original technique is proposed to control the aggregated electrical consumption of a population of flexible devices in order to follow a target consumption profile. The approach relies on an inversion technique, which takes advantage of the large number of devices to be controlled by mean-field approximations. Theoretical results justify the relevance of the proposed mean-field inversion technique. Finally, numerical simulations involving a population of water heaters show a good tradeoff between performance and amount of control input compared to a proportional–integral controller.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2325-2336"},"PeriodicalIF":5.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110323","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-03-01DOI: 10.1109/TCNS.2025.3566320
Guoqing Zhang;Yingshuo Xing;Weidong Zhang;Jiqiang Li
In this article, to effectively implement the environmental monitoring mission around the perimeter of a rocky area, a prescribed performance control (PPC) scheme is proposed for an underactuted surface vehicle–underactuted aerial vehicle system using the robust bounded compensating technique (RBCT). First, a grid cell guidance law is introduced for rocky area scanning, considering the heterogeneous system's differing maneuverability. The grid cell undergoes a comprehensive calculation process to ensure that it meets operational requirements. Subsequently, a prescribed performance control scheme based on the RBCT is proposed to reduce design and computational complexity. A novel prescribed performance function is developed to regulate transient performance and initial errors. The RBCT is employed not only to eliminate system uncertainties but also to resolve the “calculation explosion” problem, thereby simplifying the control design. The system's global stability is proved via Lyapunov theory. Simulation results demonstrate the effectiveness of the PPC-RBCT scheme.
{"title":"Prescribed Performance Control for USV-UAV via a Robust Bounded Compensating Technique","authors":"Guoqing Zhang;Yingshuo Xing;Weidong Zhang;Jiqiang Li","doi":"10.1109/TCNS.2025.3566320","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3566320","url":null,"abstract":"In this article, to effectively implement the environmental monitoring mission around the perimeter of a rocky area, a prescribed performance control (PPC) scheme is proposed for an underactuted surface vehicle–underactuted aerial vehicle system using the robust bounded compensating technique (RBCT). First, a grid cell guidance law is introduced for rocky area scanning, considering the heterogeneous system's differing maneuverability. The grid cell undergoes a comprehensive calculation process to ensure that it meets operational requirements. Subsequently, a prescribed performance control scheme based on the RBCT is proposed to reduce design and computational complexity. A novel prescribed performance function is developed to regulate transient performance and initial errors. The RBCT is employed not only to eliminate system uncertainties but also to resolve the “calculation explosion” problem, thereby simplifying the control design. The system's global stability is proved via Lyapunov theory. Simulation results demonstrate the effectiveness of the PPC-RBCT scheme.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2289-2299"},"PeriodicalIF":5.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110330","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-03-01DOI: 10.1109/TCNS.2025.3566331
Chenhui Xu;Defeng He;Mingqi Lv;Haiping Du;Yu Kang
This article addresses the distributed fusion estimation problem of clustered sensor networks with multirate sampling and multiscale fading. An event-triggered distributed two-stage fusion estimation method is proposed for the clustered sensor network. Specifically, a local fusion estimator is first constructed to fuse multirate measurements transmitted through small-scale fading channels. The parameters of the estimator are computed by solving linear matrix inequalities (LMIs). Then, the event-triggered mechanism (ETM) is utilized to adjust the transmission frequency of local estimates, aiming to conserve the energy of cluster heads. Furthermore, by solving a min–max optimization problem, a global fusion estimator is designed to fuse the local estimates in the presence of the ETM and large-scale fading channels. Sufficient conditions for the stochastic ultimate boundedness of both local and global estimation errors are derived by leveraging differential game theory and LMIs. The comparison simulation results on a dc-power network show the effectiveness and advantages of the proposed method.
{"title":"Event-Triggered Distributed Fusion Estimation for Clustered Sensor Networks With Multiscale Fading and Multirate Sampling Characteristics","authors":"Chenhui Xu;Defeng He;Mingqi Lv;Haiping Du;Yu Kang","doi":"10.1109/TCNS.2025.3566331","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3566331","url":null,"abstract":"This article addresses the distributed fusion estimation problem of clustered sensor networks with multirate sampling and multiscale fading. An event-triggered distributed two-stage fusion estimation method is proposed for the clustered sensor network. Specifically, a local fusion estimator is first constructed to fuse multirate measurements transmitted through small-scale fading channels. The parameters of the estimator are computed by solving linear matrix inequalities (LMIs). Then, the event-triggered mechanism (ETM) is utilized to adjust the transmission frequency of local estimates, aiming to conserve the energy of cluster heads. Furthermore, by solving a min–max optimization problem, a global fusion estimator is designed to fuse the local estimates in the presence of the ETM and large-scale fading channels. Sufficient conditions for the stochastic ultimate boundedness of both local and global estimation errors are derived by leveraging differential game theory and LMIs. The comparison simulation results on a dc-power network show the effectiveness and advantages of the proposed method.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"1943-1956"},"PeriodicalIF":5.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315443","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-28DOI: 10.1109/TCNS.2025.3546788
Zengjie Zhang;Qingchen Liu;Mohammad H. Mamduhi;Sandra Hirche
Quantifying the average communication rate (ACR) of a networked event-triggered stochastic control system (NET-SCS) with deterministic thresholds is challenging due to the nonstationary nature of the system's stochastic processes. For a NET-SCS, the propagation of nonlinear statistics of the network communication status brought up by deterministic thresholds makes the precise computation of ACR difficult. Previous work used to oversimplify the computation using a Gaussian distribution without incorporating this nonlinearity, leading to sacrificed precision. This article proposes a novel approach to calculate the exact ACR for a NET-SCS using a recursive model. We use theoretical analysis and a numerical study to qualitatively evaluate the deviation gap of the conventional approach that ignores the side information. The accuracy of our proposed method, alongside its comparison with the simplified results of the conventional approach, is validated by experimental studies. Our work is promising to benefit the efficient resource planning of networked control systems with limited communication resources by providing accurate ACR computation.
{"title":"Average Communication Rate for Networked Event-Triggered Stochastic Control Systems","authors":"Zengjie Zhang;Qingchen Liu;Mohammad H. Mamduhi;Sandra Hirche","doi":"10.1109/TCNS.2025.3546788","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3546788","url":null,"abstract":"Quantifying the average communication rate (ACR) of a networked event-triggered stochastic control system (NET-SCS) with deterministic thresholds is challenging due to the nonstationary nature of the system's stochastic processes. For a NET-SCS, the propagation of nonlinear statistics of the network communication status brought up by deterministic thresholds makes the precise computation of ACR difficult. Previous work used to oversimplify the computation using a Gaussian distribution without incorporating this nonlinearity, leading to sacrificed precision. This article proposes a novel approach to calculate the exact ACR for a NET-SCS using a recursive model. We use theoretical analysis and a numerical study to qualitatively evaluate the deviation gap of the conventional approach that ignores the side information. The accuracy of our proposed method, alongside its comparison with the simplified results of the conventional approach, is validated by experimental studies. Our work is promising to benefit the efficient resource planning of networked control systems with limited communication resources by providing accurate ACR computation.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"1894-1905"},"PeriodicalIF":5.0,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315454","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-27DOI: 10.1109/TCNS.2025.3546785
Qingtan Meng;Qian Ma;Gang Feng;Lu Liu;Yang Shi
This article investigates the fixed-time Nash equilibrium seeking for noncooperative games over networked players, where the players are supposed to have only access to the actions of their neighboring players. Novel consensus-based distributed fixed-time Nash equilibrium seeking strategies are proposed for players with both the first-order and second-order dynamics. Via Lyapunov-based techniques, it is proved that under the proposed strategies, the actions of players with both first-order and second-order dynamics can converge to the Nash equilibrium within a fixed time, which is upper bounded by a finite constant independent of the players' initial conditions. Simulation results are provided to verify the effectiveness of the proposed seeking strategies.
{"title":"Distributed Fixed-Time Nash Equilibrium Seeking for Noncooperative Games","authors":"Qingtan Meng;Qian Ma;Gang Feng;Lu Liu;Yang Shi","doi":"10.1109/TCNS.2025.3546785","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3546785","url":null,"abstract":"This article investigates the fixed-time Nash equilibrium seeking for noncooperative games over networked players, where the players are supposed to have only access to the actions of their neighboring players. Novel consensus-based distributed fixed-time Nash equilibrium seeking strategies are proposed for players with both the first-order and second-order dynamics. Via Lyapunov-based techniques, it is proved that under the proposed strategies, the actions of players with both first-order and second-order dynamics can converge to the Nash equilibrium within a fixed time, which is upper bounded by a finite constant independent of the players' initial conditions. Simulation results are provided to verify the effectiveness of the proposed seeking strategies.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"1906-1916"},"PeriodicalIF":5.0,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315455","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-19DOI: 10.1109/TCNS.2025.3543754
Yao Xu;Ziming Zhang;Xiangpeng Xie;Reinaldo Martínez Palhares;Wenxue Li;Yongbao Wu
This article investigates impulsive security protocols with the goal of achieving consensus of fractional-order fuzzy multiagent systems (FOFMASs). In contrast to multiagent systems characterized by ordinary differential equations, FOFMASs are created using Takagi–Sugeno fuzzy rules and fractional-order differential equations, which allow for nonlinearities with parameter uncertainties and also manage memory effects. Due to the potential of denial-of-service (DoS) attacks, the topology among nodes may change, and it is necessary to gain insight into the security consensus under topology switching. This article tackles the security protocol problem by designing a distributed impulsive control for each agent, relying on global delayed communications and topology switching resulting from DoS attacks. Analyzing the stability of impulse-free error systems is a salient problem. Supported by the Lyapunov method and average impulsive interval method, for two cases of self-stabilization or instability of the error system in the absence of impulse, some sufficient conditions are presented to ensure the exponential consensus of FOFMASs under distributed impulsive control with communication delays. Besides, several corollaries are provided to guarantee the consensus under distributed impulsive control without communication delays. Finally, two numerical examples are provided, and some numerical simulations are given to confirm the efficacy of the theoretical findings.
{"title":"Consensus of Fractional-Order Fuzzy Multiagent Systems: Exploring Impulsive Security Protocols","authors":"Yao Xu;Ziming Zhang;Xiangpeng Xie;Reinaldo Martínez Palhares;Wenxue Li;Yongbao Wu","doi":"10.1109/TCNS.2025.3543754","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3543754","url":null,"abstract":"This article investigates impulsive security protocols with the goal of achieving consensus of fractional-order fuzzy multiagent systems (FOFMASs). In contrast to multiagent systems characterized by ordinary differential equations, FOFMASs are created using Takagi–Sugeno fuzzy rules and fractional-order differential equations, which allow for nonlinearities with parameter uncertainties and also manage memory effects. Due to the potential of denial-of-service (DoS) attacks, the topology among nodes may change, and it is necessary to gain insight into the security consensus under topology switching. This article tackles the security protocol problem by designing a distributed impulsive control for each agent, relying on global delayed communications and topology switching resulting from DoS attacks. Analyzing the stability of impulse-free error systems is a salient problem. Supported by the Lyapunov method and average impulsive interval method, for two cases of self-stabilization or instability of the error system in the absence of impulse, some sufficient conditions are presented to ensure the exponential consensus of FOFMASs under distributed impulsive control with communication delays. Besides, several corollaries are provided to guarantee the consensus under distributed impulsive control without communication delays. Finally, two numerical examples are provided, and some numerical simulations are given to confirm the efficacy of the theoretical findings.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"1869-1880"},"PeriodicalIF":5.0,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315439","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-18DOI: 10.1109/TCNS.2025.3543667
Lan Zhang;Maobin Lu;Fang Deng;Jie Chen
In this article, we investigate cooperative output regulation of heterogeneous linear multiagent systems subject to an uncertain exosystem over directed communication networks. Compared with existing results, a fully distributed output-based adaptive observer is developed that eliminates the requirement for global information of communication networks and improves practical feasibility. By establishing a sequence of technical lemmas, it is demonstrated that the proposed distributed adaptive observer attains distributed exponential estimation of the unknown parameter and the state of the uncertain exosystem under directed communication networks. Leveraging the certainty equivalence principle, both the distributed state feedback control law and the distributed measurement output feedback control law are proposed to solve the problem. Moreover, two applications, active automotive suspension control under unknown road profiles and cooperative output regulation of multiple LCL-coupled inverter-based distributed generation systems, are provided to verify the proposed approach.
{"title":"Cooperative Output Regulation Subject to Uncertain Exosystems and Its Application: A Fully Distributed Adaptive Observer Approach","authors":"Lan Zhang;Maobin Lu;Fang Deng;Jie Chen","doi":"10.1109/TCNS.2025.3543667","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3543667","url":null,"abstract":"In this article, we investigate cooperative output regulation of heterogeneous linear multiagent systems subject to an uncertain exosystem over directed communication networks. Compared with existing results, a fully distributed output-based adaptive observer is developed that eliminates the requirement for global information of communication networks and improves practical feasibility. By establishing a sequence of technical lemmas, it is demonstrated that the proposed distributed adaptive observer attains distributed exponential estimation of the unknown parameter and the state of the uncertain exosystem under directed communication networks. Leveraging the certainty equivalence principle, both the distributed state feedback control law and the distributed measurement output feedback control law are proposed to solve the problem. Moreover, two applications, active automotive suspension control under unknown road profiles and cooperative output regulation of multiple <italic>LCL-</i>coupled inverter-based distributed generation systems, are provided to verify the proposed approach.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"1830-1842"},"PeriodicalIF":5.0,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：