Scaled Position Consensus of High-Order Uncertain Multiagent Systems Over Switching Directed Graphs

IF 9.4 1区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS IEEE Transactions on Cybernetics Pub Date : 2023-10-12 DOI:10.1109/TCYB.2023.3312696
Jie Mei;Kaixin Tian;Guangfu Ma
{"title":"Scaled Position Consensus of High-Order Uncertain Multiagent Systems Over Switching Directed Graphs","authors":"Jie Mei;Kaixin Tian;Guangfu Ma","doi":"10.1109/TCYB.2023.3312696","DOIUrl":null,"url":null,"abstract":"We investigate the scaled position consensus of high-order multiagent systems with parametric uncertainties over switching directed graphs, where the agents’ position states reach a consensus value with different scales. The intricacy arises from the asymmetry inherent in information interaction. Achieving scaled position consensus in high-order multiagent systems over directed graphs remains a significant challenge, particularly when confronted with the following complex features: 1) uniformly jointly connected switching directed graphs; 2) complex agent dynamics with unknown inertias, unknown control directions, parametric uncertainties, and external disturbances; 3) interacting with each other via only relative scaled position information (without high-order derivatives of relative position); and 4) fully distributed in terms of no shared gains and no global gain dependency. To address these challenges, we propose a distributed adaptive algorithm based on a acrlong MRACon scheme, where a linear high-order reference model is designed for every individual agent employing relative scaled position information as input. A new transformation is proposed which converts the scaled position consensus of high-order linear reference models to that of first-order ones. Theoretical analysis is presented where agents’ positions achieve the scaled consensus over switching directed graphs. Numerical simulations are performed to validate the efficacy of our algorithm and some collective behaviors on traditional consensus, bipartite consensus, and cluster consensus are shown by precisely choosing the scales of the agents.","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"54 5","pages":"3093-3104"},"PeriodicalIF":9.4000,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cybernetics","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10283950/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

We investigate the scaled position consensus of high-order multiagent systems with parametric uncertainties over switching directed graphs, where the agents’ position states reach a consensus value with different scales. The intricacy arises from the asymmetry inherent in information interaction. Achieving scaled position consensus in high-order multiagent systems over directed graphs remains a significant challenge, particularly when confronted with the following complex features: 1) uniformly jointly connected switching directed graphs; 2) complex agent dynamics with unknown inertias, unknown control directions, parametric uncertainties, and external disturbances; 3) interacting with each other via only relative scaled position information (without high-order derivatives of relative position); and 4) fully distributed in terms of no shared gains and no global gain dependency. To address these challenges, we propose a distributed adaptive algorithm based on a acrlong MRACon scheme, where a linear high-order reference model is designed for every individual agent employing relative scaled position information as input. A new transformation is proposed which converts the scaled position consensus of high-order linear reference models to that of first-order ones. Theoretical analysis is presented where agents’ positions achieve the scaled consensus over switching directed graphs. Numerical simulations are performed to validate the efficacy of our algorithm and some collective behaviors on traditional consensus, bipartite consensus, and cluster consensus are shown by precisely choosing the scales of the agents.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
切换有向图上高阶不确定多智能体系统的标度位置一致性。
我们研究了切换有向图上具有参数不确定性的高阶多智能体系统的标度位置一致性,其中智能体的位置状态在不同标度下达到一致值。这种复杂性源于信息交互中固有的不对称性。在有向图上实现高阶多智能体系统的比例位置一致性仍然是一个重大挑战,特别是当面临以下复杂特征时:1)一致联合连接的切换有向图;2) 具有未知惯性、未知控制方向、参数不确定性和外部扰动的复杂智能体动力学;3) 仅通过相对缩放的位置信息相互作用(没有相对位置的高阶导数);以及4)在没有共享收益和没有全局收益依赖性的情况下完全分布。为了解决这些挑战,我们提出了一种基于MRACon方案的分布式自适应算法,其中使用相对缩放的位置信息作为输入,为每个个体设计了一个线性高阶参考模型。提出了一种新的变换,将高阶线性参考模型的标度位置一致性转换为一阶线性参考的标度一致性。理论分析表明,在切换有向图上,主体的位置达到了标度共识。通过数值模拟验证了算法的有效性,并通过精确选择主体的尺度,展示了在传统共识、二分共识和聚类共识上的一些集体行为。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Cybernetics
IEEE Transactions on Cybernetics COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, CYBERNETICS
CiteScore
25.40
自引率
11.00%
发文量
1869
期刊介绍: The scope of the IEEE Transactions on Cybernetics includes computational approaches to the field of cybernetics. Specifically, the transactions welcomes papers on communication and control across machines or machine, human, and organizations. The scope includes such areas as computational intelligence, computer vision, neural networks, genetic algorithms, machine learning, fuzzy systems, cognitive systems, decision making, and robotics, to the extent that they contribute to the theme of cybernetics or demonstrate an application of cybernetics principles.
期刊最新文献
Visual-Inertial-Acoustic Sensor Fusion for Accurate Autonomous Localization of Underwater Vehicles Aeroengine Bearing Time-Varying Skidding Assessment With Prior Knowledge-Embedded Dual Feedback Spatial-Temporal GCN Interval Secure Event-Triggered Mechanism for Load Frequency Control Active Defense Against DoS Attack Bayesian Transfer Filtering Using Pseudo Marginal Measurement Likelihood Granular Computing for Machine Learning: Pursuing New Development Horizons
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1