{"title":"Distributed Aggregative Optimization of MASs Subject to Coupled Inequality Constraints","authors":"Rong Nie;Wenli Du;Zhongmei Li;Shuping He","doi":"10.1109/TSMC.2025.3624247","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3624247","url":null,"abstract":"This article investigates the distributed aggregation optimization problem in multiagent systems (MASs), with a particular focus on addressing the aggregation effect commonly encountered in modern engineering and technological applications. In such scenarios, the local objective function of an agent depends not only on its own decision variables but also interacts with the decision variables of other agents, resulting in complex coupling relationships. To solve these challenges while ensuring that the optimization variables satisfy the coupled inequality constraints, this article introduces a novel framework called distributed aggregative parameter projection (DAPP). Specifically, the proposed distributed protocol is based on an improved parameter projection, including two direction updates, which minimizes the cost function and keeps the search direction obeying the inequality at each iteration. In addition, the linear convergence performance of the proposed scheme over the undirected and connected graph is ensured by rigorous theoretical proof with mild assumptions. Finally, simulation results demonstrate the superior performance of DAPP with smaller global function and faster convergence speed in comparison to the existing method.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2253-2261"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148504423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems Publication Information","authors":"","doi":"10.1109/TSMC.2026.3669272","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3669272","url":null,"abstract":"","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"C2-C2"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11442853","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148504710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fixed-Size Dynamic Scale-Free Networks: Modeling, Stationarity, and Resilience","authors":"Yichao Yao;Minyu Feng;Matjaž Perc;Jürgen Kurths","doi":"10.1109/TSMC.2025.3649867","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3649867","url":null,"abstract":"Many real-world scale-free networks, such as neural networks and online communication networks, consist of a fixed number of nodes but exhibit dynamic edge fluctuations. However, traditional models frequently overlook scenarios where the node count remains constant, instead prioritizing node growth. In this work, we depart from the assumptions of node number variation and preferential attachment to present an innovative model that conceptualizes node degree fluctuations as a state-dependent random walk process with stasis and variable diffusion coefficient. We show that this model yields stochastic dynamic networks with stable scale-free properties. Through comprehensive theoretical and numerical analyses, we demonstrate that the degree distribution converges to a power-law distribution, provided that the lowest degree state within the network is not an absorbing state. Furthermore, we investigate the resilience of the fraction of the largest component and the average shortest path length following deliberate attacks on the network. By using three real-world networks, we confirm that the proposed model accurately replicates actual data. The proposed model thus elucidates mechanisms by which networks, devoid of growth and preferential attachment features, can still exhibit power-law distributions and be used to simulate and study the resilience of attacked fixed-size scale-free networks.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2570-2582"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148504738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Compound Fault Diagnosis Method by Combining Feature Conditional Diffusion and Capsule Networks Under Scarce Samples","authors":"Xin-Zhe Su;Huimin Wang;Guang-Hong Yang","doi":"10.1109/TSMC.2026.3652132","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3652132","url":null,"abstract":"In machinery fault diagnosis, traditional fault diagnosis methods often face the challenge of scarce compound fault samples. To overcome this challenge, a novel compound fault diagnosis method combining feature conditional diffusion and capsule networks (FCD-CNs) is proposed. First, to tackle the imbalance problem caused by scarce compound fault samples, a conditional diffusion model is constructed to generate high-similarity compound fault pseudo-features. Then, a capsule network is designed to decouple and classify faults from the perspective of their coupling relationship between different faults. Furthermore, a three-phase training strategy is proposed to reduce the distributional differences between generated and real features. Finally, the proposed method is substantiated through comprehensive case studies in the Hangzhou Dianzi University (HDU) dataset. The results demonstrate its effectiveness and merits in the extreme scarcity of compound fault samples.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2636-2646"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148505700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Prescribed-Time Containment Control for Multiple Mobile Robot Systems","authors":"Jiaming Zhang;Yang Liu;Ben Niu;Wenling Li;Bin Zhang","doi":"10.1109/TSMC.2025.3650119","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3650119","url":null,"abstract":"This article investigates the prescribed-time containment control problem for multiple wheeled mobile robots (MWMRs) with unknown control gains. A novel and generalized prescribed-time stability theorem is established, significantly advancing existing frameworks and facilitating controller design. For each follower, a distributed containment observer is developed to ensure that the observer state converges precisely to the convex hull formed by multiple leaders within a prescribed time. This approach effectively transforms the containment control problem into a more tractable tracking control problem, meanwhile enabling local reconstruction of unmeasured neighbor states using available observer outputs. Then, the type-B Nussbaum function is employed to eliminate the effects of the time-varying unknown control coefficient. Based on the developed prescribed-time theorem and the time-varying parametric Lyapunov equation (PLE), the fully actuated controllers are designed for the MWMRs. It can guarantee that the containment errors converge to zero within the prescribed time. Finally, simulation results validate the effectiveness of the proposed method.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2388-2398"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148506200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Vibration Representation and Speed-Joint Network for Machinery Fault Diagnosis Under Time-Varying Conditions With Sparse Fault Data","authors":"Wenyi Liu;Chaoang Xiao;Jianbo Yu","doi":"10.1109/TSMC.2026.3651692","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3651692","url":null,"abstract":"Machinery fault diagnosis with limited fault data under time-varying conditions remains a persistent challenge. In practical industrial settings, healthy samples are generally abundant during daily monitoring, while fault data is sparse. This hinders further development of dynamic fault recognition technology. In this article, a novel self-supervised vibration representation and speed-joint network, i.e., VRSNet, is proposed to conduct few-shot fault diagnosis under time-varying speed conditions. First, contrastive learning (CL) is employed to achieve feature self-representation using only healthy vibration signals. This enhances the discriminability of extractor and facilitates the self-extraction of feature manifolds across varying speeds. Second, a dimension-lifting network named approximator (APP) is proposed to identify the potential relationship between rotational speeds and corresponding vibration representations, which facilitates condition alignment for each transient speed and cross-modal feature fusion. Finally, a vibration-speed-joint fine-tuning method is proposed to implement few-shot training for fault recognition, where the norm-freezing strategy effectively preserves the pretraining knowledge of both vibration and speed branches for generalization enhancement. VRSNet is verified through two cases under time-varying speed conditions. The results demonstrate that it outperforms those state-of-the-art (SOTA) methods and achieves a recognition accuracy of 84.75% in a 1-shot fault data scenario with varying speeds. Even when confronted with faults at previously unseen speeds, VRSNet can still recognize them accurately.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2608-2621"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148506544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Haotian Xu;Zheng Yan;Junyu Xuan;Guangquan Zhang;Jie Lu
{"title":"Diversity-Driven Model Ensemble Adaptive Trust Region Policy Optimization","authors":"Haotian Xu;Zheng Yan;Junyu Xuan;Guangquan Zhang;Jie Lu","doi":"10.1109/TSMC.2026.3650850","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3650850","url":null,"abstract":"Model-based reinforcement learning (MBRL) aims to promote sample efficiency and reduce the number of interactions with the true environment, via learning an environment dynamic model, compared with model-free reinforcement learning (MFRL). However, the success of MBRL heavily relies on two key aspects: model learning and planning. The former refers to learning an accurate model, and the latter aims to improve the behavior policy. In this article, we investigate these two aspects further with model ensemble learning. We design a deep residual attention U-Net (RauNet) with fewer neurons (or weights) than the widely used shallow neural network as our base models and further apply the Hilbert–Schmidt independence criterion (HSIC) as a regularization term to pursue model diversity explicitly for the model ensemble. Furthermore, we propose an adaptive trust region policy optimization (TRPO), in which the parametric Rényi alpha divergence substitutes for the Kullback–Leibler (KL) divergence for measuring the difference between two successive policies, and the alpha value can be adaptively adjusted during TRPO training iterations. This method is called diversity-driven model ensemble adaptive TRPO, or simply diversity-driven model ensemble adaptive trust region policy optimization. Our detailed experiments on six benchmark environments show that our proposed approach is optimal, compared with five state-of-the-art RL techniques.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2622-2635"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148506554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Distributionally Robust Optimization-Based Stochastic Self-Triggered Model Predictive Control","authors":"Bin Li;Wenhao Zhang;Mingming Shi","doi":"10.1109/TSMC.2025.3649661","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3649661","url":null,"abstract":"In this article, we propose a self-triggered distributionally robust model predictive control algorithm for linear discrete systems with state chance constraints and unbounded stochastic disturbances. Assuming that only the first and second moments of the disturbance are accessible, we transform the objective function into a compact quadratic form and reformulate the state chance constraints into linear inequalities, which is more tractable when solving. In order to reduce communication and sampling times of the system, we propose a self-triggered update scheme, in which the state sampling and the control input sequence are updated when the control performance predicted based on the current sampling exceeds that of the periodic sampling scheme. We demonstrate that the optimization problem in the proposed self-triggered model predictive control (MPC) method is recursively feasible and stable. Numerical simulation results verify the effectiveness of the proposed algorithm.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2699-2707"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148507303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Bo Zhang;Changchun Hua;Jiafeng Zhou;Jian Zhang;Yu Zhang
{"title":"Separation Approach to Adaptive Control for Robot Manipulators Without Joint-Space and Task-Space Velocity Measurements","authors":"Bo Zhang;Changchun Hua;Jiafeng Zhou;Jian Zhang;Yu Zhang","doi":"10.1109/TSMC.2025.3649270","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3649270","url":null,"abstract":"This article investigates the task-space adaptive control problem of robot manipulators under both uncertain dynamics and kinematics. The proposed algorithm employs dual observers for the dynamic and kinematic loops to estimate joint-space and task-space velocity signals, thereby eliminating numerical differentiation, mitigating sensor-noise effects, and avoiding reliance on high-precision velocity sensors, which collectively improve control accuracy. Moreover, the controller achieves the desired separation between the dynamic and kinematic loops even in the presence of time-varying control coefficients. This separation simplifies controller synthesis and stability analysis and reduces conservatism in controller-gain selection caused by loop coupling. Finally, the asymptotic convergence of the task-space tracking error is established via the Lyapunov stability theory. The effectiveness of the proposed scheme is demonstrated through comparative simulations and experiments.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2308-2316"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148507298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multidomain Evolutionary Optimization on Adversarial Link Perturbation in Imbalanced-Size Complex Systems","authors":"Jie Zhao;Kang Hao Cheong","doi":"10.1109/TSMC.2026.3652853","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3652853","url":null,"abstract":"Real-world complex systems usually share structural characteristics such as the small-world property, power-law distributions, and community structure. Multidomain evolutionary optimization (MDEO) leverages these commonalities to search for optimal solutions in multiple domains simultaneously. However, it still faces challenges in achieving effective cooperation when the networks involved are of highly imbalanced sizes. To address this issue, we propose the harmonized MDEO (HMDEO), in which two graph coarsening strategies are developed to jointly coarsen the large network to a fine level, acting as the bridge between the large network and the small network for knowledge exchange. Following that, we propose a bidirectional optimization framework incorporating two cases: large-to-small and small-to-large, allowing solutions optimized in one domain to be seamlessly transferred to another domain of varied scales. To enhance applicability, we also tailor the measurement of network similarity and the network alignment strategy targeted to imbalanced-size scenarios. The effectiveness of HMDEO is demonstrated through experiments on several pairs of networks of differing scales, where HMDEO outperforms other optimization approaches in addressing adversarial edge perturbation against community detection in complex systems.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2708-2719"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148507311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}