IEEE Transactions on Signal and Information Processing over Networks最新文献

筛选
英文 中文
Preset-Time Robust Multi-Objective Optimization Over Directed Networks Based On Multi-Agent Framework 基于多代理框架的有向网络预设时间稳健多目标优化
IF 3 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-09-18 DOI: 10.1109/TSIPN.2024.3463408
Siyu Chen;Fengyang Zhao;Haijun Jiang;Zhiyong Yu
{"title":"Preset-Time Robust Multi-Objective Optimization Over Directed Networks Based On Multi-Agent Framework","authors":"Siyu Chen;Fengyang Zhao;Haijun Jiang;Zhiyong Yu","doi":"10.1109/TSIPN.2024.3463408","DOIUrl":"10.1109/TSIPN.2024.3463408","url":null,"abstract":"The present study addresses the preset-time multi-objective optimization problem subject to external disturbances on directed topologies. Firstly, a novel preset-time robust algorithm is designed by employing two types of time-regulator functions, the linear weighted sum method, global information of cost functions, and integral sliding mode control with robustness. This algorithm is tailored for solving multi-objective optimization problems on strongly connected networks. Additionally, two distributed preset-time estimators are proposed and incorporated into the design of the optimization algorithm, effectively eliminating the dependence on global information. Distinct from existing optimization outcomes, the algorithms developed in this study exhibit superior performance in terms of network structure (digraph), convergence time (preset-time), and robustness. Finally, the correctness and effectiveness of the designed optimization algorithms are corroborated by a bilateral negotiation model.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"706-714"},"PeriodicalIF":3.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142266491","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
Fault-Tolerant Control for Output Regulation in Multi-Agent Systems Based on Prescribed-Time Observers 基于规定时间观测器的多代理系统输出调节容错控制
IF 3 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-09-13 DOI: 10.1109/TSIPN.2024.3458789
Yang Liu;Guochen Pang;Jianlong Qiu;Xiangyong Chen;Jinde Cao
{"title":"Fault-Tolerant Control for Output Regulation in Multi-Agent Systems Based on Prescribed-Time Observers","authors":"Yang Liu;Guochen Pang;Jianlong Qiu;Xiangyong Chen;Jinde Cao","doi":"10.1109/TSIPN.2024.3458789","DOIUrl":"10.1109/TSIPN.2024.3458789","url":null,"abstract":"This paper investigates the problem of fault-tolerant control for output regulation in multi-agent systems with actuator multiplicative faults. Initially, a prescribed-time observer is established for the followers to estimate the states of the leader. By incorporating a time-varying scaling function, the convergence time is predetermined, ensuring that the observer error converges to zero independently of the system parameters and initial conditions. Subsequently, a distributed adaptive fault-tolerant controller is designed based on the states of the observer and the relative information among the neighboring agents. It is verified that the designed controller can effectively compensate for actuator faults and address the cooperative output regulation fault-tolerant control problem. Finally, the effectiveness of the adaptive fault-tolerant controller is demonstrated through a simulation example.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"729-739"},"PeriodicalIF":3.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142266492","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
Tensor Completion Using High-Order Spatial Delay Embedding for IoT Multi-Attribute Data Reconstruction 利用高阶空间延迟嵌入进行张量补全,实现物联网多属性数据重构
IF 3 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-09-11 DOI: 10.1109/TSIPN.2024.3458791
Xiaoyue Zhang;Jingfei He;Xiaotong Liu
{"title":"Tensor Completion Using High-Order Spatial Delay Embedding for IoT Multi-Attribute Data Reconstruction","authors":"Xiaoyue Zhang;Jingfei He;Xiaotong Liu","doi":"10.1109/TSIPN.2024.3458791","DOIUrl":"10.1109/TSIPN.2024.3458791","url":null,"abstract":"Restricted by various factors, the data collected by sensor nodes in some Internet of Things (IoT) can only provide spatio-temporal low-resolution multi-attribute information of the monitored area. Estimating environmental data in sensorless deployment locations to achieve spatio-temporal high-resolution multi-attribute data sensing has become an urgent problem. Existing IoT data reconstruction methods either suffer from performance degradation due to continuous data loss or ignore the correlation among multi-attribute data. To overcome these two shortcomings, a multi-attribute data reconstruction method utilizing a high-order spatial delay-embedding transform is proposed in this work. Strict low-rank property can be achieved in the proposed method without additional constraints, avoiding overcomplicating the model by combining too many constraints. The tensor ring decomposition is used to approximate the rank of the formulated data and to efficiently solve the tensor completion model via the alternating least squares algorithm. Experimental results on IoT data demonstrate that the proposed method outperforms the state-of-the-art low-rank-based methods on multi-attribute data reconstruction.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"715-728"},"PeriodicalIF":3.0,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142223946","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
R-FAST: Robust Fully-Asynchronous Stochastic Gradient Tracking Over General Topology R-FAST:通用拓扑上的鲁棒全同步随机梯度跟踪
IF 3 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-08-30 DOI: 10.1109/TSIPN.2024.3444484
Zehan Zhu;Ye Tian;Yan Huang;Jinming Xu;Shibo He
{"title":"R-FAST: Robust Fully-Asynchronous Stochastic Gradient Tracking Over General Topology","authors":"Zehan Zhu;Ye Tian;Yan Huang;Jinming Xu;Shibo He","doi":"10.1109/TSIPN.2024.3444484","DOIUrl":"https://doi.org/10.1109/TSIPN.2024.3444484","url":null,"abstract":"We propose a Robust Fully-Asynchronous Stochastic Gradient Tracking method (R-FAST) for distributed machine learning problems over a network of nodes, where each node performs local computation and communication at its own pace without any form of synchronization. Different from existing asynchronous distributed algorithms, R-FAST can eliminate the impact of data heterogeneity across nodes on convergence performance and allow for packet losses by employing a robust gradient tracking strategy that relies on properly designed auxiliary variables for tracking and buffering the overall gradient vector. Moreover, the proposed method utilizes two spanning-tree graphs for communication so long as both share at least one common root, enabling flexible designs in communication topologies. We show that R-FAST converges in expectation to a neighborhood of the optimum with a geometric rate for smooth and strongly convex objectives; and to a stationary point with a sublinear rate for general non-convex problems. Extensive experiments demonstrate that R-FAST runs 1.5-2 times faster than synchronous benchmark algorithms, such as Ring-AllReduce and D-PSGD, while still achieving comparable accuracy, and outperforms the existing well-known asynchronous algorithms, such as AD-PSGD and OSGP, especially in the presence of stragglers.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"665-678"},"PeriodicalIF":3.0,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142173995","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 for Nonlinear Players With Input Delay 有输入延迟的非线性参与者的分布式纳什均衡寻求
IF 3 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-08-29 DOI: 10.1109/TSIPN.2024.3451979
Zhaoming Sheng;Qian Ma
{"title":"Distributed Nash Equilibrium Seeking for Nonlinear Players With Input Delay","authors":"Zhaoming Sheng;Qian Ma","doi":"10.1109/TSIPN.2024.3451979","DOIUrl":"https://doi.org/10.1109/TSIPN.2024.3451979","url":null,"abstract":"This paper studies the distributed Nash equilibrium seeking problem for players subject to unknown nonlinear dynamics and input delay. By designing a distributed estimator for each player to estimate other players' decisions and embedding an auxiliary variable to compensate for the influence of unknown nonlinearities, the distributed Nash equilibrium seeking algorithms are obtained for first-, second-, and high-order nonlinear players, respectively. With the help of the Lyapunov stability theory and Lyapunov-Krasovskii functional approach, the maximum allowable input delay is determined and the global asymptotic convergence of players' decisions to the Nash equilibrium is proved. Finally, simulation examples are provided to demonstrate the effectiveness of the proposed methods.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"679-689"},"PeriodicalIF":3.0,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142174011","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
Stable Outlier-Robust Signal Recovery Over Networks: A Convex Analytic Approach Using Minimax Concave Loss 网络上稳定的离群稳健信号恢复:使用最小凹损失的凸分析方法
IF 3 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-08-29 DOI: 10.1109/TSIPN.2024.3451992
Maximilian H. V. Tillmann;Masahiro Yukawa
{"title":"Stable Outlier-Robust Signal Recovery Over Networks: A Convex Analytic Approach Using Minimax Concave Loss","authors":"Maximilian H. V. Tillmann;Masahiro Yukawa","doi":"10.1109/TSIPN.2024.3451992","DOIUrl":"10.1109/TSIPN.2024.3451992","url":null,"abstract":"This paper presents a mathematically rigorous framework of remarkably-robust signal recovery over networks. The proposed framework is based on the \u0000<italic>minimax concave (MC)</i>\u0000 loss, which is a weakly convex function so that it attains i) remarkable outlier-robustness and ii) guarantee of convergence to a solution of the posed problem. We present a novel problem formulation which involves an auxiliary vector so that the formulation accommodates statistical properties of signal, noise, and outliers. We show the conditions to guarantee convexity of the local and global objectives. Via reformulation, the distributed triangularly preconditioned primal-dual algorithm is applied to the posed problem. The numerical examples show that our proposed formulation exhibits remarkable robustness under devastating outliers as well as outperforming the existing methods. Comparisons between the local and global convexity conditions are also presented.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"690-705"},"PeriodicalIF":3.0,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142182551","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
Barycentric Coordinate-Based Distributed Localization Over 3-D Underwater Wireless Sensor Networks 基于重心坐标的三维水下无线传感器网络分布式定位
IF 3 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-08-08 DOI: 10.1109/TSIPN.2024.3440644
Lei Shi;Shaojie Yao;Nianwen Ning;Yi Zhou
{"title":"Barycentric Coordinate-Based Distributed Localization Over 3-D Underwater Wireless Sensor Networks","authors":"Lei Shi;Shaojie Yao;Nianwen Ning;Yi Zhou","doi":"10.1109/TSIPN.2024.3440644","DOIUrl":"10.1109/TSIPN.2024.3440644","url":null,"abstract":"Accurate localization of underwater wireless sensor networks (UWSNs) are essential for their seamless integration and operational efficacy in marine environments, yet it poses a considerable technical challenge due to the distinctive limitations of underwater communications. This paper addresses the intricate 3-D localization problem for UWSNs by proposing an innovative method based on barycentric coordinates and relative distance measurements. In order to adapt to the influence of underwater communication constraints, a barycentric coordinate-based distributed iterative localization method combining with the processing of underwater background noise is proposed. It is proved theoretically that the proposed method can almost guarantee the convergence to the exact location of each underwater sensor node. Finally, the effectiveness of the proposed localization method is verified by numerical simulations. The proposed localization scheme requires only small number of anchor nodes, thus facilitating the development of broader and more cost-effective underwater localization systems.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"640-649"},"PeriodicalIF":3.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945156","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
Causal Learning and Knowledge Fusion Mechanism for Brain Functional Network Classification 大脑功能网络分类的因果学习和知识融合机制
IF 3 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-07-18 DOI: 10.1109/TSIPN.2024.3430474
Junzhong Ji;Feipeng Wang;Lu Han;Jinduo Liu
{"title":"Causal Learning and Knowledge Fusion Mechanism for Brain Functional Network Classification","authors":"Junzhong Ji;Feipeng Wang;Lu Han;Jinduo Liu","doi":"10.1109/TSIPN.2024.3430474","DOIUrl":"10.1109/TSIPN.2024.3430474","url":null,"abstract":"Current studies have shown that the classification of human brain functional networks (BFN) is a reliable way to diagnose and predict brain diseases. However, a great challenge for current traditional machine learning methods and deep learning methods is their poor performance or lack of interpretability. To alleviate this problem, we propose a novel causal learning and knowledge fusion mechanism for brain functional network classification, named CLKF. The proposed mechanism first extracts causal relationships among brain regions from functional magnetic resonance imaging (fMRI) data using partial correlation and conditional mutual information, and obtains the relationships between BFN and labels by Gaussian kernel density estimation. Then, it fuses these two types of relationships as knowledge to aid in the classification of brain functional networks. The experimental results on the simulated resting-state fMRI dataset show that the proposed mechanism can effectively learn the causal relationships among brain regions. The results on the real resting-state fMRI dataset demonstrate that our mechanism can not only improve the classification performance of both traditional machine learning and deep learning methods but also provide an interpretation of the results obtained by deep learning methods. These findings suggest that the proposed mechanism has good potential in practical medical applications.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"650-664"},"PeriodicalIF":3.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141745272","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 Constrained Optimization Algorithm for Higher-Order Multi-Agent Systems 高阶多代理系统的分布式约束优化算法
IF 3 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-07-18 DOI: 10.1109/TSIPN.2024.3430492
Xiasheng Shi;Lingfei Su;Qing Wang
{"title":"Distributed Constrained Optimization Algorithm for Higher-Order Multi-Agent Systems","authors":"Xiasheng Shi;Lingfei Su;Qing Wang","doi":"10.1109/TSIPN.2024.3430492","DOIUrl":"10.1109/TSIPN.2024.3430492","url":null,"abstract":"The distributed nonsmooth constrained optimization problems over higher-order systems are investigated in this study. The challenges lies in the fact that the output of the agent is directly controlled by the state variable rather than the control input. Compared to existing works, the local objective function is merely assumed to be nonsmooth. Firstly, an initialization-free fully distributed derivative feedback control scheme is developed for the known objective function over double-integrator systems. The local generic constraint is addressed by an adaptive nonnegative penalty factor. Secondly, an initialization-free fully distributed state feedback control scheme is proposed for the unknown objective function over double-integrator systems. Addressing the local box constraint involves incorporating an adaptive penalty factor. Thirdly, the above two algorithms are extended to the general higher-order systems using the tracking control method. In addition, the above-developed methods are proved to be asymptotically convergent under certain conditions. Eventually, the efficiency of the above-produced methods is shown via four simulation cases.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"626-639"},"PeriodicalIF":3.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141745314","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 Convex Optimization “Over-the-Air” in Dynamic Environments 动态环境中的分布式 "空中 "凸优化
IF 3 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-07-05 DOI: 10.1109/TSIPN.2024.3423668
Navneet Agrawal;Renato Luís Garrido Cavalcante;Masahiro Yukawa;Sławomir Stańczak
{"title":"Distributed Convex Optimization “Over-the-Air” in Dynamic Environments","authors":"Navneet Agrawal;Renato Luís Garrido Cavalcante;Masahiro Yukawa;Sławomir Stańczak","doi":"10.1109/TSIPN.2024.3423668","DOIUrl":"10.1109/TSIPN.2024.3423668","url":null,"abstract":"This paper presents a decentralized algorithm for solving distributed convex optimization problems in dynamic networks with time-varying objectives. The unique feature of the algorithm lies in its ability to accommodate a wide range of communication systems, including previously unsupported ones, by abstractly modeling the information exchange in the network. Specifically, it supports a novel communication protocol based on the “over-the-air” function computation (OTA-C) technology, that is designed for an efficient and truly decentralized implementation of the consensus step of the algorithm. Unlike existing OTA-C protocols, the proposed protocol does not require the knowledge of network graph structure or channel state information, making it particularly suitable for decentralized implementation over ultra-dense wireless networks with time-varying topologies and fading channels. Furthermore, the proposed algorithm synergizes with the “superiorization” methodology, allowing the development of new distributed algorithms with enhanced performance for the intended applications. The theoretical analysis establishes sufficient conditions for almost sure convergence of the algorithm to a common time-invariant solution for all agents, assuming such a solution exists. Our algorithm is applied to a real-world distributed random field estimation problem, showcasing its efficacy in terms of convergence speed, scalability, and spectral efficiency. Furthermore, we present a superiorized version of our algorithm that achieves faster convergence with significantly reduced energy consumption compared to the unsuperiorized algorithm.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"610-625"},"PeriodicalIF":3.0,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141577659","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学术官方微信