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

Misinformation Regulation in the Presence of Competition Between Social Media Platforms 社交媒体平台竞争中的误导监管

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432249

So Sasaki;Cédric Langbort

{"title":"Misinformation Regulation in the Presence of Competition Between Social Media Platforms","authors":"So Sasaki;Cédric Langbort","doi":"10.1109/TCNS.2024.3432249","DOIUrl":"10.1109/TCNS.2024.3432249","url":null,"abstract":"Social media platforms have diverse content moderation policies, with many prominent actors hesitant to impose strict regulations. A key reason for this reluctance could be the competitive advantage that comes with lax regulation. A popular platform that starts enforcing content moderation rules may fear that it could lose users to less-regulated alternative platforms. Moreover, if users continue harmful activities on other platforms, regulation ends up being futile. This article examines the competitive aspect of content moderation by considering the motivations of all involved players (platformer, news source, and social media users), identifying the regulation policies sustained in equilibrium, and evaluating the information quality available on each platform. Applied to simple yet relevant social networks, such as stochastic block models, our model reveals the conditions for a popular platform to enforce strict regulation without losing users. Effectiveness of regulation depends on the diffusive property of news posts, friend interaction qualities in social media, the sizes and cohesiveness of communities, and how much sympathizers appreciate surprising news from influencers.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1080-1090"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10607922","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778265","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}

引用次数: 0

Unifying Chance-Constrained and Robust Optimal Power Flow for Resilient Network Operations 统一机会约束和鲁棒性最优电力流，实现弹性网络运营

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432188

Álvaro Porras;Line Roald;Juan Miguel Morales;Salvador Pineda

{"title":"Unifying Chance-Constrained and Robust Optimal Power Flow for Resilient Network Operations","authors":"Álvaro Porras;Line Roald;Juan Miguel Morales;Salvador Pineda","doi":"10.1109/TCNS.2024.3432188","DOIUrl":"10.1109/TCNS.2024.3432188","url":null,"abstract":"Uncertainty in renewable energy generation has the potential to adversely impact the operation of electric networks. Numerous approaches to manage this impact have been proposed, ranging from stochastic and chance-constrained programming to robust optimization. However, these approaches either tend to be conservative or leave the system vulnerable to low-probability, high-impact uncertainty realizations. To address this issue, we propose a new formulation for stochastic optimal power flow that explicitly distinguishes between “normal operation,” in which automatic generation control (AGC) is sufficient to guarantee system security, and “adverse operation,” in which the system operator is required to take additional actions, e.g., manual reserve deployment. The new formulation has been compared with the classical ones in a case study on the IEEE-118 and IEEE-300 bus systems. We observe that our consideration of extreme scenarios enables solutions that are more secure than typical chance-constrained formulations, yet less costly than solutions that guarantee robust feasibility with only AGC.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1052-1061"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778264","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

Distributed Stackelberg Equilibrium Seeking for Networked Multi-Leader Multi-Follower Games with A Clustered Information Structure 具有聚类信息结构的网络化多领导者多追随者博弈的分布式斯塔克尔伯格均衡寻求

IF 4.2 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/tcns.2024.3432138

Yue Chen, Peng Yi

引用次数: 0

Event-Triggered Robust Synchronization of Probabilistic Boolean Networks: Robust Invariant Set Approach 概率布尔网络的事件触发稳健同步：鲁棒不变集方法

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432826

Dingyuan Zhong;Jianquan Lu;Jinde Cao

{"title":"Event-Triggered Robust Synchronization of Probabilistic Boolean Networks: Robust Invariant Set Approach","authors":"Dingyuan Zhong;Jianquan Lu;Jinde Cao","doi":"10.1109/TCNS.2024.3432826","DOIUrl":"10.1109/TCNS.2024.3432826","url":null,"abstract":"In this article, we consider event-triggered control (ETC) to achieve robust synchronization between Boolean networks and probabilistic Boolean networks (PBNs). The advantage of the controller in this article lies in its robustness against random disturbances, which unavoidably exist in real networks because of environmental changes. Moreover, the proposed ETC effectively reduces energy consumption, because it achieves the control objective using the shortest possible time without unnecessary updates of the feedback gain. First, robust synchronization is equivalently converted to robust set stabilization of an augmented PBN using the semitensor product. Second, a feasible algorithm is presented to calculate the largest robust control invariant set of a given set, based on which a necessary and sufficient condition is developed for the existence of event-triggered controllers. Then, a detailed configuration of all feasible controllers is provided by a constructive algorithm. Under some mild conditions, global controllers are designed to further reduce computation load. Finally, examples are provided to illustrate the main results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1150-1162"},"PeriodicalIF":4.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778268","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

Sublinear Dynamic Regrets for Aggregative Games With Feedback Delays and Communication Delays 具有反馈延迟和通信延迟的聚合博弈的次线性动态遗憾

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-07-23 DOI: 10.1109/TCNS.2024.3432250

Pin Liu;Letian Wang;Yue Chen

引用次数: 0

Dynamic-Based Privacy Preservation for Distributed Economic Dispatch of Microgrids 基于动态的微电网分布式经济调度隐私保护

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-07-22 DOI: 10.1109/TCNS.2024.3431730

Huqiang Cheng;Xiaofeng Liao;Huaqing Li;Qingguo Lü

{"title":"Dynamic-Based Privacy Preservation for Distributed Economic Dispatch of Microgrids","authors":"Huqiang Cheng;Xiaofeng Liao;Huaqing Li;Qingguo Lü","doi":"10.1109/TCNS.2024.3431730","DOIUrl":"10.1109/TCNS.2024.3431730","url":null,"abstract":"With an escalating emphasis on distributed economic dispatch within microgrid systems due to its inherent adaptability, scalability, and sustainability, an extensive focus on the confidentiality of this field is pronouncedly emerging. The primary emphasis of this study is the safeguarding of power-sensitive information in the distributed economic dispatch issue prevalent in microgrids. This pursuit leads us to the development of a distributed optimization algorithm that preserves privacy, tailored for directed networks. The algorithm strives to secure a balance between supply and demand at the lowest economic cost, all while adhering to real-world constraints and maintaining the confidentiality of power-sensitive information. To fulfill this objective, we propose a novel privacy-preserving distributed algorithm that capitalizes on the inherent resilience exhibited by system dynamics toward uncertainty. Specifically, to ensure privacy preservation, we strategically incorporate randomness into the mixing weights, thereby generating a degree of uncertainty in communication messages during the initial iteration. Rigorous analysis is built to delineate that our method can achieve exact convergence and ensure the confidentiality of power-sensitive information. Further, additional numerical trials conducted on an IEEE 14-bus system substantiate the algorithm's practical efficiency.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1029-1039"},"PeriodicalIF":4.0,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778277","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

Hierarchical Prescribed-Performance Nonlinear Control for Teleoperation of Networked Secondary Robots With Coupling Constraints 用于具有耦合约束条件的联网从属机器人远程操作的分层规定性能非线性控制

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-07-22 DOI: 10.1109/TCNS.2024.3431728

Jing-Zhe Xu;Huai-Lin Peng;Ming-Feng Ge;Zhi-Wei Liu;Huaicheng Yan;Jie Liu

{"title":"Hierarchical Prescribed-Performance Nonlinear Control for Teleoperation of Networked Secondary Robots With Coupling Constraints","authors":"Jing-Zhe Xu;Huai-Lin Peng;Ming-Feng Ge;Zhi-Wei Liu;Huaicheng Yan;Jie Liu","doi":"10.1109/TCNS.2024.3431728","DOIUrl":"10.1109/TCNS.2024.3431728","url":null,"abstract":"In order to solve the problems of the insufficient static-dynamic performance and coupling constraints (namely, input saturation, input dead zone, and output constraint) for practical teleoperation systems, the teleoperation framework of the networked secondary robots with the directed communication network is newly constructed; meanwhile, the hierarchical prescribed-performance nonlinear control algorithm being consisted of the local controller and the state estimator is proposed for the constructed framework. This framework allows us to prescribe the static-dynamic performance of the controlled system in advance. In the process of the state estimator, the communication load of multiple secondary robots is deployed in a distributed and cost-effective way. In the local controller, the tracking error is transformed and well regulated by using the newly designed prescribed-performance constrained boundary. Besides, the novel adaptive fuzzy strategy is presented to eliminate the effects of input saturation and dead zone. Furthermore, the output constraint of the system is also ensured by using the local controller with the barrier Lyapunov function.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"1006-1017"},"PeriodicalIF":4.0,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778276","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

Distributed Optimization for Quadratic Cost Functions With Quantized Communication and Finite-Time Convergence 二次成本函数的分布式优化与量化通信和有限时间收敛

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-07-19 DOI: 10.1109/TCNS.2024.3431413

Apostolos I. Rikos;Andreas Grammenos;Evangelia Kalyvianaki;Christoforos N. Hadjicostis;Themistoklis Charalambous;Karl H. Johansson

{"title":"Distributed Optimization for Quadratic Cost Functions With Quantized Communication and Finite-Time Convergence","authors":"Apostolos I. Rikos;Andreas Grammenos;Evangelia Kalyvianaki;Christoforos N. Hadjicostis;Themistoklis Charalambous;Karl H. Johansson","doi":"10.1109/TCNS.2024.3431413","DOIUrl":"10.1109/TCNS.2024.3431413","url":null,"abstract":"In this article, we propose two distributed iterative algorithms that can be used to solve the distributed optimization problem for quadratic local cost functions over large-scale networks in finite time. The first algorithm exhibits synchronous operation while the second one exhibits asynchronous operation. Both algorithms operate exclusively with quantized values. This means that the information stored, processed, and exchanged between neighboring nodes is subject to deterministic uniform quantization. The algorithms rely on event-driven updates in order to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage. Finally, once the algorithms converge, nodes distributively terminate their operation. We prove that our algorithms converge in a finite number of iterations to the exact optimal solution depending on the quantization level, and we present applications of our algorithms to, first, optimal task scheduling for data centers, and second, global model aggregation for distributed federated learning. We provide simulations of these applications to illustrate the operation, performance, and advantages of the proposed algorithms. In addition, it is shown that our proposed algorithms compare favorably to algorithms in the current literature.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"930-942"},"PeriodicalIF":4.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10605038","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737397","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}

引用次数: 0

Network-Based $Hinfty$ Control for Descriptor Systems With Time Delays Under a Novel Event-Triggered Strategy 新型事件触发策略下基于网络的时延描述符系统 H ∞ 控制

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-07-19 DOI: 10.1109/TCNS.2024.3431412

Ya-Li Zhi;Xu Liu;Ying Wang;Yuan Fan

引用次数: 0

Design of Linear Deception Attacks Against State Estimation in Multiplant Power Systems 针对多发电厂电力系统状态估计的线性欺骗攻击设计

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-07-19 DOI: 10.1109/TCNS.2024.3431388

Chuanyi Ning;Fei Hao

{"title":"Design of Linear Deception Attacks Against State Estimation in Multiplant Power Systems","authors":"Chuanyi Ning;Fei Hao","doi":"10.1109/TCNS.2024.3431388","DOIUrl":"10.1109/TCNS.2024.3431388","url":null,"abstract":"In this article, we address the problem of designing linear deception attacks against multiplant power systems. In the existing deception attack schemes, only sensor measurement channels are regarded as targets of attackers. Here, attack strategies against the edge measurements in power systems are provided as well to achieve a larger estimation error. Moreover, it is found that attack signals with a dependent nature perform better than the independent ones under the same stealthiness constraints. For dependent attacks, a necessary and sufficient condition to guarantee the unboundedness of the estimation error was obtained. Then, the problem of designing dependent attacks is further analyzed. Different suboptimal attack strategies are provided by solving nonconvex problem or transforming the nonconvex problem into a convex one. It is worth noting that all the attack signals concerned in this article are independent of real-time data of system operation, thus can be designed offline and be easier for application. Finally, simulation results are provided based on the IEEE 4-bus system to demonstrate the feasibility and the efficiency of theoretical results. Comparisons of different attack schemes are provided as well.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"882-893"},"PeriodicalIF":4.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737395","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