{"title":"A Novel Hierarchical Distributed Robust Formation Control Strategy for Multiple Quadrotor Aircrafts","authors":"Qianxiong Li;Xiaoqing Lu;Yaonan Wang","doi":"10.1109/TSMC.2025.3585704","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3585704","url":null,"abstract":"Multiple quadrotor aircraft system has significant advantages for performing complex tasks in dangerous environments, but it is still challenging for formation with external disturbance or internal model uncertainty. This article establishes a hierarchical distributed robust formation strategy for multiple quadrotor aircrafts, in which trajectory tracking and attitude formation are, respectively, controlled in different layers. An upper trajectory tracking controller is proposed to generate desired position for lower anti-disturbance attitude formation controller, where a bi-level adaptive terminal sliding mode controller with disturbance observers are, respectively, designed. In lower control layer, the desired velocity is generated by velocity control part to ensure quadrotor aircraft to track desired position while maintaining certain formation shape, whereas the acceleration control part is responsible for driving actual velocity of each quadrotor aircraft to desired velocity. Stability analysis shows that the prescribed formation can be realized if unknown disturbance is bounded and time constants in different layers are selected appropriately. Compared with existing results, the proposed strategy enables multiple complex tasks to be realized in different layers to improve formation accuracy and achieve interference suppression. The effectiveness is verified through both Gazebo simulation and actual experiment.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"6450-6462"},"PeriodicalIF":8.7,"publicationDate":"2025-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100308","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 New Scheduling Approach to Wafer-Residency-Time-Constrained Dual-Arm Cluster Tools Concurrently Processing Multivariety Wafers","authors":"Jufeng Wang;Tingting Leng;Chunfeng Liu;MengChu Zhou;Side Zhao","doi":"10.1109/TSMC.2025.3579615","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3579615","url":null,"abstract":"In the periodic scheduling problems of a dual-arm wafer-residency-time-constrained (W-R-T-C) cluster tool (CT) with multivariety wafers, it is important to balance workload at each step. This work proposes a method of processing module (PM) two-layer configuration. First, one PM configuration is made for each wafer type, i.e., the suitable number of PMs is selected for processing wafers, ensuring that the natural workload is balanced at each step for a type of wafers. Then, the other PM configuration is made, i.e., adopt a virtual module method for balancing the natural workload at bottleneck processing steps of different types of wafers. Based on two-layer PM configuration, this work derives necessary and sufficient conditions for a CT’s schedulability, which are less restrictive than the current state-of-the-art ones. It proposes a polynomial-time algorithm for computing its minimum periodic schedule when it is schedulable. Several examples are given to show our algorithm’s superiority over existing ones.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"7075-7084"},"PeriodicalIF":8.7,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100496","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":"Multisource Feature Separation and Weighted Network for Cross-Conditional Capacity Estimation of Lithium Batteries","authors":"Yi Lyu;Xu Xiao;Ruhui Fan;Ci Chen","doi":"10.1109/TSMC.2025.3585260","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3585260","url":null,"abstract":"Accurate prediction of lithium-ion battery capacity is a critical task in BMSs. However, existing multisource domain adaptation methods often ignore the different contributions of each source domain, focusing solely on aligning the global distributions of source and target domains. This limitation can result in negative transfer. To address this issue, this article proposes a multisource feature separation and weighted (MFSW) network for lithium-ion battery capacity estimation. First, private and common features of both source and target domains are disentangled through feature separation. An adversarial mechanism is employed to guide the common feature extractor to learn domain-invariant features. Then, the features are further aligned using a multiorder metric. Finally, a multisource dynamic weighting method is introduced to adaptively adjust the weight of each source domain. Compared with other multisource domain adaptation methods, the proposed method reduces the average MSE and MAE by 56.3% and 28.8% on the MIT dataset, and by 44.0% and 38.6% on the XJTU dataset, respectively. Extensive experimental results demonstrate that the proposed method effectively mitigates negative transfer and exhibits superior performance and robustness.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"6842-6856"},"PeriodicalIF":8.7,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100488","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":"Distributed Cooperative Control of Human–UAV Swarm Based on State Observation","authors":"Hangxuan He;Mengzhen Huo;Haibin Duan;Yimin Deng;Chen Wei","doi":"10.1109/TSMC.2025.3584209","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3584209","url":null,"abstract":"This article proposes an integrated framework for unmanned aerial vehicles (UAVs) cooperative control, combining advanced distributed control strategies with human–swarm interaction mechanisms to address obstacle avoidance scenarios. First, distributed controllers are designed to explicitly account for observer errors. Specifically, first-order and high-order control barrier functions (CBFs), integrated with the bounded-error observer, are proposed and theoretically validated. These CBFs impose constraints on the control inputs to guarantee system safety during the entire operation. Second, a three-tier human–UAV swarm interaction architecture is introduced, enabling comprehensive human intervention across different operational levels. To verify the effectiveness and practicality of the proposed method, simulation experiments are conducted in a target tracking and rescue scenario. The integrated observer–controller design demonstrates superior performance over conventional approaches, exhibiting enhanced obstacle avoidance capabilities and robust disturbance rejection. The three-tier framework can effectively coordinate human–UAV swarm interaction and improve the efficiency of the swarm mission.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"7335-7345"},"PeriodicalIF":8.7,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145090072","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}
Qianlei Jia;Francisco Javier Cabrerizo;Ignacio Javier Pérez;Enrique Herrera-Viedma
{"title":"A Group Decision-Making Model Integrating Information Consensus and Polarity","authors":"Qianlei Jia;Francisco Javier Cabrerizo;Ignacio Javier Pérez;Enrique Herrera-Viedma","doi":"10.1109/TSMC.2025.3585186","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3585186","url":null,"abstract":"In opinion dynamics (OODs), the DeGroot and Hegselmann–Krause (HK) bounded confidence models are foundational tools for studying information evolution. However, both models have unavoidable limitations, particularly in group decision-making scenarios. This article proposes a novel OODs model that integrates the strengths of both the DeGroot and HK models within a unified framework. The proposed model balances ultimate consensus and diversity without requiring a subjectively chosen threshold by introducing an improved hyperbolic tangent function. Adjusting the function’s parameter enables a smooth transition between the DeGroot and HK models, enhancing adaptability across various scenarios. To determine the weights of agents during information evolution, we develop a calculation method based on a distance measure. Furthermore, the model’s properties are thoroughly analyzed through theoretical derivations. The model is extended to the linguistic environment, aligning with natural expression habits in real-world contexts. Comprehensive examples and comparisons validate the proposed model’s effectiveness, demonstrating its superiority and robustness.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"7379-7394"},"PeriodicalIF":8.7,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145090164","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":"Arithmetic-Free Personalized Compressed Sensing Based On Deep Neural Networks for Wireless Transmission From Brain–Computer Interfaces","authors":"Erfan Ebrahim Esfahani;Ali Khadem","doi":"10.1109/TSMC.2025.3584478","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3584478","url":null,"abstract":"State-of-the-art brain–computer interfaces can carry out neural recording from hundreds of channels with high resolution. Such massive data makes it easy to study the brain better than ever before, but on the flip side, it leads to increased chip size, power consumption, heat dissipation and risk for patient safety. As such, compression of the data prior to transmission from the implant could be key to improving reliability and usability of such microsystems. In recent years, starting from sparsifying transforms all the way to compressive autoencoders (AEs), this compression has been offered by substantial arithmetic on the implant side, which in turn incurs its own inevitable costs. In this work, we analyze spike waveforms to prioritize subintervals by their importance. Thereupon, we design a temporal undersampling pattern matching the importance of each subinterval for compressive sensing of spikes. Following such sensing, we reconstruct spikes using a deep neural network (DNN) trained to capture spike representation from the undersampled measurements, with possible adaptation to individual subjects. This approach offers what we believe is the first spike compression-reconstruction framework that imposes no arithmetic on the compressing side, yet on the restoration side, performs at least on par with most on-chip arithmetic-heavy techniques. For instance, given a spike length of <inline-formula> <tex-math>$N=64$ </tex-math></inline-formula> at eightfold compression, the famed symmlet-4 method yields a mean signal-to-noise-and-distortion ratio (SNDR) of 7.14 dB at a total compression arithmetic cost of <inline-formula> <tex-math>$16N$ </tex-math></inline-formula> sums and products per spike, while for the proposed method, the figure is 8.38 dB at 0 sums and products.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"7228-7237"},"PeriodicalIF":8.7,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100324","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}
Jian Song;Guanjun Liu;Ying Tang;Li Wang;Miaomiao Wang;Lin Li
{"title":"An Innovative Formal Verification Method Based on Timed Petri Nets With Integrated Database Tables","authors":"Jian Song;Guanjun Liu;Ying Tang;Li Wang;Miaomiao Wang;Lin Li","doi":"10.1109/TSMC.2025.3585039","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3585039","url":null,"abstract":"Formal verification becomes increasingly critical to ensure system functionality, reliability and safety as they grow in complexity. Existing methods tend to focus on a single dimension of system aspects—such as control flow, data flow or timing constraints—or, at most, consider two of these perspectives without integrating all three. In addition, data flow models generally represent high-level data abstraction without including operational details within underlying contexts. The inability of these models to capture system behavior undermines their reliability, ultimately increasing the likelihood of the corresponding systems malfunctioning. To address these issues, we propose a formal verification method based on a timed Petri net with database tables (TPDT-net). First, we model the system using TPDT-net and generate its state reachability graph (SRG). Next, we extend timed computation tree logic (TCTL) by introducing database-related data element operators, thus proposing a database-oriented TCTL (DTCTL) model checking method. In addition, we formalize the system correctness problem as corresponding DTCTL formulas, which are analyzed based on the SRG. This approach transforms correctness verification into a satisfiability problem of DTCTL formulas within the SRG. Finally, we validate the practicality and effectiveness of the proposed method through case studies and experiments.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"7410-7424"},"PeriodicalIF":8.7,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145090165","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":"Cluster Synchronization of Individuals During an Epidemic: A Contraction-Based Analysis","authors":"Shidong Zhai;Jinkui Zhang;Jun Ma;Zhengrong Xiang","doi":"10.1109/TSMC.2025.3585121","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3585121","url":null,"abstract":"This article investigates cluster synchronization (CS) of individuals during an epidemic using a coupled nonlinear network that integrates diffusion-coupled nonlinear systems with an susceptible-infected-recovered (SIR) virus model. To better reflect real-life scenarios, individuals are grouped into clusters, and the model incorporates recovery rates that vary according to collective behavior patterns. The study focuses on analyzing the relationship between CS behavior and the progression of virus transmission within the network. By ensuring that the directed graph satisfies the cluster input equivalence condition and that the system’s Jacobian matrix remains bounded, contraction analysis is employed to establish conditions for achieving CS, which are influenced by the virus’s state. Furthermore, the impact of CS on epidemic dynamics is explored. Numerical simulations validate the theoretical findings.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"6868-6878"},"PeriodicalIF":8.7,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100344","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 Universal Reactive Approach for Graph-Based Persistent Path Planning Problems With Temporal Logic Constraints","authors":"Tong Wang;Yuanhao Li;Panfeng Huang","doi":"10.1109/TSMC.2025.3579023","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3579023","url":null,"abstract":"This article introduces a reactive methodology tailored for a wide range of practical graph-based path planning applications. In these scenarios, a robot with limited sensor capabilities traverses an undirected graph to optimize metrics related to task duration. This article formalizes these challenges as graph-based persistent path planning problems with temporal logical constraints and proposes a comprehensive persistence planning framework. A novel universal algorithm with quadratic time complexity is designed, striking an optimal balance between accuracy and computational efficiency by establishing a new decision space. Theoretical analysis verifies the algorithm’s convergence and generality, especially for patrol, persistent surveillance, and watchman routing tasks. Moreover, the proposed algorithm is evaluated across various simulation scenarios, demonstrating its effectiveness in addressing complex path planning challenges.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"6696-6709"},"PeriodicalIF":8.7,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100307","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}
Fuxi Niu;Xiaohong Nian;Miaoping Sun;Yong Chen;Yu Shi;Jieyuan Yang;Shiling Li
{"title":"Distributed Nonconvex Optimization and Application to UAV Optimal Rendezvous Formation","authors":"Fuxi Niu;Xiaohong Nian;Miaoping Sun;Yong Chen;Yu Shi;Jieyuan Yang;Shiling Li","doi":"10.1109/TSMC.2025.3583312","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3583312","url":null,"abstract":"A distributed multiagent deep reinforcement learning algorithm (DMADRLA) with theoretical guarantees is proposed for the distributed nonconvex constraint optimization problem. This algorithm provides an innovative theoretical framework for distributed nonconvex optimization problems (DNCOPs) by combining traditional distributed constraint optimization and multiagent deep reinforcement learning methods. This combination eliminates the need for general assumptions on the cost function, enabling a more comprehensive view of distributed nonconvex optimization strategies. It allows for the analysis of both traditional distributed constrained optimization and multiagent deep reinforcement learning methods in one unified approach. Finally, the effectiveness of the algorithm is verified through numerical simulations and experimental verification.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"6789-6801"},"PeriodicalIF":8.7,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100306","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}