IEEE Transactions on Systems Man Cybernetics-Systems最新文献_第4页

Computational Creativity by Diversity-Optimized Intelligent Search: An Automatic Approach to Artificial Synthesis of Trigonometric Identities 多样性优化智能搜索的计算创造力：一种人工合成三角恒等式的自动方法

IF 8.6 1区计算机科学

IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2025-03-26 DOI: 10.1109/TSMC.2025.3550723

Sayantani Ghosh;Amit Konar

{"title":"Computational Creativity by Diversity-Optimized Intelligent Search: An Automatic Approach to Artificial Synthesis of Trigonometric Identities","authors":"Sayantani Ghosh;Amit Konar","doi":"10.1109/TSMC.2025.3550723","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3550723","url":null,"abstract":"This article emphasizes an interesting approach to synthesize computational creativity by a process similar to deductive reasoning with a provision for testing the degree of diversity of the generated instances compared to their predecessors. The above two-step process of expansion and testing is developed here using the best-first search (BFS) on an OR-tree, where the nodes denote trial solutions (new creations) and edges represent parent-child connectivity satisfying the rules of the given problem domain. Two alternative extensions of BFS are examined in view of the cost function employed at the nodes to ultimately determine the optimal node in the search tree within a user-defined depth as the solution to the creativity problem. The first algorithm considers maximizing the diversity cost earned by a node with respect to its parent, while the second considers maximizing the difference between the diversity and the penalty cost earned by a node with respect to the root node. The significant contribution of the present research lies in ensuring diversity of the solutions during iterative expansions of the tree as well as the novelty of the optimal solution (best node) across runs of the same program. The relative performances of the two algorithms are compared in the context of their applicability. Performance analysis undertaken reveals that the proposed algorithms outperform their competitors with respect to three important metrics. The proposed algorithms have successfully been employed in developing chapter-end exercises for trigonometric identity proving problems.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"4385-4395"},"PeriodicalIF":8.6,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073303","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}

引用次数: 0

A Compensation Matrix Based Model Predictive Control Structure for the Register Control of Roll-to-Roll Manufacturing 一种基于补偿矩阵的卷对卷加工暂准控制模型预测控制结构

IF 8.6 1区计算机科学

IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2025-03-26 DOI: 10.1109/TSMC.2025.3547246

Tao Zhang;Gaojie Li;Ying Zheng;Zhihua Chen

{"title":"A Compensation Matrix Based Model Predictive Control Structure for the Register Control of Roll-to-Roll Manufacturing","authors":"Tao Zhang;Gaojie Li;Ying Zheng;Zhihua Chen","doi":"10.1109/TSMC.2025.3547246","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3547246","url":null,"abstract":"In this article, we advance a compensation matrix based model predictive control (CMB-MPC) framework for the register control of roll-to-roll (R2R) printing systems to overcome the deficiencies of traditional model predictive control (MPC) in register precision and computational complexity. Within the structure of CMB-MPC, a compensation matrix is introduced, serving to simplify the internal predictive model tailored for the MPC controller of R2R printing systems through the preprocessing of control variables. According to the processed model, we propose a novel predictive control algorithm for register control, incorporating a coupling-based selection algorithm to strategize the control weight matrix of the controller against the adverse effects of system coupling. The effectiveness and superior performance of CMB-MPC are demonstrated by experiments and comparisons, and the results indicate that CMB-MPC imparts three distinct advantages. First, it significantly reduces the computational complexity of traditional MPC controllers for the register control of R2R printing systems. Second, it achieves a remarkable enhancement in register accuracy within R2R printing systems, surpassing the capabilities of conventional MPC and fully decoupled proportional-differential control methods. Third, the waste material controlled by CMB-MPC exhibits exceptional less, rendering it highly suitable for industrial applications.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"4163-4174"},"PeriodicalIF":8.6,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073437","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}

引用次数: 0

Contrastive Translation With Dynamical Temperature for Sequential Recommendation 基于动态温度的序列推荐对比翻译

IF 8.6 1区计算机科学

IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2025-03-26 DOI: 10.1109/TSMC.2025.3550701

Aoran Zhang;Yonghong Yu;Li Zhang;Rong Gao;Hongzhi Yin

{"title":"Contrastive Translation With Dynamical Temperature for Sequential Recommendation","authors":"Aoran Zhang;Yonghong Yu;Li Zhang;Rong Gao;Hongzhi Yin","doi":"10.1109/TSMC.2025.3550701","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3550701","url":null,"abstract":"Contrastive learning is a promising solution to the problem of data sparsity in the field of recommendation system since it is able to extract self-supervised signals from raw data. The traditional contrastive learning-based sequential recommendation algorithms generate augmentations of original item sequences by utilizing crop, mask and reorder operations. However, those augmentation schemes destroy the underlying semantics of item sequences, resulting in difficulty in accurately defining positive and negative samples. To address this issue, we propose a contrastive translation based sequential recommendation algorithm, namely, CT4Rec. Specifically, CT4Rec generates augmented views of item sequences by injecting noises into embeddings of users and items, which is able to guarantee that the underlying semantics of augmented views are consistent with those of original item sequence. Hence, CT4Rec is able to effectively learn the invariances among the augmented views. In addition, the personalized translation operations are utilized to model the third-order relationships among entities. Moreover, it is difficult for contrastive learning-based recommendation algorithms with static temperature to simultaneously capture the differences among individual users/items and among the clusters of users/items. Hence, we utilize a dynamic temperature strategy to enhance CT4Rec, which endows CT4Rec with the capabilities of group-wise discrimination and instance discrimination. Our validation on five benchmark datasets shows that CT4Rec outperforms SOTA sequential recommendation methods. Our code is released at <uri>https://github.com/zar123123/CT4Rec</uri>.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"4273-4285"},"PeriodicalIF":8.6,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144072897","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}

引用次数: 0

Interval Observer-Based Coordination Control for Discrete-Time Multi-Agent Systems 离散多智能体系统的区间观测器协调控制

IF 8.6 1区计算机科学

IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2025-03-26 DOI: 10.1109/TSMC.2025.3545954

Miaohong Luo;Housheng Su;Wei Xing Zheng

{"title":"Interval Observer-Based Coordination Control for Discrete-Time Multi-Agent Systems","authors":"Miaohong Luo;Housheng Su;Wei Xing Zheng","doi":"10.1109/TSMC.2025.3545954","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3545954","url":null,"abstract":"In this article, the coordination control problem of discrete-time multiagent systems (MASs) affected by uncertainties, namely unknown initial states and external disturbances, is considered. Inspired by the interval observer constructed by the single system, the definition of distributed interval observer for discrete-time MASs is given, in which the control protocol of each agent obtained by solving a modified algebraic Riccati equation depends on the bounded information of the interval observer connected to itself and its neighbors. By the cooperativity theory and Lyapunov stability theory, it is established that the distributed interval observer can not only access some information about MASs at any instant, that is, the upper and lower bounds of each component of the agent state, but also realize the cooperative behavior of MASs under some essential conditions involving network synchronization and the unstable eigenvalue of the system matrix. In addition, with the help of a new time-varying transformation matrix, the new interval observer is constructed to eliminate the non-negative constraint. Finally, two numerical simulations are provided to confirm the validity of the derived results.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"4102-4114"},"PeriodicalIF":8.6,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073417","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}

引用次数: 0

Compliant Control of Flexible Joint Toward Prescribed Performance With Gaussian Kernels 基于高斯核的柔性关节柔顺控制

IF 8.6 1区计算机科学

IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2025-03-25 DOI: 10.1109/TSMC.2025.3548306

Hongyu Wan;Silu Chen;Xiangjie Kong;Xianbei Sun;Chin-Yin Chen;Jinhua Chen;Chi Zhang;Guilin Yang

{"title":"Compliant Control of Flexible Joint Toward Prescribed Performance With Gaussian Kernels","authors":"Hongyu Wan;Silu Chen;Xiangjie Kong;Xianbei Sun;Chin-Yin Chen;Jinhua Chen;Chi Zhang;Guilin Yang","doi":"10.1109/TSMC.2025.3548306","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3548306","url":null,"abstract":"It remains a challenge to improve the accuracy of impedance rendering while ensuring stability under strong impacts during human-robot interaction. In this work, we aim to render the desired impedance for the flexible joint under an admittance control scheme with prescribed performance function (PPF). Specially, Gaussian kernels are introduced as the slack terms for PPF, so that the control stability can be maintained in the presence of abrupt external torques. Meanwhile, a narrower error envelope is yielded when such torques are absent, which also improves the fidelity of the desired impedance model. To achieve the prescribed tracking performance of the inner position loop, a two-stage backstepping control is proposed by defining two first-order composite error surfaces bridged by a second-order dynamic surface. This promulgates the minimum number of backstepping stages under the available state feedback, thus avoiding “explosion of terms.” In addition, dual-adaptive neural networks are incorporated into the backstepping control to compensate for the matched and unmatched disturbances. Real-time experiments are conducted to validate the appeal of the proposed method.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"3769-3779"},"PeriodicalIF":8.6,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073239","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}

引用次数: 0

Multichannel-Based Multiview Shallow Fusion for Time Series Classification and Its Application in Fault Diagnosis 基于多通道的多视图浅融合时间序列分类及其在故障诊断中的应用

IF 8.6 1区计算机科学

IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2025-03-25 DOI: 10.1109/TSMC.2025.3548662

Changchun He;Xin Huo;Yuchen Jiang;Chao Zhu

{"title":"Multichannel-Based Multiview Shallow Fusion for Time Series Classification and Its Application in Fault Diagnosis","authors":"Changchun He;Xin Huo;Yuchen Jiang;Chao Zhu","doi":"10.1109/TSMC.2025.3548662","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3548662","url":null,"abstract":"In the current time series classification (TSC) field, shallow concatenation, deep fusion, and hybrid ensemble multichannel frameworks (MCF) represented by convolution-based, deep learning, and hybrid methods have achieved competitive TSC performance. However, the massive kernels, deep fusion, and heterogeneous ensemble mechanisms, which are the core of the three frameworks, respectively, lead to overfitting risks. Therefore, in this article, a novel convolution-based TSC algorithm multichannel-based multiview shallow fusion (MC-MSF) within a new shallow fusion ensemble-based MCF is proposed. MC-MSF enhances feature diversity, quality, and classifier diversity while suppressing the overfitting risks via three shallow components. For feature diversity, the original series is mapped to the connected multichannel series spaces, and then diverse pooling features are extracted via a single-layer convolution with fewer kernels. For feature quality, the power of proportion of positive values (PPPV) features with adaptive powers are extracted based on alternating gradient descent, and the multiview shallow feature fusion is implemented to generate fused features. For classifier diversity, diverse linear classifiers are trained on the combined multiview feature vectors to ensemble homogeneously. The state-of-the-art TSC accuracy is achieved by MC-MSF via the sequential operation of three effective shallow components, as verified by comparative experiments on the public UCR and real excavator fault diagnosis application datasets.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"4052-4063"},"PeriodicalIF":8.6,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144090803","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}

引用次数: 0

Distributed Adaptive Dynamic Programming for Consensus Control of Multiagent Systems Within Hierarchical Stackelberg–Nash Game Framework 层次Stackelberg-Nash博弈框架下多智能体系统共识控制的分布式自适应动态规划

IF 8.6 1区计算机科学

IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2025-03-25 DOI: 10.1109/TSMC.2025.3548319

Haoyan Zhang;Yingwei Zhang;Xudong Zhao;Chun-Yi Su

{"title":"Distributed Adaptive Dynamic Programming for Consensus Control of Multiagent Systems Within Hierarchical Stackelberg–Nash Game Framework","authors":"Haoyan Zhang;Yingwei Zhang;Xudong Zhao;Chun-Yi Su","doi":"10.1109/TSMC.2025.3548319","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3548319","url":null,"abstract":"This article investigates the leader-follower consensus for nonlinear multiagent systems (MASs) and proposes an adaptive dynamic programming (ADP)-based hierarchical Stackelberg-Nash optimal game control method. Initially, a coupled performance index function associated with consensus errors is constructed. As the positive-definite function with the quadratic form is allocated to the constructed consensus errors-based performance index function, the original system stabilization problem is converted into the issue of seeking an optimal control strategy profile for the leader and followers. Under the hierarchical Stackelberg-Nash differential game framework, the optimal control strategies are derived in sequence and further proved to compose the equilibrium points of Stackelberg-Nash differential games. Afterward, based on the ADP technique, a modified single-critic neural network (NN) is implemented and the coupled Hamilton-Jacobi–Bellman (HJB) equation is approximately identified. Under the proposed control scheme, the leader-follower consensus of the considered MAS can be achieved while consuming less control cost. Meanwhile, all signals of the MAS are ensured to be uniformly ultimately bounded. Finally, a numerical simulation and an application to the electrode regulating system of the three-phase electric arc furnace are given to verify the effectiveness of the proposed control method.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"4286-4300"},"PeriodicalIF":8.6,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144072898","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}

引用次数: 0

Super-Ellipse Formation Tracking of Uncertain Vehicles: A Simplified Reinforcement Learning Energy Optimization Method 不确定车辆超椭圆编队跟踪：一种简化的强化学习能量优化方法

IF 8.6 1区计算机科学

IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2025-03-24 DOI: 10.1109/TSMC.2025.3548081

Rui Yu;Yang-Yang Chen;Guanghui Wen;Shuai Wang;Tingwen Huang

{"title":"Super-Ellipse Formation Tracking of Uncertain Vehicles: A Simplified Reinforcement Learning Energy Optimization Method","authors":"Rui Yu;Yang-Yang Chen;Guanghui Wen;Shuai Wang;Tingwen Huang","doi":"10.1109/TSMC.2025.3548081","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3548081","url":null,"abstract":"This article deals with the optimal super-ellipse formation tracking control problem for multiple unmanned vehicles (MUVs), where each vehicle contains nonlinear uncertainties of unmodeled basic resistance, and the objective of energy optimization includes the super-ellipse orbit tracking energy and formation motion energy on the normal and tangent directions along the super-ellipse orbits, respectively. The communication topology is the directed leader-following structure. To avoid using the inputs of neighboring MUVs and the global communication information, a novel augmented formation input is designed and integrated into the formation motion subsystem. To deal with the uncertain nonlinearity, the uncertain virtual leader information, and the limited information of neighboring MUVs in the Hamilton-Jacobi–Bellman equations, a simplified reinforcement learning (RL) energy optimization method is designed based on identifier neural networks (NNs) and optimized backstepping technique. Theoretical stability analysis of system errors are given in detail. Simulation results show that the super-ellipse formation tracking energy consumption is significantly saved and the algorithm run time is decreased through comparison.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"3881-3891"},"PeriodicalIF":8.6,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073271","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}

引用次数: 0

Adaptive NN Output Feedback Control of Switched Nonlinear Systems via Multiple Event-Triggering Communications 基于多事件触发通信的切换非线性系统的自适应神经网络输出反馈控制

IF 8.6 1区计算机科学

IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2025-03-24 DOI: 10.1109/TSMC.2025.3549528

Fenglan Wang;Lijun Long

{"title":"Adaptive NN Output Feedback Control of Switched Nonlinear Systems via Multiple Event-Triggering Communications","authors":"Fenglan Wang;Lijun Long","doi":"10.1109/TSMC.2025.3549528","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3549528","url":null,"abstract":"In this article, the problem of multiple event-triggering communications-based adaptive neural network (NN) output-feedback control is investigated for a class of switched uncertain nonlinear systems. In particular, the NNs with self-growing/pruning neurons are utilized to handle unknown nonlinearities of system. By developing backstepping, an event-triggered switched NN observer, event-triggered adaptive NN controllers of subsystems and three novel switching dynamic event-triggering mechanisms (ETMs) are constructed. Multiple event-triggering communications from sensor to controller and observer to controller and controller to actuator are thus achieved under arbitrary switchings. Naturally, more communication burdens can be reduced compared with those existing single or dual event-triggering communications methods for non-switched and switched systems. Note that one difficulty caused by dual asynchronous switchings among candidate subsystems and candidate controllers and candidate observers is overcome. Also, other difficulties caused by finding an adjustable positive lower bound of interexecution times for each ETM and the errors between continuous-time and sampled-data-based basis function vectors of NNs are overcome. A switched one-link robotic manipulator system is employed to illustrate the validity of the scheme developed.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"3906-3916"},"PeriodicalIF":8.6,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073269","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}

引用次数: 0

Dynamic Nash Equilibrium Seeking for Constrained Noncooperative Game of Open Multiagent Systems 开放多智能体系统约束非合作博弈的动态纳什均衡寻求

IF 8.6 1区计算机科学

IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2025-03-24 DOI: 10.1109/TSMC.2025.3548122

Jing-Zhe Xu;Zhi-Wei Liu;Ding-Xin He;Zhian Jia;Ming-Feng Ge

{"title":"Dynamic Nash Equilibrium Seeking for Constrained Noncooperative Game of Open Multiagent Systems","authors":"Jing-Zhe Xu;Zhi-Wei Liu;Ding-Xin He;Zhian Jia;Ming-Feng Ge","doi":"10.1109/TSMC.2025.3548122","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3548122","url":null,"abstract":"Open multiagent systems (OMASs) feature a dynamic structure with agents continuously joining or leaving, resulting in shifting Nash equilibria and frequent disruptions of equality constraints. This inherent instability poses a significant challenge to traditional incremental-consensus-based distributed optimization or game methods, which rely on a stable and consistent agent population to compute and maintain equilibrium solutions effectively. The necessity for these methods to continuously enforce constraints and the time-intensive process of recalculating equilibria in response to agent dynamics present a substantial bottleneck in the optimization of OMASs. To address this challenge, we develop an innovative incremental consensus-based distributed (ICBD) algorithm to achieve the dynamic Nash equilibrium (NE) for constrained noncooperative game of OMASs. The ICBD algorithm leverages predefined-time stability and integral sliding-mode control to enable rapid recalibration to new equilibria and maintain constraints without the need for prolonged recalculations. Finally, several numerical simulations validate our approach to demonstrating its effectiveness.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 6","pages":"3846-3855"},"PeriodicalIF":8.6,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144073249","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}

引用次数: 0