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

IF 4 3区计算机科学

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

Yunchang Huang;Shi-Lu Dai

引用次数: 0

Inversion Attack and Countermeasure for Event-Based Sensor Schedule in Remote State Estimation 远程状态估计中基于事件的传感器调度的反演攻击及对策

IF 4 3区计算机科学

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

Qiulin Xu;Junlin Xiong

引用次数: 0

Distributed Algorithm Over Time-Varying Unbalanced Graphs for Optimization Problem Subject to Multiple Local Constraints 多局部约束下时变非平衡图优化问题的分布式算法

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-09-26 DOI: 10.1109/TCNS.2024.3469048

Hongzhe Liu;Wenwu Yu;Guanghui Wen;Wei Xing Zheng

引用次数: 0

Chattering Free Distributed Event-Triggered Adaptive Attitude Synchronization of Multiple Spacecraft With Positive Minimum Interevent Times 具有正最小事件间隔时间的无抖振分布式事件触发多航天器自适应姿态同步

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-09-25 DOI: 10.1109/TCNS.2024.3469049

Jiang Long;Wei Wang;Yangming Guo;Zun Liu

{"title":"Chattering Free Distributed Event-Triggered Adaptive Attitude Synchronization of Multiple Spacecraft With Positive Minimum Interevent Times","authors":"Jiang Long;Wei Wang;Yangming Guo;Zun Liu","doi":"10.1109/TCNS.2024.3469049","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3469049","url":null,"abstract":"The attitude synchronization control problem of multiple uncertain spacecraft with event-triggered communication is an interesting research topic. However, the existing results are difficult to ensure the positive minimum interevent times (MIETs) while achieving asymptotic convergence performance. Besides, the drawback that the controllers of the spacecraft suffer from chattering may exist, due to the transmitted discontinuous neighbors' states. To overcome the difficulty and drawback, two novel distributed adaptive control strategies are presented under event-triggered communication condition. Specifically, we first consider the attitude synchronization convergence. To estimate the final synchronization value of the attitude while avoiding the undesirable chattering phenomenon of the controllers, a distributed attitude filter with event-triggered state transmission is presented for each spacecraft, which can generate a continuous reference signal for each spacecraft. To ensure the positive MIETs, a novel triggering condition is designed, by resorting to a clock-like variable. Based on the attitude filter and triggering condition, a distributed adaptive attitude synchronization control scheme is presented. Then, we further generalize the design idea to consider the attitude synchronization tracking of a stationary leader, where a distributed event-triggered adaptive attitude tracking control scheme is proposed. Finally, simulation results are provided to validate the effectiveness of the proposed control strategies.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"374-386"},"PeriodicalIF":4.0,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675986","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

Privacy-Preserving Distributed Nash Equilibrium Seeking for Noncooperative Games With Masked Interactive Information 具有掩蔽交互信息的非合作博弈的隐私保护分布式纳什均衡寻优

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-09-25 DOI: 10.1109/TCNS.2024.3469030

Xin Cai

引用次数: 0

Model-Free Learning and Optimal Policy Design in Multiagent MDPs Under Probabilistic Agent Dropout 概率Agent退出下多Agent mdp的无模型学习与最优策略设计

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-09-25 DOI: 10.1109/TCNS.2024.3469031

Carmel Fiscko;Soummya Kar;Bruno Sinopoli

{"title":"Model-Free Learning and Optimal Policy Design in Multiagent MDPs Under Probabilistic Agent Dropout","authors":"Carmel Fiscko;Soummya Kar;Bruno Sinopoli","doi":"10.1109/TCNS.2024.3469031","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3469031","url":null,"abstract":"This work studies a multiagent Markov decision process (MDP) that can undergo agent dropout and the computation of policies for the postdropout system based on control and sampling of the predropout system. The central planner's objective is to find an optimal policy that maximizes the value of the expected system given a priori knowledge of the agents' dropout probabilities. For MDPs with a certain transition independence and reward separability structure, we assume that removing agents from the system forms a new MDP comprised of the remaining agents with new state and action spaces, transition dynamics that marginalize the removed agents, and rewards that are independent of the removed agents. We first show that under these assumptions, the value of the expected postdropout system can be represented by a single MDP; this “robust MDP” eliminates the need to evaluate all <inline-formula><tex-math>$2^{N}$</tex-math></inline-formula> realizations of the system, where <inline-formula><tex-math>$N$</tex-math></inline-formula> denotes the number of agents. More significantly, in a model-free context, it is shown that the robust MDP value can be estimated with samples generated by the predropout system, meaning that robust policies can be found before dropout occurs. This fact is used to propose a policy importance sampling (IS) routine that performs policy evaluation for dropout scenarios while controlling the existing system with good predropout policies. The policy IS routine produces value estimates for both the robust MDP and specific postdropout system realizations and is justified with exponential confidence bounds. Finally, the utility of this approach is verified in simulation, showing how structural properties of agent dropout can help a controller find good postdropout policies before dropout occurs.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"361-373"},"PeriodicalIF":4.0,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675889","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

Quantized Privacy-Preserving Algorithms for Homogeneous and Heterogeneous Networks With Finite Transmission Guarantees 有限传输保证的同质和异构网络的量化隐私保护算法

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-09-25 DOI: 10.1109/TCNS.2024.3468990

Apostolos I. Rikos;Christoforos N. Hadjicostis;Karl H. Johansson

{"title":"Quantized Privacy-Preserving Algorithms for Homogeneous and Heterogeneous Networks With Finite Transmission Guarantees","authors":"Apostolos I. Rikos;Christoforos N. Hadjicostis;Karl H. Johansson","doi":"10.1109/TCNS.2024.3468990","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3468990","url":null,"abstract":"Privacy protection is increasingly critical in various applications due to the prevalence of networked systems. In this article, we focus on preserving the privacy of nodes' initial states while computing their average in a network. Curious nodes attempt to identify the initial states of other nodes without interfering in the computation. To address this challenge, we propose two privacy-preserving algorithms. The first algorithm operates over homogeneous networks, i.e., nodes have consistent processing delays and are able to communicate in a synchronous fashion. The second algorithm operates over heterogeneous networks, i.e., nodes have varying processing delays and communicate in an asynchronous fashion. Our algorithms exhibit efficient communication, finite-time convergence, and operation termination after convergence, making them suitable for resource-constrained environments. We also present topological conditions under which our algorithms enable privacy preservation. Finally, we apply our algorithms to a smart grid system and compare their performance against other algorithms, emphasizing their advantages in communication efficiency, convergence rate, and privacy preservation.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"325-337"},"PeriodicalIF":4.0,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675980","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 Event-Triggered Cooperative Output Regulation for Multiagent Systems 多智能体系统的分布式事件触发协同输出调节

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2024-09-25 DOI: 10.1109/TCNS.2024.3469029

Jiakang Han;Xiaoqun Wu;Bing Mao;Hui Liu;Jinhu Lü

引用次数: 0

A Decentralized Market Mechanism for Energy Communities Under Operating Envelopes 运行信封下的分散式能源社区市场机制

IF 4 3区计算机科学

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

Ahmed S. Alahmed;Guido Cavraro;Andrey Bernstein;Lang Tong

{"title":"A Decentralized Market Mechanism for Energy Communities Under Operating Envelopes","authors":"Ahmed S. Alahmed;Guido Cavraro;Andrey Bernstein;Lang Tong","doi":"10.1109/TCNS.2024.3466651","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3466651","url":null,"abstract":"We propose an operating envelopes (OEs) aware energy community market mechanism that dynamically charges/rewards its members based on two-part pricing. The OEs are imposed exogenously by a regulated distribution system operator (DSO) on the energy community's revenue meter and are subject to a generalized net energy metering tariff design. By formulating the interaction of the community operator and its members as a Stackelberg game, we show that the proposed two-part pricing achieves a Nash equilibrium and maximizes the community's social welfare in a decentralized fashion while ensuring that the community's operation abides by the OEs. The market mechanism conforms with the cost-causation principle and guarantees community members a surplus level no less than their maximum surplus when they autonomously face the DSO. The dynamic and uniform community price is a monotonically decreasing function of the community's aggregate renewable generation. We also analyze the impact of exogenous parameters, such as NEM rates and OEs, on the value of joining the community. Lastly, through numerical studies, we showcase the community's welfare and pricing, and compare its members' surplus to customers under the DSO's regime.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"313-324"},"PeriodicalIF":4.0,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675982","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

IEEE Transactions on Control of Network Systems Information for Authors 电气和电子工程师学会网络系统控制论文集作者须知

IF 4 3区计算机科学

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

引用次数: 0