Fixed-Time Cluster Optimization for Multi-Agent Systems Based on Piecewise Power-Law Design

IF 15.3 1区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Suna Duan;Xinchun Jia;Xiaobo Chi
{"title":"Fixed-Time Cluster Optimization for Multi-Agent Systems Based on Piecewise Power-Law Design","authors":"Suna Duan;Xinchun Jia;Xiaobo Chi","doi":"10.1109/JAS.2024.124230","DOIUrl":null,"url":null,"abstract":"Dear Editor, This letter focuses on the fixed-time (FXT) cluster optimization problem of first-order multi-agent systems (FOMASs) in an undirected network, in which the optimization objective is the sum of the objective functions of all clusters. A novel piecewise power-law control protocol with cooperative-competition relations is proposed. Furthermore, a sufficient condition is obtained to ensure that the FOMASs achieve the cluster consensus within an FXT. Then, on the basis of maintaining the cluster consensus, the agents in each cluster converge to the optimal solution of their objective functions in another FXT.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":null,"pages":null},"PeriodicalIF":15.3000,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10500722","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ieee-Caa Journal of Automatica Sinica","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10500722/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Dear Editor, This letter focuses on the fixed-time (FXT) cluster optimization problem of first-order multi-agent systems (FOMASs) in an undirected network, in which the optimization objective is the sum of the objective functions of all clusters. A novel piecewise power-law control protocol with cooperative-competition relations is proposed. Furthermore, a sufficient condition is obtained to ensure that the FOMASs achieve the cluster consensus within an FXT. Then, on the basis of maintaining the cluster consensus, the agents in each cluster converge to the optimal solution of their objective functions in another FXT.
基于分片幂律设计的多代理系统固定时间集群优化
亲爱的编辑,这封信主要讨论无向网络中一阶多代理系统(FOMAS)的固定时间(FXT)簇优化问题,其中优化目标是所有簇的目标函数之和。本文提出了一种具有合作竞争关系的新型片状幂律控制协议。此外,还获得了确保 FOMAS 在 FXT 内达成簇共识的充分条件。然后,在保持集群共识的基础上,每个集群中的代理在另一个 FXT 中收敛到其目标函数的最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Ieee-Caa Journal of Automatica Sinica
Ieee-Caa Journal of Automatica Sinica Engineering-Control and Systems Engineering
CiteScore
23.50
自引率
11.00%
发文量
880
期刊介绍: The IEEE/CAA Journal of Automatica Sinica is a reputable journal that publishes high-quality papers in English on original theoretical/experimental research and development in the field of automation. The journal covers a wide range of topics including automatic control, artificial intelligence and intelligent control, systems theory and engineering, pattern recognition and intelligent systems, automation engineering and applications, information processing and information systems, network-based automation, robotics, sensing and measurement, and navigation, guidance, and control. Additionally, the journal is abstracted/indexed in several prominent databases including SCIE (Science Citation Index Expanded), EI (Engineering Index), Inspec, Scopus, SCImago, DBLP, CNKI (China National Knowledge Infrastructure), CSCD (Chinese Science Citation Database), and IEEE Xplore.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信