发布求助
文献互助 智能选刊 最新文献

IEEE Transactions on Control of Network Systems最新文献

筛选
英文 中文
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
{"title":"Privacy-Preserving Distributed Nash Equilibrium Seeking for Noncooperative Games With Masked Interactive Information","authors":"Xin Cai","doi":"10.1109/TCNS.2024.3469030","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3469030","url":null,"abstract":"The privacy preservation problem in distributed Nash equilibrium (NE) seeking for noncooperative games is studied in this article. Different from adding random noises to the transmitted data in estimators for some global information, a dynamical privacy preservation method is used to both protect each agent's strategy and avoid reconstructing the privacy of agents. Thus, a novel distributed algorithm is proposed with the masked interactive information to seek NE. Moreover, a discrete-time communication scheme is designed based on an event-triggering rule without the Zeno behavior for the multiagent noncooperative game. The accurate convergence of the designed distributed algorithm is established, rather than the bounded convergence of the differential privacy-based algorithms. The performance of the designed algorithm with communication delay is also analyzed. Cournot competition with distributed energy resources is taken as an example to verify the proposed algorithm.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"351-360"},"PeriodicalIF":4.0,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676147","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
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ü
{"title":"Distributed Event-Triggered Cooperative Output Regulation for Multiagent Systems","authors":"Jiakang Han;Xiaoqun Wu;Bing Mao;Hui Liu;Jinhu Lü","doi":"10.1109/TCNS.2024.3469029","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3469029","url":null,"abstract":"The cooperative output regulation problem of heterogeneous nonlinear multiagent systems is investigated by using the distributed event-triggered control. One of the main challenges in solving this problem is removing the restrictions imposed on the exosystem matrix while avoiding using global information. To address this challenge, a distributed event-triggered observer is proposed for each agent to estimate the upper bound of the norm of the exosystem matrix, based on which all agents can obtain the same upper bound in finite time. In particular, two types of distributed event-triggered observers are designed to estimate the exosystem matrix and the exosystem state. Meanwhile, with a clock-like variable being incorporated into the event-triggered mechanism, the existence of a positive minimum interevent time can be guaranteed for each agent. Furthermore, external disturbances with known dynamics can be compensated effectively by the proposed adaptive controllers. A numerical example is finally given to illustrate the effectiveness of the proposed control technique.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"338-350"},"PeriodicalIF":4.0,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676143","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 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
{"title":"IEEE Transactions on Control of Network Systems Information for Authors","authors":"","doi":"10.1109/TCNS.2024.3441430","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3441430","url":null,"abstract":"","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"11 3","pages":"1730-1731"},"PeriodicalIF":4.0,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10684317","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142274899","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
IEEE Control Systems Society Information 电气和电子工程师学会控制系统协会信息
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-19 DOI: 10.1109/TCNS.2024.3441429
{"title":"IEEE Control Systems Society Information","authors":"","doi":"10.1109/TCNS.2024.3441429","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3441429","url":null,"abstract":"","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"11 3","pages":"C2-C2"},"PeriodicalIF":4.0,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10684315","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142276517","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
Multirobot Stochastic Patrolling via Graph Partitioning 通过图谱划分实现多机器人随机巡逻
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-18 DOI: 10.1109/TCNS.2024.3463502
Weizhen Wang;Xiaoming Duan;Jianping He
{"title":"Multirobot Stochastic Patrolling via Graph Partitioning","authors":"Weizhen Wang;Xiaoming Duan;Jianping He","doi":"10.1109/TCNS.2024.3463502","DOIUrl":"10.1109/TCNS.2024.3463502","url":null,"abstract":"In this article, we study a multirobot stochastic patrolling problem by employing graph partitioning techniques, where each robot adopts a Markov-chain-based strategy over its assigned subgraph, so that the overall patrolling performance is optimized. To quantify the patrolling performance of the robot team, we first introduce a novel performance measure based on the mean first hitting time. We then formulate optimization problems for unweighted complete graphs and transcribe it to the well-known maximum <inline-formula><tex-math>$k$</tex-math></inline-formula>-cut problem. To reduce the computational complexity, we identify a special solution structure of the optimization problem, and we develop an efficient heuristic descent-based algorithm by taking advantage of this special property of the optimal solution. We show that our algorithm converges in a finite number of steps and finds a suboptimal solution that preserves the special solution structure and satisfies a suboptimality bound. We validate our findings through numerical experiments and show the clear advantages of our partition-based strategy.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"300-312"},"PeriodicalIF":4.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142255001","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 Control Within a Trapezoid Virtual Tube Containing Obstacles for Robotic Swarms Subject to Speed Constraints 受速度限制的机器人群在含有障碍物的梯形虚拟管内的分布式控制
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-18 DOI: 10.1109/TCNS.2024.3463472
Yan Gao;Chenggang Bai;Quan Quan
{"title":"Distributed Control Within a Trapezoid Virtual Tube Containing Obstacles for Robotic Swarms Subject to Speed Constraints","authors":"Yan Gao;Chenggang Bai;Quan Quan","doi":"10.1109/TCNS.2024.3463472","DOIUrl":"10.1109/TCNS.2024.3463472","url":null,"abstract":"In our previous work, we design a trapezoid virtual tube to guide robotic swarms through narrow openings. This article extends the application of the trapezoid virtual tube to the situations where there are static obstacles inside and robots have strict speed constraints. We first propose a distributed swarm controller for the trapezoid virtual tube without obstacles and present the relationship between the trapezoid virtual tube and speed constraints. Then, a switching logic for obstacle avoidance is proposed by dividing the trapezoid virtual tube containing static obstacles into several subtrapezoid virtual tubes without obstacles. Formal analyses and proofs are presented to demonstrate that all robots can pass through the trapezoid virtual tube safely. Besides, we validate the effectiveness of our method through numerical simulations and real experiments.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"287-299"},"PeriodicalIF":4.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254962","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
Nonlinear Multiagent Systems Consensus via Delayed Nonfragile Sampled-Data Control 通过延迟非脆弱采样数据控制达成非线性多代理系统共识
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-18 DOI: 10.1109/TCNS.2024.3463507
Zhengliang Zhai;Huaicheng Yan;Shiming Chen;Yufang Chang;Kaibo Shi
{"title":"Nonlinear Multiagent Systems Consensus via Delayed Nonfragile Sampled-Data Control","authors":"Zhengliang Zhai;Huaicheng Yan;Shiming Chen;Yufang Chang;Kaibo Shi","doi":"10.1109/TCNS.2024.3463507","DOIUrl":"10.1109/TCNS.2024.3463507","url":null,"abstract":"This article investigates the consensus issue of nonlinear multiagent systems by utilizing the delayed nonfragile sampled-data control mechanism. First of all, in consideration of the aperiodic sampling and the transmission time, a novel type extended looped functional is constructed. In the extended looped functional, some integral state vectors are first utilized to achieve the goal of enlarging the sampling interval upper bound. And, to guarantee the flexibility of the controller, the sampling fluctuation is taken into account in the design procedure. Then, on the basis of free-matrix-based inequalities, several sufficient consensus criteria with less conservativeness are obtained, which are presented as linear matrix inequalities. Eventually, an example of autonomous aerial vehicles is exhibited to prove the validity and advantages of the proposed consensus criteria.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"275-286"},"PeriodicalIF":4.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254961","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信