环有向图上的二阶智能体

S. Parsegov, P. Chebotarev
{"title":"环有向图上的二阶智能体","authors":"S. Parsegov, P. Chebotarev","doi":"10.1109/ICSTCC.2018.8540656","DOIUrl":null,"url":null,"abstract":"The paper addresses the problem of consensus Seeking among second-order linear agents interconnected in a specific ring topology. Unlike the existing results in the field dealing with one-directional digraphs arising in various cyclic pursuit algorithms or two-directional graphs, we focus on the case where some arcs in a two-directional ring graph are dropped in a regular fashion. The derived condition for achieving consensus turns out to be independent of the number of agents in a network.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Second-Order Agents on Ring Digraphs\",\"authors\":\"S. Parsegov, P. Chebotarev\",\"doi\":\"10.1109/ICSTCC.2018.8540656\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper addresses the problem of consensus Seeking among second-order linear agents interconnected in a specific ring topology. Unlike the existing results in the field dealing with one-directional digraphs arising in various cyclic pursuit algorithms or two-directional graphs, we focus on the case where some arcs in a two-directional ring graph are dropped in a regular fashion. The derived condition for achieving consensus turns out to be independent of the number of agents in a network.\",\"PeriodicalId\":308427,\"journal\":{\"name\":\"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSTCC.2018.8540656\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTCC.2018.8540656","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文研究了在特定环拓扑结构中相互连接的二阶线性智能体之间的共识寻求问题。与处理各种循环追踪算法或双向图中产生的单向有向图的现有结果不同,我们关注的是双向环图中一些弧以规则方式掉落的情况。所导出的达成共识的条件与网络中智能体的数量无关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Second-Order Agents on Ring Digraphs
The paper addresses the problem of consensus Seeking among second-order linear agents interconnected in a specific ring topology. Unlike the existing results in the field dealing with one-directional digraphs arising in various cyclic pursuit algorithms or two-directional graphs, we focus on the case where some arcs in a two-directional ring graph are dropped in a regular fashion. The derived condition for achieving consensus turns out to be independent of the number of agents in a network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信