Rodrigo Aldana-López, Rosario Aragüés, Carlos Sagüés
{"title":"Quasi-exact dynamic average consensus under asynchronous communication and symmetric delays.","authors":"Rodrigo Aldana-López, Rosario Aragüés, Carlos Sagüés","doi":"10.1016/j.isatra.2025.08.011","DOIUrl":null,"url":null,"abstract":"<p><p>This work focuses on the problem of dynamic average consensus, which involves computing the average of a set of time-varying reference signals spread across a network in a distributed fashion. To make this problem more applicable to realistic scenarios, we consider agents in the network that can only communicate at asynchronous discrete-time instants and are subject to time-varying symmetric edge-wise delays. Our proposal is based on high-order sliding modes. It is quasi-exact in the sense that exact convergence to the average signal is obtained when continuous-time communication is available, even if the dynamic average is persistently varying. Additionally, under asynchronous discrete-time communication, our proposal exhibits reduced chattering and improved robustness compared to other approaches. We provide a formal analysis of the algorithm's convergence and present several numerical experiments to verify the advantages of our proposal.</p>","PeriodicalId":94059,"journal":{"name":"ISA transactions","volume":" ","pages":""},"PeriodicalIF":6.5000,"publicationDate":"2025-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISA transactions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/j.isatra.2025.08.011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This work focuses on the problem of dynamic average consensus, which involves computing the average of a set of time-varying reference signals spread across a network in a distributed fashion. To make this problem more applicable to realistic scenarios, we consider agents in the network that can only communicate at asynchronous discrete-time instants and are subject to time-varying symmetric edge-wise delays. Our proposal is based on high-order sliding modes. It is quasi-exact in the sense that exact convergence to the average signal is obtained when continuous-time communication is available, even if the dynamic average is persistently varying. Additionally, under asynchronous discrete-time communication, our proposal exhibits reduced chattering and improved robustness compared to other approaches. We provide a formal analysis of the algorithm's convergence and present several numerical experiments to verify the advantages of our proposal.