IEEE Transactions on Control of Network Systems最新文献_第2页

Opinion Dynamics for Utility Maximizing Agents: Exploring the Impact of the Resource Penalty

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-12-02 DOI: 10.1109/TCNS.2024.3510590

Prashil Wankhede;Nirabhra Mandal;Sonia Martínez;Pavankumar Tallapragada

{"title":"Opinion Dynamics for Utility Maximizing Agents: Exploring the Impact of the Resource Penalty","authors":"Prashil Wankhede;Nirabhra Mandal;Sonia Martínez;Pavankumar Tallapragada","doi":"10.1109/TCNS.2024.3510590","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3510590","url":null,"abstract":"We propose a continuous-time nonlinear model of opinion dynamics with utility-maximizing agents connected via a social influence network. A distinguishing feature of the proposed model is the inclusion of an opinion-dependent resource-penalty term in the utilities, which limits the agents from holding opinions of large magnitude. This model is applicable in scenarios where the opinions pertain to the usage of resources, such as money, time, computational resources, etc. Each agent myopically seeks to maximize its utility by revising its opinion in the gradient ascent direction of its utility function, thus leading to the proposed opinion dynamics. We show that for any arbitrary social influence network, opinions are ultimately bounded. For networks with <italic>weak antagonistic relations, we show that there exists a globally exponentially stable equilibrium using contraction theory. We establish conditions for the existence of consensus equilibrium and analyze the relative dominance of the agents at consensus. We also conduct a game-theoretic analysis of the underlying opinion formation game, including on Nash equilibria and on prices of anarchy in terms of <italic>satisfaction ratios. In addition, we also investigate the oscillatory behavior of opinions in a two-agent scenario. Finally, simulations illustrate our findings.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"5-17"},"PeriodicalIF":4.0,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675669","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}

引用次数: 0

Constraint-Projection-Based Actor–Critic Algorithm for Dynamic Distributed Economic Dispatch With Nonconvex Nonsmooth Cost

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-12-02 DOI: 10.1109/TCNS.2024.3510598

Jun Li;Huaqing Li;Dawen Xia;Tingwen Huang;Lifeng Zheng;Liang Ran;Lianghao Ji

{"title":"Constraint-Projection-Based Actor–Critic Algorithm for Dynamic Distributed Economic Dispatch With Nonconvex Nonsmooth Cost","authors":"Jun Li;Huaqing Li;Dawen Xia;Tingwen Huang;Lifeng Zheng;Liang Ran;Lianghao Ji","doi":"10.1109/TCNS.2024.3510598","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3510598","url":null,"abstract":"Out of consideration for the dynamic demand of energy dispatching with local affine constraints and globally shared nonconvex nonsmooth hybrid cost arising from highly prevalent intermittent renewable energy sources, load effects, and multiple fuel resources, the constraint-projection-based actor–critic algorithm is investigated to solve the dynamic distributed economic dispatch problem in microgrids. To characterize the generation power against the fuel cost, we denote various fuel choices by segmented nonconvex costs. To help address the lack of prior knowledge of the system model, we propose a novel distributed actor–critic algorithm to find the feasible power. The algorithm combines the actor policy network with the multiplier splitting approach and projected gradient method, maps the action's policy distribution to a feasible power interval, and finally realizes real-time dispatching in continuous action space by approximating the evaluation function from the critic network. The convergence of the algorithm is theoretically analyzed. The effectiveness of the approach is verified by several simulations.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1102-1114"},"PeriodicalIF":4.0,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667718","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}

引用次数: 0

Certifying Stability and Performance of Uncertain Differential–Algebraic Systems: A Dissipativity Framework

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-12-02 DOI: 10.1109/TCNS.2024.3510585

Emily Jensen;Neelay Junnarkar;Murat Arcak;Xiaofan Wu;Suat Gumussoy

引用次数: 0

Necessary and Sufficient Conditions for Finite-Time and Fixed-Time Bipartite Containment Control of Cooperative–Antagonistic Networks

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-11-11 DOI: 10.1109/TCNS.2024.3496653

Zhen-Hua Zhu;Huaiyu Wu;Han Wu;Zhi-Hong Guan;Xiujuan Zheng;Zhi-Wei Liu

{"title":"Necessary and Sufficient Conditions for Finite-Time and Fixed-Time Bipartite Containment Control of Cooperative–Antagonistic Networks","authors":"Zhen-Hua Zhu;Huaiyu Wu;Han Wu;Zhi-Hong Guan;Xiujuan Zheng;Zhi-Wei Liu","doi":"10.1109/TCNS.2024.3496653","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3496653","url":null,"abstract":"This article addresses the problems of finite-time and fixed-time bipartite containment control for single-integrator cooperative-antagonistic networks with multiple leaders over arbitrary weakly connected signed digraphs. The leaders can be either stationary or evolving dynamically through interacting with other leaders in their neighborhood. Based on the nearest neighbor rule, a unified distributed nonlinear control scheme is proposed. With rigorous Lyapunov-based analysis, it is shown that under the proposed control scheme, all followers can converge toward the convex hull formed by each leader's trajectory and its symmetrical trajectory having the same amplitude but different sign in a finite time or fixed time if and only if the underlying weakly connected signed digraph contains at least one structurally balanced closed strong component. As a byproduct, necessary and sufficient criteria are established for single-integrator cooperative-antagonistic networks to achieve finite-time and fixed-time bipartite consensuses, interval bipartite consensus, and stability. The effectiveness of the presented control scheme is illustrated via simulations.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"571-583"},"PeriodicalIF":4.0,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688083","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}

引用次数: 0

A New Framework on Controllability of the Second-Order Multiagent Systems Under Fixed and Switching Topologies

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-10-30 DOI: 10.1109/TCNS.2024.3488562

Hao Long;Yuanchao Si

引用次数: 0

Pinning Control Strategy for Prescribed-Time Synchronization of Stochastic Complex Dynamical Networks

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-10-30 DOI: 10.1109/TCNS.2024.3488515

Xiaotong Liu;Ying Guo;Jin Li;Mingzhu Li

引用次数: 0

A Safe First-Order Method for Pricing-Based Resource Allocation in Safety-Critical Networks

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-10-30 DOI: 10.1109/TCNS.2024.3488516

Berkay Turan;Spencer Hutchinson;Mahnoosh Alizadeh

{"title":"A Safe First-Order Method for Pricing-Based Resource Allocation in Safety-Critical Networks","authors":"Berkay Turan;Spencer Hutchinson;Mahnoosh Alizadeh","doi":"10.1109/TCNS.2024.3488516","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3488516","url":null,"abstract":"We introduce a novel algorithm for solving network utility maximization (NUM) problems that arise in resource allocation schemes over networks with known safety-critical constraints, where the constraints form an arbitrary convex and compact feasible set. Inspired by applications where customers' demand can only be affected through posted prices and real-time two-way communication with customers is not available, we require an algorithm to generate “safe prices.” This means that at no iteration should the realized demand in response to the posted prices violate the safety constraints of the network. Thus, in contrast to existing distributed first-order methods, our algorithm, called safe pricing for NUM (SPNUM), is guaranteed to produce feasible primal iterates at all iterations. At the heart of the algorithm lie two key steps that must go hand in hand to guarantee safety and convergence: first, applying a projected gradient method on a shrunk feasible set to get the desired demand, and second, estimating the price response function of the users and determining the price so that the induced demand is close to the desired demand. We ensure safety by adjusting the shrinkage to account for the error between the induced demand and the desired demand. In addition, by gradually reducing the amount of shrinkage and the step size of the gradient method, we prove that the primal iterates produced by the SPNUM achieve a sublinear static regret of <inline-formula><tex-math>${mathcal O}(log {(T)})$</tex-math></inline-formula> after <inline-formula><tex-math>$T$</tex-math></inline-formula> time steps.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"521-533"},"PeriodicalIF":4.0,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675989","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}

引用次数: 0

Hybrid Cooperative Output Regulation of Linear Multiagent Systems

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-10-30 DOI: 10.1109/TCNS.2024.3488555

Ying Zhang;Youfeng Su;He Cai

{"title":"Hybrid Cooperative Output Regulation of Linear Multiagent Systems","authors":"Ying Zhang;Youfeng Su;He Cai","doi":"10.1109/TCNS.2024.3488555","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3488555","url":null,"abstract":"In this article, the hybrid cooperative output regulation problem for linear multiagent systems is formulated and investigated, where both the exosystem and the agent dynamics are hybrid linear systems with periodic jumps. To solve this problem, a distributed observer approach is proposed, which consists of two steps. First, a novel output-based hybrid distributed observer is designed which can achieve distributed information estimation for various practical hybrid exosystems. Second, by incorporating a decentralized hybrid output feedback control law with the proposed hybrid distributed observer, a hybrid distributed output feedback control law is synthesized to solve the hybrid cooperative output regulation problem. In comparison with the existing works targeting purely continuous-time multiagent systems, the simplified forms for both the hybrid distributed observer and the hybrid output feedback control law proposed in this article exhibit prominent advantages from various aspects, such as robustness against intermittent communication links and the sampled measurement of system output for feedback. The effectiveness of the theoretical results is validated by solving the output synchronization problem for a hybrid electrical system made up of multiple heterogeneous <italic>RC circuits, where the capacitors are switched <sc>on and <sc>off periodically.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"558-570"},"PeriodicalIF":4.0,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675981","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}

引用次数: 0

Predefined-Time Synchronization of Kuramoto-Oscillator Networks: Chattering-Free Control Protocols

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-10-30 DOI: 10.1109/TCNS.2024.3488561

Jie Wu;Xiaofeng Wang;Yongzheng Sun;Xiaoli Luan;Guanghui Wen

{"title":"Predefined-Time Synchronization of Kuramoto-Oscillator Networks: Chattering-Free Control Protocols","authors":"Jie Wu;Xiaofeng Wang;Yongzheng Sun;Xiaoli Luan;Guanghui Wen","doi":"10.1109/TCNS.2024.3488561","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3488561","url":null,"abstract":"This article investigates the issues of predefined-time global phase agreement (PA) and frequency synchronization (FS) for both identical and nonidentical coupled Kuramoto oscillators by developing distributed chattering-free control protocols. Unlike traditional finite-/fixed-time convergence, the upper bounds of settling time for achieving the predefined-time PA and FS are explicit constants, which are tunable and set beforehand without depending on the network information, initial conditions, and controlling parameters. In particular, the proposed control protocols are differentiable, namely, chattering-free, which do not comprise the conventional discontinuous absolute value and/or signum functions anymore. Therefore, the undesirable chattering problem is effectively overcome. Then, in the light of the second Lyapunov method, the sufficient conditions are deduced for guaranteeing the predefined-time global PA and FS of Kuramoto-oscillator networks accordingly. Finally, the numerical results validate the effectiveness of the proposed chattering-free control schemes.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"534-545"},"PeriodicalIF":4.0,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675949","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}

引用次数: 0

A Constraint-Driven Approach to Line Flocking: The V Formation as an Energy-Saving Strategy

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-10-29 DOI: 10.1109/TCNS.2024.3487612

Logan E. Beaver;Christopher Kroninger;Michael Dorothy;Andreas A. Malikopoulos

{"title":"A Constraint-Driven Approach to Line Flocking: The V Formation as an Energy-Saving Strategy","authors":"Logan E. Beaver;Christopher Kroninger;Michael Dorothy;Andreas A. Malikopoulos","doi":"10.1109/TCNS.2024.3487612","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3487612","url":null,"abstract":"In this article, we present a constraint-driven control algorithm that minimizes the energy consumption of individual agents and yields an emergent V formation. As the formation emerges from the decentralized interaction between agents, our approach is robust to the spontaneous addition or removal of agents to the system. We start from an analytical model for the trailing upwash behind a fixed-wing uncrewed aerial vehicle (UAV), and we derive the optimal air speed for trailing UAVs to maximize their travel endurance. Next, we prove that simply flying at the optimal airspeed will never lead to emergent flocking behavior and propose a new decentralized “aneroid” behavior that yields emergent V formations. We encode these behaviors in a constraint-driven control algorithm that minimizes the locomotive power of each UAV. Finally, we prove that UAVs initialized in an approximate V or echelon formation will converge under our proposed control law, and we demonstrate that this emergence occurs in real time in simulation and in physical experiments with a fleet of Crazyflie quadrotors despite the noise and disturbances inherent in physical systems.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"438-449"},"PeriodicalIF":4.0,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675988","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}

引用次数: 0