时变参考信号集上(下)界跟踪的有限时间分布式协议

M. Lippi, Antonio Furchì, A. Marino, A. Gasparri
{"title":"时变参考信号集上(下)界跟踪的有限时间分布式协议","authors":"M. Lippi, Antonio Furchì, A. Marino, A. Gasparri","doi":"10.1109/MED54222.2022.9837239","DOIUrl":null,"url":null,"abstract":"In this paper we address the problem of distributively tracking the upper or lower bound of n time-varying signals in finite-time. In detail, each agent has access to a time-varying exogenous signal, which may encode the evolution of a physical phenomenon. All the agents are required to follow the upper (lower) bound value among such output signals in a distributed fashion. We provide a protocol to solve the above problem in the case of networked agents and undirected communication, together with formal proof of convergence and estimation of an upperbound of the convergence time. We corroborate the protocol via numerical validations in a precision farming setting.","PeriodicalId":354557,"journal":{"name":"2022 30th Mediterranean Conference on Control and Automation (MED)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Finite-Time Distributed Protocol for Tracking the Upper (Lower) Bound For a Set of Time-Varying Reference Signals\",\"authors\":\"M. Lippi, Antonio Furchì, A. Marino, A. Gasparri\",\"doi\":\"10.1109/MED54222.2022.9837239\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we address the problem of distributively tracking the upper or lower bound of n time-varying signals in finite-time. In detail, each agent has access to a time-varying exogenous signal, which may encode the evolution of a physical phenomenon. All the agents are required to follow the upper (lower) bound value among such output signals in a distributed fashion. We provide a protocol to solve the above problem in the case of networked agents and undirected communication, together with formal proof of convergence and estimation of an upperbound of the convergence time. We corroborate the protocol via numerical validations in a precision farming setting.\",\"PeriodicalId\":354557,\"journal\":{\"name\":\"2022 30th Mediterranean Conference on Control and Automation (MED)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 30th Mediterranean Conference on Control and Automation (MED)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MED54222.2022.9837239\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 30th Mediterranean Conference on Control and Automation (MED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MED54222.2022.9837239","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文研究了有限时间内n个时变信号的分布跟踪问题。具体来说,每个主体都可以获得一个时变的外生信号,该信号可以编码物理现象的进化。要求所有代理以分布式方式遵循这些输出信号之间的上(下)界值。我们提供了一个协议来解决在网络代理和无向通信的情况下的上述问题,以及收敛的形式化证明和收敛时间上界的估计。我们通过精确农业设置中的数值验证来证实该协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Finite-Time Distributed Protocol for Tracking the Upper (Lower) Bound For a Set of Time-Varying Reference Signals
In this paper we address the problem of distributively tracking the upper or lower bound of n time-varying signals in finite-time. In detail, each agent has access to a time-varying exogenous signal, which may encode the evolution of a physical phenomenon. All the agents are required to follow the upper (lower) bound value among such output signals in a distributed fashion. We provide a protocol to solve the above problem in the case of networked agents and undirected communication, together with formal proof of convergence and estimation of an upperbound of the convergence time. We corroborate the protocol via numerical validations in a precision farming setting.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信