Pub Date : 2024-10-02DOI: 10.1109/TCYB.2024.3464642
Yifeng Li, Baoyu Liu, Xuewen Liu, Zhichun Yang, Yongduan Song
This article proposes a nonaugmented method for investigating the minimal observability problem of Boolean networks (BNs). This method can be applied to more general BNs and reduce the computational and space complexity of existing results. First, unobservable states concerning an unobservable BN are classified into three categories using the vertex-colored state transition graph, each accompanied by a necessary and sufficient condition for determining additional measurements to make them distinguishable. Then, an algorithm is designed to identify the additional measurements that would render an unobservable BN observable using the conditions. Next, to determine the minimum added measurements, a necessary and sufficient condition and an algorithm based on a constructed matrix are presented. Finally, the results obtained are compared with existing literature and illustrated with examples.
{"title":"A Nonaugmented Method for the Minimal Observability of Boolean Networks.","authors":"Yifeng Li, Baoyu Liu, Xuewen Liu, Zhichun Yang, Yongduan Song","doi":"10.1109/TCYB.2024.3464642","DOIUrl":"https://doi.org/10.1109/TCYB.2024.3464642","url":null,"abstract":"<p><p>This article proposes a nonaugmented method for investigating the minimal observability problem of Boolean networks (BNs). This method can be applied to more general BNs and reduce the computational and space complexity of existing results. First, unobservable states concerning an unobservable BN are classified into three categories using the vertex-colored state transition graph, each accompanied by a necessary and sufficient condition for determining additional measurements to make them distinguishable. Then, an algorithm is designed to identify the additional measurements that would render an unobservable BN observable using the conditions. Next, to determine the minimum added measurements, a necessary and sufficient condition and an algorithm based on a constructed matrix are presented. Finally, the results obtained are compared with existing literature and illustrated with examples.</p>","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"PP ","pages":""},"PeriodicalIF":9.4,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142365099","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}
Pub Date : 2024-10-02DOI: 10.1109/TCYB.2024.3467178
Ziming Ren, Hao Liu, Guanghui Wen, Jinhu Lu
In this article, the security formation control problem is investigated for underactuated quadrotors involving nonlinear coupled dynamics, subject to denial-of-service (DoS) attacks and uncertain communication faults. A security formation control method is proposed, including a distributed resilient observer and a hierarchical data-driven controller. The observer with an adaptive event-triggered mechanism is developed to restrain the influence of DoS and communication faults on interaction information among quadrotors, and Zeno behavior of all observers can be avoided. The optimal control laws are learned iteratively based on observation data and system data by utilizing reinforcement learning without knowledge of system dynamics. The stability of the constructed closed-loop control system is proven, and sufficient conditions are established for the unreliable network. Simulation results demonstrate the advantages of the proposed security control method.
本文研究了涉及非线性耦合动力学、受拒绝服务（DoS）攻击和不确定通信故障影响的欠驱动四旋翼飞行器的安全编队控制问题。本文提出了一种安全编队控制方法，包括分布式弹性观测器和分层数据驱动控制器。开发了具有自适应事件触发机制的观测器，以抑制 DoS 和通信故障对四旋翼飞行器之间交互信息的影响，并可避免所有观测器的 Zeno 行为。在不了解系统动态的情况下，利用强化学习，根据观测数据和系统数据迭代学习最优控制法则。构建的闭环控制系统的稳定性得到了证明，并为不可靠网络建立了充分条件。仿真结果证明了所提出的安全控制方法的优势。
{"title":"Event-Triggered Data-Driven Security Formation Control for Quadrotors Under Denial-of-Service Attacks and Communication Faults.","authors":"Ziming Ren, Hao Liu, Guanghui Wen, Jinhu Lu","doi":"10.1109/TCYB.2024.3467178","DOIUrl":"https://doi.org/10.1109/TCYB.2024.3467178","url":null,"abstract":"<p><p>In this article, the security formation control problem is investigated for underactuated quadrotors involving nonlinear coupled dynamics, subject to denial-of-service (DoS) attacks and uncertain communication faults. A security formation control method is proposed, including a distributed resilient observer and a hierarchical data-driven controller. The observer with an adaptive event-triggered mechanism is developed to restrain the influence of DoS and communication faults on interaction information among quadrotors, and Zeno behavior of all observers can be avoided. The optimal control laws are learned iteratively based on observation data and system data by utilizing reinforcement learning without knowledge of system dynamics. The stability of the constructed closed-loop control system is proven, and sufficient conditions are established for the unreliable network. Simulation results demonstrate the advantages of the proposed security control method.</p>","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"PP ","pages":""},"PeriodicalIF":9.4,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142365100","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}
Pub Date : 2024-10-01DOI: 10.1109/TCYB.2024.3462718
Chong Liu;Zhousheng Chu;Zhongxing Duan;Huaguang Zhang;Zongfang Ma
The problem of the large-scale interconnected system (LSIS) control is prevalent in practical engineering and is becoming increasingly complex. In this article, we propose a novel decentralized event-triggered tracking control (ETTC) strategy for a class of continuous-time nonlinear LSIS with unmatched interconnected terms and asymmetric input constraints. First, auxiliary subsystems are established to address the unmatched cross-linking terms. Next, the dynamics states of the tracking error and the exosystem are combined to construct a nominal augmented subsystem. By employing a nonquadratic performance function, the input-constrained decentralized tracking control problem is transformed into an optimal control problem for the nominal augmented subsystem. A group of independent parameters and event-triggered conditions are designed to save communication bandwidth and computational resources. Subsequently, the critic-only adaptive dynamic programming (ADP) method is used to solve the Hamilton-Jacobi–Bellman equation (HJBE) associated with the optimal control problem. To improve training success rate, the weights of the critic neural network (NN) are updated by introducing a particle swarm optimization algorithm (PSOA). The tracking error and the NN weights are proved to be uniformly ultimately bounded (UUB) under the proposed ETTC by using the Lyapunov extension theorem. Finally, the simulation example of an unmatched interconnected system is provided to verify the validity of the proposed decentralized method.
{"title":"Decentralized Event-Triggered Tracking Control for Unmatched Interconnected Systems via Particle Swarm Optimization-Based Adaptive Dynamic Programming","authors":"Chong Liu;Zhousheng Chu;Zhongxing Duan;Huaguang Zhang;Zongfang Ma","doi":"10.1109/TCYB.2024.3462718","DOIUrl":"10.1109/TCYB.2024.3462718","url":null,"abstract":"The problem of the large-scale interconnected system (LSIS) control is prevalent in practical engineering and is becoming increasingly complex. In this article, we propose a novel decentralized event-triggered tracking control (ETTC) strategy for a class of continuous-time nonlinear LSIS with unmatched interconnected terms and asymmetric input constraints. First, auxiliary subsystems are established to address the unmatched cross-linking terms. Next, the dynamics states of the tracking error and the exosystem are combined to construct a nominal augmented subsystem. By employing a nonquadratic performance function, the input-constrained decentralized tracking control problem is transformed into an optimal control problem for the nominal augmented subsystem. A group of independent parameters and event-triggered conditions are designed to save communication bandwidth and computational resources. Subsequently, the critic-only adaptive dynamic programming (ADP) method is used to solve the Hamilton-Jacobi–Bellman equation (HJBE) associated with the optimal control problem. To improve training success rate, the weights of the critic neural network (NN) are updated by introducing a particle swarm optimization algorithm (PSOA). The tracking error and the NN weights are proved to be uniformly ultimately bounded (UUB) under the proposed ETTC by using the Lyapunov extension theorem. Finally, the simulation example of an unmatched interconnected system is provided to verify the validity of the proposed decentralized method.","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"54 11","pages":"6895-6908"},"PeriodicalIF":9.4,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142362897","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}
Pub Date : 2024-10-01DOI: 10.1109/TCYB.2024.3455935
Dongji Wang;Shengyuan Xu
This article is dedicated to researching the problem of composite anti-disturbance control for nonlinear hidden Markov jump systems, described by the interval type-2 Takagi-Sugeno fuzzy method, under replay attacks in the continuous-time domain. Based on dynamic output feedback control and disturbance observer, a fuzzy composite controller, following the core idea of nonparallel distribution compensation, is designed to compensate for the impact of multiple disturbances. For replay attacks, a multisensor scheme with the detection mechanism is introduced, enabling the studied systems to remain stable even under attacks. Afterward, with the aid of the Lyapunov stability theory, sufficient conditions for ensuring the stability of the resulting systems are deduced, and then the gains of the desired controller and disturbance observer are obtained. Finally, the rationality and effectiveness of the established method are demonstrated through simulation, as well as its superiority over the traditional ${mathcal {H}}_{infty }$ control method.
{"title":"Composite Anti-Disturbance Control for Nonlinear Hidden Markov Jump Systems Under Replay Attacks: A Dynamic Output-Feedback Method","authors":"Dongji Wang;Shengyuan Xu","doi":"10.1109/TCYB.2024.3455935","DOIUrl":"10.1109/TCYB.2024.3455935","url":null,"abstract":"This article is dedicated to researching the problem of composite anti-disturbance control for nonlinear hidden Markov jump systems, described by the interval type-2 Takagi-Sugeno fuzzy method, under replay attacks in the continuous-time domain. Based on dynamic output feedback control and disturbance observer, a fuzzy composite controller, following the core idea of nonparallel distribution compensation, is designed to compensate for the impact of multiple disturbances. For replay attacks, a multisensor scheme with the detection mechanism is introduced, enabling the studied systems to remain stable even under attacks. Afterward, with the aid of the Lyapunov stability theory, sufficient conditions for ensuring the stability of the resulting systems are deduced, and then the gains of the desired controller and disturbance observer are obtained. Finally, the rationality and effectiveness of the established method are demonstrated through simulation, as well as its superiority over the traditional \u0000<inline-formula> <tex-math>${mathcal {H}}_{infty }$ </tex-math></inline-formula>\u0000 control method.","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"54 11","pages":"7038-7047"},"PeriodicalIF":9.4,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142362856","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}
Pub Date : 2024-10-01DOI: 10.1109/tcyb.2024.3462832
Shuai Cheng, Bin Xin, Qing Wang, Jie Chen, Fang Deng
{"title":"Finite-Time Neuroadaptive Cooperative Control for Nonlinear Multiagent Systems Under Nonaffine Faults and Partially Unknown Control Directions","authors":"Shuai Cheng, Bin Xin, Qing Wang, Jie Chen, Fang Deng","doi":"10.1109/tcyb.2024.3462832","DOIUrl":"https://doi.org/10.1109/tcyb.2024.3462832","url":null,"abstract":"","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"66 1","pages":""},"PeriodicalIF":11.8,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142362898","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}
Pub Date : 2024-10-01DOI: 10.1109/tcyb.2024.3463689
Guangdeng Zong, Hongzhen Xie, Dong Yang, Xudong Zhao, Yang Yi
{"title":"Adaptive Fuzzy Tracking Control for Switched Nonlinear Systems Under FDI Attacks and Input Saturation: A Flexible Transient Performance Approach","authors":"Guangdeng Zong, Hongzhen Xie, Dong Yang, Xudong Zhao, Yang Yi","doi":"10.1109/tcyb.2024.3463689","DOIUrl":"https://doi.org/10.1109/tcyb.2024.3463689","url":null,"abstract":"","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"121 1","pages":""},"PeriodicalIF":11.8,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142362855","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}
Pub Date : 2024-09-27DOI: 10.1109/TCYB.2024.3455760
Le Yang;Ziwei Zheng;Yizeng Han;Shiji Song;Gao Huang;Fan Li
Differentiable architecture search (DARTS) has emerged as a promising technique for effective neural architecture search, and it mainly contains two steps to find the high-performance architecture. First, the DARTS supernet that consists of mixed operations will be optimized via gradient descent. Second, the final architecture will be built by the selected operations that contribute the most to the supernet. Although DARTS improves the efficiency of neural architecture search (NAS), it suffers from the well-known degeneration issue which can lead to deteriorating architectures. Existing works mainly attribute the degeneration issue to the failure of its supernet optimization, while little attention has been paid to the selection method. In this article, we cease to apply the widely-used magnitude-based selection method and propose a novel criterion based on operation strength that estimates the importance of an operation by its effect on the final loss. We show that the degeneration issue can be effectively addressed by using the proposed criterion without any modification of supernet optimization, indicating that the magnitude-based selection method can be a critical reason for the instability of DARTS. The experiments on NAS-Bench-201 and DARTS search spaces show the effectiveness of our method.
{"title":"OStr-DARTS: Differentiable Neural Architecture Search Based on Operation Strength","authors":"Le Yang;Ziwei Zheng;Yizeng Han;Shiji Song;Gao Huang;Fan Li","doi":"10.1109/TCYB.2024.3455760","DOIUrl":"10.1109/TCYB.2024.3455760","url":null,"abstract":"Differentiable architecture search (DARTS) has emerged as a promising technique for effective neural architecture search, and it mainly contains two steps to find the high-performance architecture. First, the DARTS supernet that consists of mixed operations will be optimized via gradient descent. Second, the final architecture will be built by the selected operations that contribute the most to the supernet. Although DARTS improves the efficiency of neural architecture search (NAS), it suffers from the well-known degeneration issue which can lead to deteriorating architectures. Existing works mainly attribute the degeneration issue to the failure of its supernet optimization, while little attention has been paid to the selection method. In this article, we cease to apply the widely-used magnitude-based selection method and propose a novel criterion based on operation strength that estimates the importance of an operation by its effect on the final loss. We show that the degeneration issue can be effectively addressed by using the proposed criterion without any modification of supernet optimization, indicating that the magnitude-based selection method can be a critical reason for the instability of DARTS. The experiments on NAS-Bench-201 and DARTS search spaces show the effectiveness of our method.","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"54 11","pages":"6559-6572"},"PeriodicalIF":9.4,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142328800","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}
Pub Date : 2024-09-27DOI: 10.1109/tcyb.2024.3462500
Lei Ren, Haiteng Wang, Yuanjun Laili
{"title":"Diff-MTS: Temporal-Augmented Conditional Diffusion-Based AIGC for Industrial Time Series Toward the Large Model Era","authors":"Lei Ren, Haiteng Wang, Yuanjun Laili","doi":"10.1109/tcyb.2024.3462500","DOIUrl":"https://doi.org/10.1109/tcyb.2024.3462500","url":null,"abstract":"","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"53 1","pages":""},"PeriodicalIF":11.8,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142328801","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}
The ever-present cyber-attacks have posed a significant challenge to consensus of multiagent systems (MASs), due to their capability of compromising agents. These threats underscore the critical need to design control strategies that can endow MASs with resilience. In this article, we address resilient consensus problems for first- and second-order discrete-time MASs, considering the presence of malicious agents, a dynamic leader, and communication delay. First, a resilient controller is designed for first-order MASs, and sufficient conditions are derived based on existing robust graph concepts to achieve consensus with ultimately bounded error. Next, since the derived error bound grows factorially with the system scale, a novel graph structure and a modified controller are proposed to limit the growth to a linear rate. Building upon the obtained results, an estimator-based control framework is introduced to solve resilient consensus problems for second-order MASs. Finally, comparative simulations and practical experiments based on unmanned ground vehicles and unmanned-aerial-vehicles are conducted to validate the effectiveness and practicability of the proposed control methods.
无处不在的网络攻击对多代理系统（MAS）的共识提出了重大挑战，因为它们有能力破坏代理。这些威胁凸显了设计能够赋予 MAS 弹性的控制策略的迫切需要。在本文中，我们将考虑恶意代理、动态领导者和通信延迟的存在，解决一阶和二阶离散时间 MAS 的弹性共识问题。首先，我们为一阶 MAS 设计了一个弹性控制器，并基于现有的鲁棒图概念推导出充分条件，以实现误差最终受限的共识。接下来，由于推导出的误差约束会随着系统规模的扩大而因数增长，因此提出了一种新颖的图结构和修改后的控制器，以将误差增长限制在线性范围内。在所得结果的基础上，引入了一个基于估算器的控制框架，以解决二阶 MAS 的弹性共识问题。最后，基于无人地面车辆和无人机进行了比较模拟和实际实验，以验证所提控制方法的有效性和实用性。
{"title":"Resilient Consensus for Discrete-Time Multiagent Systems With a Dynamic Leader and Time Delay: Theory and Experiment","authors":"Yue Wang;Liang Han;Xiaoduo Li;Pengkun Hao;Zhang Ren","doi":"10.1109/TCYB.2024.3464490","DOIUrl":"10.1109/TCYB.2024.3464490","url":null,"abstract":"The ever-present cyber-attacks have posed a significant challenge to consensus of multiagent systems (MASs), due to their capability of compromising agents. These threats underscore the critical need to design control strategies that can endow MASs with resilience. In this article, we address resilient consensus problems for first- and second-order discrete-time MASs, considering the presence of malicious agents, a dynamic leader, and communication delay. First, a resilient controller is designed for first-order MASs, and sufficient conditions are derived based on existing robust graph concepts to achieve consensus with ultimately bounded error. Next, since the derived error bound grows factorially with the system scale, a novel graph structure and a modified controller are proposed to limit the growth to a linear rate. Building upon the obtained results, an estimator-based control framework is introduced to solve resilient consensus problems for second-order MASs. Finally, comparative simulations and practical experiments based on unmanned ground vehicles and unmanned-aerial-vehicles are conducted to validate the effectiveness and practicability of the proposed control methods.","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"54 11","pages":"6805-6818"},"PeriodicalIF":9.4,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142321741","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}
In leader-follower multiagent systems (MASs), seeking an efficient scheme to select a set of agents as leaders is important for realizing the expected cooperative performance. In this article, the problem of minimal leader selection is investigated for impulsive general linear MASs with switching topologies. This study focuses on selecting a set of agents as leaders that receive information from a reference signal directly, while minimizing the number of leaders, subject to consensus tracking performance. First, adopting the average dwell time technique and a time-ratio constraint, an explicit criterion for consensus tracking is derived as prepreparation for leader selection. Second, applying the submodular optimization framework, leader selection metrics are established based on the derived criterion. Third, employing the greedy rule, an efficient leader selection scheme is presented according to the established metrics. The scheme comprises two polynomial-time algorithms that return selected leader sets within a logarithmic bound of the optimum. Finally, the effectiveness of the developed leader selection scheme is verified using an illustrative example.
在领导者-追随者多代理系统（MASs）中，寻求一种有效的方案来选择一组代理作为领导者，对于实现预期的合作绩效非常重要。本文研究了具有切换拓扑的冲动型一般线性 MAS 的最小领导者选择问题。本研究的重点是选择一组直接接收参考信号信息的代理作为领导者，同时在保证一致跟踪性能的前提下尽量减少领导者的数量。首先，采用平均停留时间技术和时间比率约束，得出共识跟踪的明确标准，作为选择领导者的前期准备。其次，应用子模态优化框架，根据推导出的标准建立领导者选择指标。第三，运用贪婪规则，根据建立的指标提出了一个高效的领导者选择方案。该方案由两个多项式时间算法组成，所选领导者集的返回值在最优值的对数范围内。最后，通过一个示例验证了所开发的领导者选择方案的有效性。
{"title":"Leader Selection in Impulsive Multiagent Systems With Switching Topologies","authors":"Kaile Chen;Mengqi Xue;Jiahao Huang;Wen Yang;Wei Xing Zheng;Yang Tang","doi":"10.1109/TCYB.2024.3457783","DOIUrl":"10.1109/TCYB.2024.3457783","url":null,"abstract":"In leader-follower multiagent systems (MASs), seeking an efficient scheme to select a set of agents as leaders is important for realizing the expected cooperative performance. In this article, the problem of minimal leader selection is investigated for impulsive general linear MASs with switching topologies. This study focuses on selecting a set of agents as leaders that receive information from a reference signal directly, while minimizing the number of leaders, subject to consensus tracking performance. First, adopting the average dwell time technique and a time-ratio constraint, an explicit criterion for consensus tracking is derived as prepreparation for leader selection. Second, applying the submodular optimization framework, leader selection metrics are established based on the derived criterion. Third, employing the greedy rule, an efficient leader selection scheme is presented according to the established metrics. The scheme comprises two polynomial-time algorithms that return selected leader sets within a logarithmic bound of the optimum. Finally, the effectiveness of the developed leader selection scheme is verified using an illustrative example.","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"54 11","pages":"6384-6396"},"PeriodicalIF":9.4,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142321743","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号