IEEE Transactions on Control of Network Systems最新文献

IEEE Control Systems Society Information IEEE控制系统学会信息

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-06-20 DOI: 10.1109/TCNS.2025.3573219

引用次数: 0

IEEE Control Systems Society Information IEEE控制系统学会信息

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-06-20 DOI: 10.1109/TCNS.2025.3573218

引用次数: 0

IEEE Control Systems Society Information IEEE控制系统学会信息

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-03-20 DOI: 10.1109/TCNS.2025.3548567

引用次数: 0

IEEE Control Systems Society Information 电气和电子工程师学会控制系统协会信息

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-03-20 DOI: 10.1109/TCNS.2025.3548568

引用次数: 0

Leader-Following Consensus of Multiple Rigid Body Systems by Bounded Attitude Feedback 基于有界姿态反馈的多刚体系统的领导-跟随共识

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-03-07 DOI: 10.1109/TCNS.2025.3549094

Changran He;Kwok Wai Samuel Au

引用次数: 0

Intracluster Synchronization of Linear Networks Over Finite Fields 有限域上线性网络的簇内同步

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-03-05 DOI: 10.1109/TCNS.2025.3548158

Siyu Zou;Ting Li;Jiandong Zhu

引用次数: 0

2024 Index IEEE Transactions on Control of Network Systems Vol. 11 IEEE网络系统控制学报第11卷

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-02-07 DOI: 10.1109/TCNS.2025.3539542

引用次数: 0

Cooperative Fault Tolerant Control With State Constraints for Nonlinear Multiple-Agent Systems 非线性多智能体系统的状态约束协同容错控制

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-02-07 DOI: 10.1109/TCNS.2025.3539577

Zhixin Zhang;Zhiyong Chen;Wentuo Fang

引用次数: 0

Achieving Near-Optimal Oracle Complexity in Decentralized Stochastic Optimization With Channel Noise 具有信道噪声的分散随机优化中接近最优Oracle复杂度的实现

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-02-07 DOI: 10.1109/TCNS.2025.3539495

Soham Mukherjee;Mrityunjoy Chakraborty

{"title":"Achieving Near-Optimal Oracle Complexity in Decentralized Stochastic Optimization With Channel Noise","authors":"Soham Mukherjee;Mrityunjoy Chakraborty","doi":"10.1109/TCNS.2025.3539495","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3539495","url":null,"abstract":"We study a decentralized nonconvex stochastic optimization problem in which a group of agents/nodes seek to minimize a global objective function that can be expressed as a sum of local component functions, such that each node in the network has access to exactly one component function. The nodes collaborate with their neighbors by sharing their estimates over communication links that are assumed to be corrupted by additive noise. To address this problem, we propose a computationally efficient and robust algorithm that builds on a probabilistic technique for stochastic gradient computation, which we believe will be applicable to a wide range of problems in decentralized information processing, learning, and control. Specifically, we show that the proposed method achieves an oracle complexity (computational complexity) of <inline-formula><tex-math>$O(1/epsilon ^{2})$</tex-math></inline-formula> for smooth and nonconvex functions with stochastic gradients, which is known to be sharp for its respective function class, and is an improvement over the computational cost obtained in previous works. In addition, we retain the <inline-formula><tex-math>$O(1/epsilon ^{3})$</tex-math></inline-formula> rate for the communication cost, which is at par with the communication cost obtained in previous works. We also show how the proposed algorithm has robust performance in environments with unreliable computational resources. Finally, the theoretical findings are validated via numerical experiments.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1215-1226"},"PeriodicalIF":4.0,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331487","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

An Enhanced Distributed Optimization Subject to Multiple Constraints: A Case Study on Entire Ethylene Separation Process 多约束下的增强型分布式优化——以乙烯分离全过程为例

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-02-06 DOI: 10.1109/TCNS.2025.3539580

Bing Liu;Wenli Du;Zhongmei Li

{"title":"An Enhanced Distributed Optimization Subject to Multiple Constraints: A Case Study on Entire Ethylene Separation Process","authors":"Bing Liu;Wenli Du;Zhongmei Li","doi":"10.1109/TCNS.2025.3539580","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3539580","url":null,"abstract":"This article studies an enhanced distributed optimization algorithm in an undirected topology based on local communication and computation to optimize the sum of local objective functions under multiple constraints. In particular, the adapt-then-combine distributed inexact gradient tracking algorithm (ATC-DIGing-MC) is developed for smooth and strongly convex local functions with multiple constraints. By implementing the adapt-then-combine scheme and using the gradient tracking technique, rapidity and flexibility can be obtained by the ATC-DIGing-MC with uncoordinated step-sizes. Subsequently, the parameter projection strategy is implemented to deal with realistic production limitations in the presence of multiple constraints. Meanwhile, rigorous theoretical proofs and convergence theorem are provided to verify the geometrical convergence rate of the ATC-DIGing-MC. Furthermore, the numerical experiments based on the entire ethylene separation process validate the superior performance of the ATC-DIGing-MC algorithm in terms of time and energy savings compared to established algorithms.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1227-1237"},"PeriodicalIF":4.0,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331637","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