Dual and reduced-order observer based attack-free protocols for consensus of multi-agent systems with Markovian switching topologies

IF 2.5 3区 计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS
Tian-Yu Gao , Zhao-Yan Li , Bin Zhou
{"title":"Dual and reduced-order observer based attack-free protocols for consensus of multi-agent systems with Markovian switching topologies","authors":"Tian-Yu Gao ,&nbsp;Zhao-Yan Li ,&nbsp;Bin Zhou","doi":"10.1016/j.sysconle.2025.106118","DOIUrl":null,"url":null,"abstract":"<div><div>This paper studies the output feedback consensus problem of linear multi-agent systems with Markovian switching topologies. To avoid reconstructing the Markovian switching topologies during designing the observers or adding the state of the observers to the information exchange loop, dual and reduced-order observer based attack-free consensus protocols are proposed, which only utilizes the relative outputs of neighboring agents. It is shown that, under certain mild conditions, a necessary and sufficient condition for the solvability of the mean square consensus problem is that the union of switching topologies has a spanning tree. Finally, numerical examples are given to illustrate the effectiveness of the proposed approaches.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"202 ","pages":"Article 106118"},"PeriodicalIF":2.5000,"publicationDate":"2025-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems & Control Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167691125001008","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper studies the output feedback consensus problem of linear multi-agent systems with Markovian switching topologies. To avoid reconstructing the Markovian switching topologies during designing the observers or adding the state of the observers to the information exchange loop, dual and reduced-order observer based attack-free consensus protocols are proposed, which only utilizes the relative outputs of neighboring agents. It is shown that, under certain mild conditions, a necessary and sufficient condition for the solvability of the mean square consensus problem is that the union of switching topologies has a spanning tree. Finally, numerical examples are given to illustrate the effectiveness of the proposed approaches.
基于对偶和降阶观测器的马尔可夫交换拓扑多智能体系统一致性无攻击协议
研究了具有马尔可夫切换拓扑的线性多智能体系统的输出反馈一致性问题。为了避免在设计观测器时重构马尔可夫交换拓扑或将观测器的状态添加到信息交换回路中,提出了基于双降阶观测器的无攻击共识协议,该协议仅利用相邻智能体的相对输出。证明了在一定温和条件下,交换拓扑的并存在生成树是均方一致问题可解的充分必要条件。最后,通过数值算例说明了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Systems & Control Letters
Systems & Control Letters 工程技术-运筹学与管理科学
CiteScore
4.60
自引率
3.80%
发文量
144
审稿时长
6 months
期刊介绍: Founded in 1981 by two of the pre-eminent control theorists, Roger Brockett and Jan Willems, Systems & Control Letters is one of the leading journals in the field of control theory. The aim of the journal is to allow dissemination of relatively concise but highly original contributions whose high initial quality enables a relatively rapid review process. All aspects of the fields of systems and control are covered, especially mathematically-oriented and theoretical papers that have a clear relevance to engineering, physical and biological sciences, and even economics. Application-oriented papers with sophisticated and rigorous mathematical elements are also welcome.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信