Pub Date : 2025-04-08DOI: 10.1109/TCNS.2025.3558779
Xiongnan He;Zongli Lin;Qing Chang
In this article, we study the distributed Nash equilibrium seeking problem for energy consumption of multizone heating, ventilation, and air conditioning (HVAC) systems. Beyond considering the aggregation of users' strategies in energy costs, we incorporate comfort levels into the cost function, enhancing its applicability to reflect users' comprehensive demands. In addition, this study considers the energy consumption of an HVAC system that is governed by the regulated indoor temperatures within its zones and addresses the dynamics of the temperatures, presenting a noncooperative Nash game involving players with dynamic models in the context of a multizone HVAC systems connected by a strongly connected communication network. The dynamics of the indoor temperature in each zone is affected by the outside environment, the external thermal disturbance, and the temperatures in its neighboring zones. The disturbances we consider are general bounded disturbances with unknown bounds. Furthermore, we also consider temperature constraints in individual zones to accommodate the requirements of the HVAC users. Consequently, the distributed estimator approach, the adaptive control method, and the projected gradient-based technique are integrated to address all these considerations. Both full and partial information cases are studied, and the resulting algorithms are illustrated on a numerical example of an energy consumption game.
{"title":"Aggregative Game Analysis for Energy Consumption of Multizone HVAC Systems","authors":"Xiongnan He;Zongli Lin;Qing Chang","doi":"10.1109/TCNS.2025.3558779","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3558779","url":null,"abstract":"In this article, we study the distributed Nash equilibrium seeking problem for energy consumption of multizone heating, ventilation, and air conditioning (HVAC) systems. Beyond considering the aggregation of users' strategies in energy costs, we incorporate comfort levels into the cost function, enhancing its applicability to reflect users' comprehensive demands. In addition, this study considers the energy consumption of an HVAC system that is governed by the regulated indoor temperatures within its zones and addresses the dynamics of the temperatures, presenting a noncooperative Nash game involving players with dynamic models in the context of a multizone HVAC systems connected by a strongly connected communication network. The dynamics of the indoor temperature in each zone is affected by the outside environment, the external thermal disturbance, and the temperatures in its neighboring zones. The disturbances we consider are general bounded disturbances with unknown bounds. Furthermore, we also consider temperature constraints in individual zones to accommodate the requirements of the HVAC users. Consequently, the distributed estimator approach, the adaptive control method, and the projected gradient-based technique are integrated to address all these considerations. Both full and partial information cases are studied, and the resulting algorithms are illustrated on a numerical example of an energy consumption game.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2194-2206"},"PeriodicalIF":5.0,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110266","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-04-08DOI: 10.1109/TCNS.2025.3558802
Iven Guzel;Richard Y. Zhang
To estimate accurate voltage phasors from inaccurate voltage magnitude and complex power measurements, the standard approach is to iteratively refine a good initial guess using the Gauss–Newton method. However, the nonconvexity of the estimation makes the Gauss–Newton method sensitive to its initial guess, so human intervention is needed to detect convergence to plausible but ultimately spurious estimates. This article makes a novel connection between the angle estimation subproblem and phase synchronization to yield two key benefits: first, an exceptionally high-quality initial guess over the angles, known as a spectral initialization, and second, a correctness guarantee for the estimated angles, known as a global optimality certificate. These are formulated as sparse eigenvalue–eigenvector problems, which we efficiently compute in time comparable to a few Gauss–Newton iterations. Our experiments on the complete set of Polish, PEGASE, and RTE models show, where voltage magnitudes are already reasonably accurate, that spectral initialization provides an almost-perfect single-shot estimation of $n$ angles from $2n$ moderately noisy bus power measurements (i.e., $n$ pairs of PQ measurements), whose correctness becomes guaranteed after a single Gauss–Newton iteration. For less-accurate voltage magnitudes, the performance of the method degrades gracefully; even with moderate voltage magnitude errors, the estimated voltage angles remain surprisingly accurate.
{"title":"Power System State Estimation by Phase Synchronization and Eigenvectors","authors":"Iven Guzel;Richard Y. Zhang","doi":"10.1109/TCNS.2025.3558802","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3558802","url":null,"abstract":"To estimate accurate voltage phasors from inaccurate voltage magnitude and complex power measurements, the standard approach is to iteratively refine a good initial guess using the Gauss–Newton method. However, the nonconvexity of the estimation makes the Gauss–Newton method sensitive to its initial guess, so human intervention is needed to detect convergence to plausible but ultimately spurious estimates. This article makes a novel connection between the angle estimation subproblem and phase synchronization to yield two key benefits: first, an exceptionally high-quality initial guess over the angles, known as a <italic>spectral initialization</i>, and second, a correctness guarantee for the estimated angles, known as a <italic>global optimality certificate</i>. These are formulated as sparse eigenvalue–eigenvector problems, which we efficiently compute in time comparable to a few Gauss–Newton iterations. Our experiments on the complete set of Polish, PEGASE, and RTE models show, where voltage magnitudes are already reasonably accurate, that spectral initialization provides an almost-perfect single-shot estimation of <inline-formula><tex-math>$n$</tex-math></inline-formula> angles from <inline-formula><tex-math>$2n$</tex-math></inline-formula> moderately noisy bus power measurements (i.e., <inline-formula><tex-math>$n$</tex-math></inline-formula> pairs of PQ measurements), whose correctness becomes guaranteed after a single Gauss–Newton iteration. For less-accurate voltage magnitudes, the performance of the method degrades gracefully; even with moderate voltage magnitude errors, the estimated voltage angles remain surprisingly accurate.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2207-2218"},"PeriodicalIF":5.0,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10955489","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110285","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-04-08DOI: 10.1109/TCNS.2025.3558791
Kunpeng Zhang;Xinlei Yi;Guanghui Wen;Ming Cao;Karl H. Johansson;Tianyou Chai;Tao Yang
This article considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal–dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and nonincreasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results.
{"title":"Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints","authors":"Kunpeng Zhang;Xinlei Yi;Guanghui Wen;Ming Cao;Karl H. Johansson;Tianyou Chai;Tao Yang","doi":"10.1109/TCNS.2025.3558791","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3558791","url":null,"abstract":"This article considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal–dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and nonincreasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2242-2253"},"PeriodicalIF":5.0,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110281","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-04-08DOI: 10.1109/TCNS.2025.3558830
Wei Tian;Hsiao-Dong Chiang;Tao Wang
Tight lower bounds on the number of locally optimal solutions provide useful information regarding the number of locally optimal solutions in the ac optimal power flow (ACOPF) problems. This article is devoted to deriving three lower bounds for the number of locally optimal solutions by exploring feasible components of the OPF models and the associated Karush–Kuhn–Tucker (KKT) saddle points. The three lower bounds derived in this article are shown to be progressively tightened by exploring the KKT saddle points. Each derived lower bound is equipped with a theoretical foundation. The analytical results of the derived lower bounds are illustrated on numerous IEEE test systems.
{"title":"Toward Tight Lower Bounds for the Number of AC Optimal Power Flow Solutions","authors":"Wei Tian;Hsiao-Dong Chiang;Tao Wang","doi":"10.1109/TCNS.2025.3558830","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3558830","url":null,"abstract":"Tight lower bounds on the number of locally optimal solutions provide useful information regarding the number of locally optimal solutions in the ac optimal power flow (ACOPF) problems. This article is devoted to deriving three lower bounds for the number of locally optimal solutions by exploring feasible components of the OPF models and the associated Karush–Kuhn–Tucker (KKT) saddle points. The three lower bounds derived in this article are shown to be progressively tightened by exploring the KKT saddle points. Each derived lower bound is equipped with a theoretical foundation. The analytical results of the derived lower bounds are illustrated on numerous IEEE test systems.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2231-2241"},"PeriodicalIF":5.0,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110317","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-31DOI: 10.1109/TCNS.2025.3556478
Gewei Zuo;Lijun Zhu
The event-triggered control with intermittent output can reduce the communication burden between the controller and plant sides over the network. It has been exploited for adaptive output feedback control of uncertain nonlinear systems in the literature; however, the controller must partially reside at the plant side where computation capacity is required. In this article, all controller components are moved to the controller side, and their dynamics use sampled states rather than continuous ones with the benefit of directly estimating the next triggering instance of some conditions and avoiding constantly checking the event condition at the controller side. However, these bring two major challenges. First, the virtual input designed in the dynamic filtering technique for stabilization is no longer differentiable. Second, the plant output is sampled to transmit at the plant side and sampled again at the controller side to construct the controller, and the two asynchronous samplings make the analysis more involved. This article solves these two issues by introducing a new state observer to simplify the adaptive law, a set of continuous companion variables for stability analysis, and a new lemma quantifying the error bound between the actual output signal and the sampled transmitted output. It is theoretically guaranteed that all internal signals in the closed-loop system are semiglobally bounded and the output is practically stabilized to the origin. Finally, the numerical simulation illustrates the effectiveness of the proposed scheme.
{"title":"Adaptive Event-Triggered Control With Sampled Transmitted Output and Controller Dynamics","authors":"Gewei Zuo;Lijun Zhu","doi":"10.1109/TCNS.2025.3556478","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3556478","url":null,"abstract":"The event-triggered control with intermittent output can reduce the communication burden between the controller and plant sides over the network. It has been exploited for adaptive output feedback control of uncertain nonlinear systems in the literature; however, the controller must partially reside at the plant side where computation capacity is required. In this article, all controller components are moved to the controller side, and their dynamics use sampled states rather than continuous ones with the benefit of directly estimating the next triggering instance of some conditions and avoiding constantly checking the event condition at the controller side. However, these bring two major challenges. First, the virtual input designed in the dynamic filtering technique for stabilization is no longer differentiable. Second, the plant output is sampled to transmit at the plant side and sampled again at the controller side to construct the controller, and the two asynchronous samplings make the analysis more involved. This article solves these two issues by introducing a new state observer to simplify the adaptive law, a set of continuous companion variables for stability analysis, and a new lemma quantifying the error bound between the actual output signal and the sampled transmitted output. It is theoretically guaranteed that all internal signals in the closed-loop system are semiglobally bounded and the output is practically stabilized to the origin. Finally, the numerical simulation illustrates the effectiveness of the proposed scheme.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2169-2179"},"PeriodicalIF":5.0,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110288","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-31DOI: 10.1109/TCNS.2025.3556483
Baihao Peng;Junfeng Liu;Jun Zeng
Modeling and analysis play a crucial role in the prevention, safeguarding, and assessment of network security. However, existing literature on network security modeling overlooks the realistic convertibility between malware states. Thus, based on the susceptible–infected–susceptible compartmental model, this study proposes a susceptible–infected–exhausted–susceptible model that includes an enhanced transition pathway of the malware state. Subsequently, considering the potential heterogeneity of network topology and pulse wave attacks (PA), three additional models are expanded upon. Concurrently, the dynamic stability analyses of these four models have been conducted to verify the practicality of effective control by malicious attackers (MA) and network defenders (ND) within these frameworks to achieve their respective benefits. Finally, based on the framework of optimal control and game theory, we discuss and simulate attack–defense confrontation under various scenarios, including different objective functions, network topologies, control forms, and parameter combinations. Experimental results demonstrate that in most cases, MA refrained from launching malicious attacks but continued malware propagation. Under certain conditions, malware may remain in a dormant state indefinitely. Meanwhile, ND consistently engages in network repair regardless of MA's actions. MA's revenue peaks when launching continuous-time attacks in the financial network, while ND's revenue is at its lowest. In the majority of instances, under PA and higher operation costs, MA's efficacy is lower, while ND performs better.
{"title":"Propagation Dynamics of Network System in Response to the Resource-Consuming Attack","authors":"Baihao Peng;Junfeng Liu;Jun Zeng","doi":"10.1109/TCNS.2025.3556483","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3556483","url":null,"abstract":"Modeling and analysis play a crucial role in the prevention, safeguarding, and assessment of network security. However, existing literature on network security modeling overlooks the realistic convertibility between malware states. Thus, based on the susceptible–infected–susceptible compartmental model, this study proposes a susceptible–infected–exhausted–susceptible model that includes an enhanced transition pathway of the malware state. Subsequently, considering the potential heterogeneity of network topology and pulse wave attacks (PA), three additional models are expanded upon. Concurrently, the dynamic stability analyses of these four models have been conducted to verify the practicality of effective control by malicious attackers (MA) and network defenders (ND) within these frameworks to achieve their respective benefits. Finally, based on the framework of optimal control and game theory, we discuss and simulate attack–defense confrontation under various scenarios, including different objective functions, network topologies, control forms, and parameter combinations. Experimental results demonstrate that in most cases, MA refrained from launching malicious attacks but continued malware propagation. Under certain conditions, malware may remain in a dormant state indefinitely. Meanwhile, ND consistently engages in network repair regardless of MA's actions. MA's revenue peaks when launching continuous-time attacks in the financial network, while ND's revenue is at its lowest. In the majority of instances, under PA and higher operation costs, MA's efficacy is lower, while ND performs better.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2180-2193"},"PeriodicalIF":5.0,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110329","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-31DOI: 10.1109/TCNS.2025.3556392
Tingting Ru;Chenxiao Cai;Hong Lin;Imre J. Rudas;Peng Shi
This article studies formation control for multiagent systems in the presence of denial-of-service (DoS) attacks. The challenge is to address secure formation tracking and communication bandwidth-saving issues simultaneously. To tackle this, we propose a switching-like event-triggered mechanism that reduces excessive bandwidth consumption during interactions among multiple followers under DoS attacks. The triggering condition is allowed to be switched during the intervals when attacks are activated, ensuring that triggering can normally occur throughout the overall time interval by introducing an auxiliary variable depending on the success of the latest trigger moment. Based on this approach, we construct an event-based time-varying formation control scheme. In addition, we establish sufficient conditions that reveal the relationship between exponential stability and the frequency/duration of the DoS attacks. Unlike other single-leader methods, a significant feature of the formation control scheme is its ability to achieve the desired formation tracking for multiagent systems with multiple leaders. Finally, the validity of the proposed method is demonstrated through simulation and experimental results.
{"title":"Switching-Like Event-Based Formation Control for Multiagent Systems Against Denial-of-Service Attacks","authors":"Tingting Ru;Chenxiao Cai;Hong Lin;Imre J. Rudas;Peng Shi","doi":"10.1109/TCNS.2025.3556392","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3556392","url":null,"abstract":"This article studies formation control for multiagent systems in the presence of denial-of-service (DoS) attacks. The challenge is to address secure formation tracking and communication bandwidth-saving issues simultaneously. To tackle this, we propose a switching-like event-triggered mechanism that reduces excessive bandwidth consumption during interactions among multiple followers under DoS attacks. The triggering condition is allowed to be switched during the intervals when attacks are activated, ensuring that triggering can normally occur throughout the overall time interval by introducing an auxiliary variable depending on the success of the latest trigger moment. Based on this approach, we construct an event-based time-varying formation control scheme. In addition, we establish sufficient conditions that reveal the relationship between exponential stability and the frequency/duration of the DoS attacks. Unlike other single-leader methods, a significant feature of the formation control scheme is its ability to achieve the desired formation tracking for multiagent systems with multiple leaders. Finally, the validity of the proposed method is demonstrated through simulation and experimental results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2156-2168"},"PeriodicalIF":5.0,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110324","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-24DOI: 10.1109/TCNS.2025.3554015
Qian Zhao;Haoyuan Xu;Yuzhe Li
Networked control systems, facilitating state estimation through wireless multisensor data transmission, encounter challenges with spatial out-of-order issues, where data transmitted to the fusion center lack identifiable sources. This scenario, analogous to post office boxes receiving letters without addresses, complicates state estimation and affects system accuracy and reliability. To address this, we explore two spatial out-of-order scenarios, focusing on enhancing state estimation precision. For the random out-of-order scenario, characterized by unpredictable sensor data sequences, we propose an accumulative measurement approach and introduce two algorithms to restore data order, thereby improving state estimation accuracy. In the fixed out-of-order scenario, where a consistent but unknown pattern exists, our two algorithms efficiently restore measurement order within a limited time frame. Numerical examples and simulations substantiate the effectiveness of our methods, confirming their utility in maintaining accurate system state estimation.
{"title":"State Estimation of Multisensor With Out-of-Order Measurements","authors":"Qian Zhao;Haoyuan Xu;Yuzhe Li","doi":"10.1109/TCNS.2025.3554015","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3554015","url":null,"abstract":"Networked control systems, facilitating state estimation through wireless multisensor data transmission, encounter challenges with spatial out-of-order issues, where data transmitted to the fusion center lack identifiable sources. This scenario, analogous to post office boxes receiving letters without addresses, complicates state estimation and affects system accuracy and reliability. To address this, we explore two spatial out-of-order scenarios, focusing on enhancing state estimation precision. For the random out-of-order scenario, characterized by unpredictable sensor data sequences, we propose an accumulative measurement approach and introduce two algorithms to restore data order, thereby improving state estimation accuracy. In the fixed out-of-order scenario, where a consistent but unknown pattern exists, our two algorithms efficiently restore measurement order within a limited time frame. Numerical examples and simulations substantiate the effectiveness of our methods, confirming their utility in maintaining accurate system state estimation.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2144-2155"},"PeriodicalIF":5.0,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110256","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-24DOI: 10.1109/TCNS.2025.3554005
Zicong Xia;Wenwu Yu;Wei Ren
This article formulates a predefined-time multiagent approach to distributed nonconvex constrained optimization and tackles the challenges caused by the nonconvexity and nonlinearly coupled information. The divergence caused by nonconvexity is handled by utilizing a momentum-based system, and the distributed computation of nonlinearly coupled optimization information, as well as the distributed comparison of global function values, is dealt with by introducing estimation state variables. Then, combined with time-base generators, the proposed multiagent system is proven to be stable at a local optimal solution within a predefined time. The simulations of a chiller system and a numerical example are elaborated to verify and demonstrate the enhanced stability, predefined-time convergence, and distributed computation capability of the proposed multiagent approach.
{"title":"A Predefined-Time Multiagent Approach to Distributed Nonconvex Optimization With Nonlinearly Coupled Information","authors":"Zicong Xia;Wenwu Yu;Wei Ren","doi":"10.1109/TCNS.2025.3554005","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3554005","url":null,"abstract":"This article formulates a predefined-time multiagent approach to distributed nonconvex constrained optimization and tackles the challenges caused by the nonconvexity and nonlinearly coupled information. The divergence caused by nonconvexity is handled by utilizing a momentum-based system, and the distributed computation of nonlinearly coupled optimization information, as well as the distributed comparison of global function values, is dealt with by introducing estimation state variables. Then, combined with time-base generators, the proposed multiagent system is proven to be stable at a local optimal solution within a predefined time. The simulations of a chiller system and a numerical example are elaborated to verify and demonstrate the enhanced stability, predefined-time convergence, and distributed computation capability of the proposed multiagent approach.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2128-2143"},"PeriodicalIF":5.0,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110306","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-24DOI: 10.1109/TCNS.2025.3554006
Yang Yang;Kaijie Yang;Wenbin Yue;Zhiyuan Li;Chao Deng
Sensitive information is critical in networked systems, and a differential privacy problem of dynamic average consensus (DAC) is reported for a class of multiagent systems that cannot communicate directly. With the help of a cloud repository, a cloud-based differentially private DAC control scheme is proposed. Agents' states are added noises, and combined states are constructed. With combined state errors, a self-triggered rule for a cloud access schedule is proposed in a cloud framework. With this proposed scheme, the related system consensus accuracy and privacy-preserving index are analyzed. Furthermore, the relationship, between the privacy-preserving index and parameters in a cloud access scheduling rule, is investigated. Finally, two examples are given to demonstrate the feasibility of the scheme.
{"title":"Differentially Private Dynamic Average Consensus of Multiagent Systems via Cloud Access With Self-Triggered Mechanism","authors":"Yang Yang;Kaijie Yang;Wenbin Yue;Zhiyuan Li;Chao Deng","doi":"10.1109/TCNS.2025.3554006","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3554006","url":null,"abstract":"Sensitive information is critical in networked systems, and a differential privacy problem of dynamic average consensus (DAC) is reported for a class of multiagent systems that cannot communicate directly. With the help of a cloud repository, a cloud-based differentially private DAC control scheme is proposed. Agents' states are added noises, and combined states are constructed. With combined state errors, a self-triggered rule for a cloud access schedule is proposed in a cloud framework. With this proposed scheme, the related system consensus accuracy and privacy-preserving index are analyzed. Furthermore, the relationship, between the privacy-preserving index and parameters in a cloud access scheduling rule, is investigated. Finally, two examples are given to demonstrate the feasibility of the scheme.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 3","pages":"2115-2127"},"PeriodicalIF":5.0,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110239","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
扫码关注我们
求助内容：
应助结果提醒方式：