{"title":"Gated-Dual-Attention-Based Full-Resolution Floor Plan Segmentation Network for Topological Semantic Mapping","authors":"Yiyang Sun;MengChu Zhou;Zhengcai Cao","doi":"10.1109/TSMC.2025.3648921","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3648921","url":null,"abstract":"Topological semantic maps serve as an effective tool for the partially sighted or visually impaired (PSVI) in indoor navigation. Essential to their construction is the precise segmentation of floor plans. However, current techniques fall short in segmentation performance. To overcome this, we introduce a gated-dual-attention-based full-resolution network (GFNet) for floor plan segmentation. We leverage the inherent low-stage detailed features and intraclass-and-interclass contextual dependencies within floor plans to maximize segmentation effectiveness. Our proposed network incorporates modified residual blocks in early stages to maintain full-resolution capture with a low parameter count. We design and apply a novel gated dual attention (GDA) module that efficiently integrates channel and spatial contextual information to enhance local feature representation. This module improves the overall performance of our network while ensuring minimal parameter fluctuation. We also propose a 2-D deep supervision (TDDS) method to merge features from all stages, further enhancing the multilevel feature representation ability. Finally, a practical topological semantic mapping method for PSVI indoor navigation is introduced. All models are evaluated on the rasterized floor plan datasets R2V and R3D. Experimental results show that the proposed network achieves 2.21% and 2.74% mIoU improvements over the previous state-of-the-art method on R2V and R3D, respectively, for the challenging categories of walls and doors. This contributes to more accurate topological semantic mapping.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2374-2387"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148508121","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":"Predefined-Time Sensor Fault-Tolerant Control for Motor Systems","authors":"Honggui Han;Weiyu Ji;Zheng Liu;Haoyuan Sun","doi":"10.1109/TSMC.2026.3655474","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3655474","url":null,"abstract":"Predefined-time control (PTC) is employed to ensure that the system exhibits more definite and predictable behavior in the motor systems. However, as the system ages, sensors may be adversely affected by malfunctions, resulting in performance degradation, even leading to system instability. Thus, to solve this issue, a predefined-time sensor fault-tolerant control (PTSFTC) is developed for motor systems. First, a predefined-time fault compensation scheme is presented to extract the system operational state information. Then, this fault compensation method can judge the sensor fault within a predefined execution time. Second, a Nussbaum technique-based adaptive compensation strategy is introduced in PTSFTC to compensate for the unknown control coefficient. Then, the proposed PTSFTC can achieve safe and stable operation for motor systems with the unknown control gain. Third, the Lyapunov function is constructed to demonstrate the stability of PTSFTC scheme. Then, the comprehensive stability analysis can guarantee the successful application of PTSFTC. Finally, simulation and experiment results demonstrate that the PTSFTC can ensure the motor system exhibits excellent control performance.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2855-2867"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148505712","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}
Mengpu Cai;Rongrong Fu;Changchun Hua;Guilin Wen;Yaodong Wang
{"title":"Contrastive Twin Latent Informer Based on Autoencoder for EEG Emotion Recognition","authors":"Mengpu Cai;Rongrong Fu;Changchun Hua;Guilin Wen;Yaodong Wang","doi":"10.1109/TSMC.2026.3651503","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3651503","url":null,"abstract":"Electroencephalography (EEG) is widely used in emotion recognition due to its reliability and noninvasiveness. However, challenges as signal noise and individual variability in EEG data present significant limitations for real-world applications. Inspired by recent neuroscience advances, we propose a contrastive twin latent informer (CTLIN) model for EEG-based emotion recognition and signal generation. The architecture employs a symmetric autoencoder (AE) that synergistically integrates PropSparse self-attention mechanisms with EEG feature extraction, incorporating a novel twin latent permutation (LP) design. By disentangling EEG features into subject and emotion latent representations through contrastive learning, the model demonstrates enhanced capability in capturing generalizable biomarkers. Experimental results show CTLIN’s state-of-the-art performance in zero-shot classification tasks. It significantly surpasses existing models in both subject identification and emotion classification across three benchmark datasets [SEED, SEED-IV, and a self-collected (SC) dataset], achieving subject classification accuracies of 98.63%, 99.13%, and 98.70%, respectively, with corresponding emotion classification accuracies of 77.92%, 53.79%, and 64.41%. Furthermore, a novel paradigm for EEG signal generation and data augmentation is established through the proposed LP approach, providing practical solutions to enhance emotion recognition.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2660-2672"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148506045","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":"Effective Fault Identification Approach for Model-Based Diagnosis","authors":"Jihong Ouyang;Sen Huang;Jinjin Chi;Liming Zhang;Xiangfu Zhao","doi":"10.1109/TSMC.2025.3649682","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3649682","url":null,"abstract":"In the domain of model-based diagnosis (MBD), the identification of the most probable faulty components entails the initial computation of candidate diagnoses across all system elements, followed by the application of Bayesian inference to derive their posterior failure probabilities. However, this conventional approach necessitates the extraction of minimal conflict sets (MCSs) for all components—a prerequisite for generating candidate diagnoses—and subsequently solving for minimal hitting sets (MHSs) of the MCSs. Both tasks are inherently NP-hard, imposing prohibitive computational complexity as system scale increases. Even most advanced diagnostic algorithms encounter significant challenges in enumerating all diagnoses, or even a cardinality-minimal solution, within tractable time constraints for large-scale systems. To address these limitations, this work introduces a novel incremental methodology for efficiently approximating posterior component failure probabilities. A foundational framework is first proposed, leveraging structural relationships inherent to hitting sets to probabilistically characterize component fault likelihoods. Building upon this foundation, two minimization theorems are formally established, accompanied by closed-form parameterizations to optimize computational efficiency. Crucially, the proposed method bypasses the explicit enumeration of diagnoses by directly inferring the most probable faulty components from conflict set analyses. Empirical evaluations demonstrate that the approach not only sustains diagnostic accuracy exceeding 95% but also achieves a substantial computational acceleration—surpassing contemporary state-of-the-art algorithms by multiple orders of magnitude.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2361-2373"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148506565","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 Cooperative Game-Theoretic Approach for Hardware–Software Partitioning in Multichiplet Integrated Systems","authors":"Shao Deng;Shanzhu Xiao;Huamin Tao;Jianxiong Zhou","doi":"10.1109/TSMC.2026.3651831","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3651831","url":null,"abstract":"Hardware (HW)–software (SW) partitioning is a critical challenge in HW–SW codesign. Traditional approaches often fail to address the complex dependencies between task nodes and the constraints of multichiplet integrated systems, posing challenges in meeting the partitioning demands of large-scale heterogeneous computing platforms. This article proposes a novel HW–SW partitioning model based on a cooperative game-theoretic framework. Task nodes are modeled as rational agents participating in a cooperative game, where each module can adopt an HW, SW, or hybrid implementation. The proposed coalition competition and cooperation algorithm (CCCA) integrates cooperative–competitive game-theoretic mechanisms with particle swarm optimization to enable dynamic resource allocation and adaptive task partitioning. Experimental results on two benchmark task graphs demonstrate that the CCCA achieves superior global optimization capability, reducing solution time by 41.6% compared to existing optimization methods. In particular, when extended to task graphs with 100 nodes, the algorithm maintains partitioning efficiency, keeping performance degradation below 5%, significantly outperforming other comparison algorithms. Furthermore, real-world system implementation on a dual-digital signal processor (DSP) and dual-field-programmable gate array (FPGA) platform validates the effectiveness of the algorithm’s automated partitioning, achieving a 56.25% reduction in execution time compared to manual design. These results highlight the potential of CCCA in optimizing HW–SW partitioning for complex multichiplet integrated systems.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 4","pages":"2735-2748"},"PeriodicalIF":8.4,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11360298","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148506995","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}
Yi Niu;Haiqing Huang;Ben Niu;Guangdeng Zong;Wenqi Zhou;Xiao Zheng;Yunfei Mu
{"title":"Security-Based Practical Fixed-Time Adaptive Control for High-Power Nonlinear Cyber-Physical Systems","authors":"Yi Niu;Haiqing Huang;Ben Niu;Guangdeng Zong;Wenqi Zhou;Xiao Zheng;Yunfei Mu","doi":"10.1109/TSMC.2026.3657362","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3657362","url":null,"abstract":"This article addresses the security-based practical fixed-time adaptive stabilization problem for nonlinear cyber-physical systems (CPSs) with higher powers under deception attacks. First, a novel practical fixed-time stability criterion is proposed based on Nussbaum functions. The criterion introduces a relaxed convergence condition, facilitating the analysis of practical fixed-time stability for high-power nonlinear systems. Second, to compensate for the compromised states, a dual coordinate transformation structure consisting of a virtual coordinate transformation and an available coordinate transformation is proposed. This structure is applicable to both low- and high-power systems. Moreover, a security-based fixed-time control strategy is developed by combining adaptive methods with Nussbaum functions to mitigate the influence of unknown attack gains. The proposed strategy also effectively overcomes the singularity problem. Finally, the effectiveness of the designed control strategy is validated through simulations.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 5","pages":"3250-3260"},"PeriodicalIF":8.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147685303","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":"Cooperative Output Regulation of Heterogeneous Systems With Actuator Faults: A Double-Layer Event-Triggered Approach","authors":"Guanglei Zhao;Yapeng Liu;Changchun Hua;Hailong Cui;Weili Ding","doi":"10.1109/TSMC.2026.3655078","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3655078","url":null,"abstract":"This work addresses the cooperative output regulation (COR) problem of heterogeneous multiagent systems (MASs) subject to actuator faults. First, a novel double-layer event-triggering mechanism (DLETM) is proposed, with appropriately constructed first-layer and second-layer triggering conditions, and allows communication events only at the second-layer’s triggering instants; it ensures that the communication frequency is reduced compared with the existing single-layer event-triggering mechanism (ETM). Then, a double-layer event-triggered (DLET) observer is designed to estimate the exosystem’s matrix with explicit minimum triggering interval (MTI), and an adaptive DLET observer is further developed to estimate the exosystem’s state, such that strong Zeno-freeness is ensured while global topology information is not required to implement the DLET observer. The introduction of the second-layer ETM brings a challenge for stability analysis and DLETM design. To solve this issue, a novel anti-trigonometric function term is added into Lyapunov function with well-designed internal adaptive variables. Moreover, an adaptive control law is designed to handle actuator faults, which ensures that the regulated output converges to zero, whereas most existing methods only ensure bounded error. Finally, simulation results confirm the effectiveness of the proposed approach.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 5","pages":"3060-3074"},"PeriodicalIF":8.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147685346","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":"Output Feedback Asynchronous Fuzzy SMC of Nonlinear Markov Jump Systems via Hidden Mode Detections","authors":"Wenqiang Ji;Haiyong Chen;Jianbin Qiu;Yuan Fan","doi":"10.1109/TSMC.2026.3657201","DOIUrl":"https://doi.org/10.1109/TSMC.2026.3657201","url":null,"abstract":"This work is concerned with the asynchronous output feedback sliding mode control (SMC) of stochastic nonlinear Markov jump systems (MJSs) via Takagi–Sugeno fuzzy models. Due to some real-world environment limitations, the actual system modes that are not directly available for controller synthesis are known as hidden modes. Then the sliding surface/sliding mode controller modes are featured as observable modes, and the relationship between these two concepts is established by employing emission probabilities. As a two-layer stochastic process, the hidden Markov model (HMM) governs the jump parameters and characterizes the asynchronous mode switching phenomenon between the original plant and the sliding surface/sliding mode controller. By integrating the sliding surface with the dynamical features of fuzzy MJSs, the dynamics of the sliding motion are described by constructing a T–S fuzzy singular MJS. Under a unified convexification setup, novel dissipative performance and stochastic stability analysis results on the sliding motion are proposed. In view of the full MJS states also not measurable, a novel observed-mode-based asynchronous output feedback dynamic SMC synthesis approach is propounded to ensure the MJSs’ states are located in a vicinity of the sliding surface. Illustrative simulation examples are finally provided to validate the superiority and effectiveness of the developed scheme.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 5","pages":"3049-3059"},"PeriodicalIF":8.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147685465","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 Cai;Kaixin Xu;Yihang Ding;Lixian Zhang;Yiming Wang
{"title":"Observer-Based Control for Switched Systems With Limited Statistical Information","authors":"Bo Cai;Kaixin Xu;Yihang Ding;Lixian Zhang;Yiming Wang","doi":"10.1109/TSMC.2025.3647957","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3647957","url":null,"abstract":"This article is concerned with stability analysis and observer-based control synthesis for a class of discrete-time switched linear systems with limited statistical information. Instead of commonly studied switching signals such as dwell-time (DT) or Markov chain, a more general class of switching signals, random mode-dependent persistent sojourn-time (RMPST) switching, is investigated. It is composed of fixed parts with no mode switching, random parts without distribution restrictions, and intervals where arbitrary switching is allowed. To tackle the challenges posed by inaccessible modes, unknown transition probabilities, and partially unknown sojourn-time distribution, stability analysis is performed via constructing a Lyapunov function tailored to accommodate the characteristics of RMPST switching. The proposed Lyapunov function is not only mode-dependent but also elapsed-time and quasi-time dependent during fixed-random parts and arbitrary switching intervals, respectively. By means of the new Lyapunov function, an observer-based control approach is introduced for underlying switched systems, and criteria for the existence of observers and controllers are established with the set of admissible switching signals. A novel algorithm is also developed to solve the existence condition by extending the traditional cone complementary linearization (CCL) technique. The effectiveness and applicability of the theoretical results are revealed by a practical space robot manipulator system.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 3","pages":"1574-1586"},"PeriodicalIF":8.4,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148504329","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":"Recursive Filtering for Complex Networks With Amplify-and-Forward Relays Over Double Time-Correlated Fading Channels","authors":"Qi Li;Zidong Wang;Jun Hu;Weiguo Sheng","doi":"10.1109/TSMC.2025.3647812","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3647812","url":null,"abstract":"In this article, the recursive filtering problem is investigated for a class of complex networks (CNs) incorporating amplify-and-forward (AF) relays and subject to double time-correlated fading channels (TCFCs). To extend the transmission distance, AF relays are deployed between sensors and filters to facilitate the signal transmission process. Both the sensor-to-relay and relay-to-filter channels are modeled as TCFCs, with their fading coefficients governed by distinct dynamical processes. A suitably augmented model is constructed to capture the combined effects of the network state and fading coefficients. Based on this model, a set of recursive filters is designed to ensure an upper bound on the filtering error covariance (FEC), and the corresponding filter gains that minimize this bound are parameterized by solving a set of recursive equations. Furthermore, the filtering performance is rigorously analyzed, and a sufficient condition is provided to guarantee the exponential boundedness of the filtering error in the mean-square sense. Finally, an example is presented to demonstrate the effectiveness of the proposed filtering strategy.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 3","pages":"1561-1573"},"PeriodicalIF":8.4,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148504877","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}