IEEE Transactions on Control of Network Systems最新文献

筛选
英文 中文
Plug-and-Play Machine Learning-Based Model Predictive Control 即插即用机器学习模型预测控制
IF 5.3 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2026-09-01 Epub Date: 2026-03-08 DOI: 10.1109/TCNS.2026.3691498
Yuxiao Ji;Yao Shi;Ming Xiao;Zhe Wu
{"title":"Plug-and-Play Machine Learning-Based Model Predictive Control","authors":"Yuxiao Ji;Yao Shi;Ming Xiao;Zhe Wu","doi":"10.1109/TCNS.2026.3691498","DOIUrl":"https://doi.org/10.1109/TCNS.2026.3691498","url":null,"abstract":"This work presents a plug-and-play machine learning (ML)-based model predictive control (MPC) framework for interconnected nonlinear systems. Assuming that each subsystem is input-to-state stable, the stability of the entire system is ensured via the small-gain theorem. Sufficient conditions are derived to guarantee stability when MPCs using ML models are integrated into or used to replace existing controllers. The effectiveness of the framework is demonstrated through a numerical example and a nonlinear chemical process network.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"13 3","pages":"1360-1372"},"PeriodicalIF":5.3,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148985780","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 Distributed Generalized Nash Equilibrium Seeking Algorithm for Aggregative Games Over Time-Varying Unbalanced Graphs 时变非平衡图上聚集博弈的分布式广义纳什均衡寻求算法
IF 5.3 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2026-09-01 Epub Date: 2026-06-16 DOI: 10.1109/TCNS.2026.3704507
Tian Lu;Hongzhe Liu;He Wang;Wenwu Yu
{"title":"A Distributed Generalized Nash Equilibrium Seeking Algorithm for Aggregative Games Over Time-Varying Unbalanced Graphs","authors":"Tian Lu;Hongzhe Liu;He Wang;Wenwu Yu","doi":"10.1109/TCNS.2026.3704507","DOIUrl":"https://doi.org/10.1109/TCNS.2026.3704507","url":null,"abstract":"This article investigates an aggregative game with a shared linear coupling inequality constraint and local compact convex set constraints, where agents are distributed across a communication network. The goal is to find a generalized Nash equilibrium (GNE) of the game in a distributed manner over time-varying unbalanced graphs. To this end, we propose a distributed discrete-time GNE seeking algorithm that integrates the push-sum protocol with an aggregative information tracking mechanism. The algorithm also accommodates nonidentical step-sizes. By reformulating the algorithm as an extended Krasnosel'ski–Mann iteration, we establish its convergence to a variational GNE and analyze its convergence rate. Numerical simulations on a generalized Nash–Cournot game validate the effectiveness of the proposed algorithm.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"13 3","pages":"1809-1821"},"PeriodicalIF":5.3,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148985906","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 for Full-DOF Motion of Similarity-Based Rigid Formation 基于相似度的刚性编队全自由度运动分布式控制
IF 5.3 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2026-09-01 Epub Date: 2026-03-08 DOI: 10.1109/TCNS.2026.3691431
Yao Zou;Qing Dai;Xu Lyu;Wei Wang;Kewei Xia;Hui Wang;Zongyu Zuo
{"title":"Distributed Control for Full-DOF Motion of Similarity-Based Rigid Formation","authors":"Yao Zou;Qing Dai;Xu Lyu;Wei Wang;Kewei Xia;Hui Wang;Zongyu Zuo","doi":"10.1109/TCNS.2026.3691431","DOIUrl":"https://doi.org/10.1109/TCNS.2026.3691431","url":null,"abstract":"Compared with the distance-based or bearing-based rigid formation, the similarity-based rigid formation allows full-degree of freedom (DoF) trivial infinitesimal motions (i.e., translation, rotation, and scaling), which plays an important role in maneuvers within multiobstacle scenarios. To this end, this article focuses on the distributed control development for using the configuration maneuverability of the similarity-based rigid formation with mixed angle and distance ratio constraints. First of all, a basic coordinate-free distributed control composed of the gradient descent item and the velocity consensus item is proposed for the combined flocking and similar configuration stabilization with local exponential convergence. Next, the distributed control is modified for the velocity tracking of the similarity-based rigid formation to a reference that is only available to the leader agents. Besides, another modified distributed control is built for the orientation and scaling adjustment of the similarity-based rigid formation by just tuning the orientation and scaling of the regulator agents according to references. Moreover, it is shown that the minimal number of the leaders for the velocity tracking is one, and the minimal number of the regulators for the orientation and scaling adjustment is two for the planar formation or three for the spatial formation. By combining two modified distributed controls, the full-DoF motion adjustment of the similarity-based rigid formation is finally achieved. Simulation and experiment are both given to verify the adjustment performance.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"13 3","pages":"1321-1333"},"PeriodicalIF":5.3,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148985567","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
Enhancing Security in Multirobot Systems Through Co-Observation Planning, Reachability Analysis, and Network Flow 通过协同观察规划、可达性分析和网络流增强多机器人系统的安全性
IF 5.3 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2026-09-01 Epub Date: 2026-03-26 DOI: 10.1109/TCNS.2026.3697318
Ziqi Yang;Roberto Tron
{"title":"Enhancing Security in Multirobot Systems Through Co-Observation Planning, Reachability Analysis, and Network Flow","authors":"Ziqi Yang;Roberto Tron","doi":"10.1109/TCNS.2026.3697318","DOIUrl":"https://doi.org/10.1109/TCNS.2026.3697318","url":null,"abstract":"In this article, we address security challenges in multirobot systems (MRSs) where adversaries may compromise robots to gain unauthorized physical access to forbidden regions. We introduce a security mechanism based on <italic>reachability constraints</i> and <italic>co-observations</i> between robots. The mechanism guarantees that malicious trajectory deviations toward forbidden regions become physically detectable, as compromised robots must violate scheduled co-observations. We first incorporate these mechanisms directly as constraints in a multirobot optimal planning formulation, where we use ellipsoidal overapproximations of reachability regions for intersection checking and gradient computation. To address feasibility and optimality limitations of this naive formulation, we introduce the notion of <italic>subteams</i>, cohesive units that replace individual robots along each trajectory. This enables <italic>cross-trajectory co-observations</i>, where redundant robots switch between trajectories to secure multiple subteams without modifying the original plans. We formulate this cross-trajectory planning problem as a <italic>network-flow vertex path coverage problem</i> on the <italic>checkpoint graph</i> derived from unsecured MRS trajectories, while preserving the same security guarantees against plan-deviation attacks. Simulations demonstrate the effectiveness and robustness of the proposed algorithm in strengthening the security of MRSs under adversarial threats.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"13 3","pages":"1692-1703"},"PeriodicalIF":5.3,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148985569","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 Algorithm for Constrained Optimization Over Weight-Unbalanced Digraphs 权不平衡有向图约束优化的分布式算法
IF 5.3 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2026-09-01 Epub Date: 2026-06-04 DOI: 10.1109/TCNS.2026.3700335
Mengke Lian;Xiaoxuan Wang;Zhenyuan Guo;Shiping Wen;Tingwen Huang
{"title":"Distributed Algorithm for Constrained Optimization Over Weight-Unbalanced Digraphs","authors":"Mengke Lian;Xiaoxuan Wang;Zhenyuan Guo;Shiping Wen;Tingwen Huang","doi":"10.1109/TCNS.2026.3700335","DOIUrl":"https://doi.org/10.1109/TCNS.2026.3700335","url":null,"abstract":"This article addresses distributed optimization problems with compact convex set constraints and nonsmooth objectives over weight-unbalanced directed communication graphs, where the objective function is a sum of local convex functions endowed only by the corresponding agent. The weight unbalance destroys the doubly stochastic property required by standard consensus algorithms, while the nonsmooth objectives and coupled constraints further complicate distributed computation. To tackle these challenges, we propose a novel continuous-time projection algorithm that achieves finite-time weight balancing and finite-time convergence to the feasible set from any initial values, followed by asymptotic convergence to an optimal solution. Finally, two numerical examples are performed to substantiate the effectiveness, demonstrating its strong adaptability to both weight-balanced and weight-unbalanced graphs compared with existing methods.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"13 3","pages":"1728-1737"},"PeriodicalIF":5.3,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148985667","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
Wholesale Market Participation via Competitive DER Aggregation 通过竞争性DER聚合的批发市场参与
IF 5.3 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2026-09-01 Epub Date: 2026-06-08 DOI: 10.1109/TCNS.2026.3701538
Cong Chen;Ahmed S. Alahmed;Timothy D. Mount;Lang Tong
{"title":"Wholesale Market Participation via Competitive DER Aggregation","authors":"Cong Chen;Ahmed S. Alahmed;Timothy D. Mount;Lang Tong","doi":"10.1109/TCNS.2026.3701538","DOIUrl":"https://doi.org/10.1109/TCNS.2026.3701538","url":null,"abstract":"In this article, we consider the aggregation of distributed energy resources (DERs), such as solar PV, energy storage, and flexible loads, by a profit-seeking aggregator participating directly in the wholesale market under distribution network access constraints. We propose a competitive DER aggregator (DERA) model that directly controls local DERs to maximize its profits, while ensuring each aggregated customer gains a surplus higher than their surplus under the regulated retail tariff. The DERA participates in the wholesale electricity market as virtual storage with optimized generation offers and consumption bids derived from the proposed competitive aggregation model. Also derived are DERA’s bid curves for the distribution network access and DERA’s profitability when competing with the regulated retail tariff. We show that, with the same distribution network access, the proposed DERA’s wholesale market participation achieves the same welfare-maximizing outcome as when its customers participate directly in the wholesale market. Extensive numerical studies compare the proposed DERA with existing methods in terms of customer surplus and DERA profit. We empirically evaluate how many DERAs can survive in the competition at the long-run equilibrium and assess the impacts of DER adoption levels and distribution network access on short-run operations.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"13 3","pages":"1758-1770"},"PeriodicalIF":5.3,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148985683","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 Learning With Errors-Based Encryption Scheme for Dynamic Controllers That Discloses Residue Signal for Anomaly Detection 一种基于错误学习的动态控制器加密方案,用于异常检测中残留信号的公开
IF 5.3 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2026-09-01 Epub Date: 2026-03-29 DOI: 10.1109/TCNS.2026.3698371
Yeongjun Jang;Joowon Lee;Junsoo Kim;Takashi Tanaka;Hyungbo Shim
{"title":"A Learning With Errors-Based Encryption Scheme for Dynamic Controllers That Discloses Residue Signal for Anomaly Detection","authors":"Yeongjun Jang;Joowon Lee;Junsoo Kim;Takashi Tanaka;Hyungbo Shim","doi":"10.1109/TCNS.2026.3698371","DOIUrl":"https://doi.org/10.1109/TCNS.2026.3698371","url":null,"abstract":"Although encrypted control systems ensure the confidentiality of private data, it is challenging to detect anomalies without the secret key, as all signals remain encrypted. To address this issue, we propose a homomorphic encryption scheme for dynamic controllers that automatically discloses the residue signal for anomaly detection while keeping all other signals private. To this end, we characterize the zero-dynamics of an encrypted dynamic system defined over a finite field of integers and incorporate it into a learning with errors-based encryption scheme. We then present a method to further utilize the disclosed residue signal for implementing dynamic controllers over encrypted data, without requiring re-encryption even when they have noninteger state matrices.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"13 3","pages":"1715-1727"},"PeriodicalIF":5.3,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148985864","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 Nash Equilibrium Seeking Algorithms With Fixed-Time Convergence for Constrained Noncooperative Games on Digraphs 有向图上约束非合作对策的固定时间收敛的分布式纳什均衡寻求算法
IF 5.3 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2026-09-01 Epub Date: 2026-03-12 DOI: 10.1109/TCNS.2026.3691813
Binghao Ouyang;Xingxing Ju;Yong Wang;Gang Feng
{"title":"Distributed Nash Equilibrium Seeking Algorithms With Fixed-Time Convergence for Constrained Noncooperative Games on Digraphs","authors":"Binghao Ouyang;Xingxing Ju;Yong Wang;Gang Feng","doi":"10.1109/TCNS.2026.3691813","DOIUrl":"https://doi.org/10.1109/TCNS.2026.3691813","url":null,"abstract":"This article investigates the problem of distributed Nash equilibrium seeking with fixed-time convergence for constrained noncooperative games over <italic>directed</i> communication graphs. A distributed Nash equilibrium seeking algorithm is proposed based on a leader-following consensus protocol and the projection operator. It is proved that the proposed distributed algorithm converges to the Nash equilibrium in fixed time, which is independent of the initial conditions of the players. Moreover, the upper bound of the convergence time for the proposed Nash equilibrium seeking algorithm is explicitly given. The effectiveness of the proposed distributed algorithm is validated through an example of a constrained energy consumption game.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"13 3","pages":"1558-1569"},"PeriodicalIF":5.3,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148985867","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
Self-Triggering Resilient Control of Cyber-Physical Systems Against System Integrity Attacks 针对系统完整性攻击的网络物理系统自触发弹性控制
IF 5.3 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2026-09-01 Epub Date: 2026-03-21 DOI: 10.1109/TCNS.2026.3695953
Bo Tu;Zhihua Qu;Marwan A. Simaan
{"title":"Self-Triggering Resilient Control of Cyber-Physical Systems Against System Integrity Attacks","authors":"Bo Tu;Zhihua Qu;Marwan A. Simaan","doi":"10.1109/TCNS.2026.3695953","DOIUrl":"https://doi.org/10.1109/TCNS.2026.3695953","url":null,"abstract":"Cyber-physical systems (CPS) and their networked controls are vulnerable to system integrity attacks. These types of attacks can be severe and stealthy in nature, as the attacker may hijack both input and output channels of the system and synthesize attack signals to completely blind its control center. To prevent such attacks, resilient network control structures have been designed by incorporating a chaotic signal and dynamically encoding/decoding the control signal. Although this approach is very effective, the current version of the control structure requires continuous synchronization between the master and slave chaotic circuits. To relax this restriction and make the synchronization robust to intermittency and delay in communication, a new self-triggering resilient control structure is proposed in this article. This new structure contains three novel components. First, a digital twin of the slave chaotic circuit is introduced on the side of the master chaotic circuit to develop time-dependent and state-dependent synchronization criteria. Second, the self-triggering mechanism is designed to incorporate the two criteria into the resilient control structure so that the synchronization is renewed only when necessary. Third, the communication delay in the synchronization scheme is detected and compensated for in real time by using Einstein's formula. The robustness of this new control structure is analyzed using the Lyapunov direct method. In addition to analytical analysis, the proposed self-triggering resilient control system and the application of the digital twin of the slave chaotic circuit are shown to be effective by employing an example of a fourth-order control system and Chua's chaotic circuits.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"13 3","pages":"1665-1675"},"PeriodicalIF":5.3,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148985868","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
Identification for Weighted Matrices of Delayed Multilayer Stochastic Complex Network With Lévy Noise 具有lsamvy噪声的延迟多层随机复杂网络的加权矩阵辨识
IF 5.3 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2026-09-01 Epub Date: 2026-06-23 DOI: 10.1109/TCNS.2026.3706636
Chunmei Zhang;Jiamin Zhou;Yanlong Zhao
{"title":"Identification for Weighted Matrices of Delayed Multilayer Stochastic Complex Network With Lévy Noise","authors":"Chunmei Zhang;Jiamin Zhou;Yanlong Zhao","doi":"10.1109/TCNS.2026.3706636","DOIUrl":"https://doi.org/10.1109/TCNS.2026.3706636","url":null,"abstract":"In this article, the novel identification criteria for weighted matrices (WMs) of a delayed multilayer stochastic complex network with Lévy noise (DMSCNL) are investigated based on adaptive synchronization. Compared with previous works, this is the first study on the problem of identification for WMs of a stochastic complex network with Lévy noise. Specifically, considering DMSCNL with unknown WMs as the original system, an auxiliary system with an adaptive feedback controller and estimated weighted values is designed to track the original system by combining graph theory with the nonnegative semimartingale convergence theorem. Furthermore, the estimated weighted values in the auxiliary system can converge to the unknown weighted values in the original system under an excitation condition. That is, the corresponding identification criteria for WMs of the original system are derived. Moreover, theoretical results are validated through a two-layer recurrent neural network. Finally, numerical simulations well verify the validity of theoretical results.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"13 3","pages":"1835-1847"},"PeriodicalIF":5.3,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148985673","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学术文献互助群
群 号:604180095
Book学术官方微信
小红书