<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
<record>
  <controlfield tag="001">163052</controlfield>
  <controlfield tag="005">20260418110659.0</controlfield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="2">doi</subfield>
    <subfield code="a">10.1016/j.isatra.2025.08.011</subfield>
  </datafield>
  <datafield tag="024" ind1="8" ind2=" ">
    <subfield code="2">sideral</subfield>
    <subfield code="a">145510</subfield>
  </datafield>
  <datafield tag="037" ind1=" " ind2=" ">
    <subfield code="a">ART-2025-145510</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Aldana-López, Rodrigo</subfield>
    <subfield code="u">Universidad de Zaragoza</subfield>
    <subfield code="0">(orcid)0000-0001-6939-6523</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Quasi-exact dynamic average consensus under asynchronous communication and symmetric delays</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2025</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">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.</subfield>
  </datafield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="9">info:eu-repo/grantAgreement/EUR/AEI/TED2021-130224B-I00</subfield>
    <subfield code="9">info:eu-repo/grantAgreement/ES/DGA/T45-23R</subfield>
    <subfield code="9">info:eu-repo/grantAgreement/ES/MICINN-AEI-FEDER/PID2021-124137OB-I00</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="9">info:eu-repo/semantics/closedAccess</subfield>
    <subfield code="a">All rights reserved</subfield>
    <subfield code="u">http://www.europeana.eu/rights/rr-f/</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
    <subfield code="a">info:eu-repo/semantics/article</subfield>
    <subfield code="v">info:eu-repo/semantics/publishedVersion</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Aragüés, Rosario</subfield>
    <subfield code="u">Universidad de Zaragoza</subfield>
    <subfield code="0">(orcid)0000-0001-9458-6257</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Sagüés, Carlos</subfield>
    <subfield code="u">Universidad de Zaragoza</subfield>
    <subfield code="0">(orcid)0000-0002-3032-954X</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="1">5007</subfield>
    <subfield code="2">520</subfield>
    <subfield code="a">Universidad de Zaragoza</subfield>
    <subfield code="b">Dpto. Informát.Ingenie.Sistms.</subfield>
    <subfield code="c">Área Ingen.Sistemas y Automát.</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="g">167 (2025), 503-512</subfield>
    <subfield code="p">ISA trans.</subfield>
    <subfield code="t">ISA TRANSACTIONS</subfield>
    <subfield code="x">0019-0578</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">2782273</subfield>
    <subfield code="u">http://zaguan.unizar.es/record/163052/files/texto_completo.pdf</subfield>
    <subfield code="y">Versión publicada</subfield>
    <subfield code="z">info:eu-repo/date/embargoEnd/2027-08-09</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">2406798</subfield>
    <subfield code="u">http://zaguan.unizar.es/record/163052/files/texto_completo.jpg?subformat=icon</subfield>
    <subfield code="x">icon</subfield>
    <subfield code="y">Versión publicada</subfield>
    <subfield code="z">info:eu-repo/date/embargoEnd/2027-08-09</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zaguan.unizar.es:163052</subfield>
    <subfield code="p">articulos</subfield>
    <subfield code="p">driver</subfield>
  </datafield>
  <datafield tag="951" ind1=" " ind2=" ">
    <subfield code="a">2026-04-18-11:05:08</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">ARTICLE</subfield>
  </datafield>
</record>
</collection>