{"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}
引用次数: 2
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.