Asynchronous Distributed Averaging: A Switched System Framework for Average Error Analysis

This paper investigates an expected average error for distributed averaging problems under asynchronous updates. The asynchronism in this context implies no existence of a global clock as well as random characteristics in communication uncertainty such as communication delays and packet drops. Altho...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Lee, Kooktae
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Lee, Kooktae
description This paper investigates an expected average error for distributed averaging problems under asynchronous updates. The asynchronism in this context implies no existence of a global clock as well as random characteristics in communication uncertainty such as communication delays and packet drops. Although some previous works contributed to the design of average consensus protocols to guarantee the convergence to an exact average, these methods may increase computational burdens due to extra works. Sometimes it is thus beneficial to make each agent exchange information asynchronously without modifying the algorithm, which causes randomness in the average value as a trade-off. In this study, an expected average error is analyzed based on the switched system framework, to estimate an upper bound of the asynchronous average compared to the exact one in the expectation sense. Numerical examples are provided to validate the proposed results.
doi_str_mv 10.48550/arxiv.2006.01925
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2006_01925</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2006_01925</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-67245ae2319ec6582e91cde8f3b50db353c7cf29d26743ace3e52df3b95625fc3</originalsourceid><addsrcrecordid>eNotj71uwjAUhb10qKAP0Kl-gaSOnevEbBGFthJSB5i6RI5zA1ZJUl0HaN6-_E1H50dH-hh7TkSc5gDi1dKfP8ZSCB2LxEh4ZN9FGDu3o77rD4G_-TCQrw4D1rw4Itmt77YzXvD1yQ9ud07XYxiw5UuyLZ56-uFNT_cp8gXRxXV2PwYfpuyhsfuAT3edsM1ysZl_RKuv9895sYqsziDSmUzBolSJQachl2gSV2PeqApEXSlQLnONNLXUWaqsQ4Ug63NrQEtonJqwl9vtFa78Jd9aGssLZHmFVP_5jk2v</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Asynchronous Distributed Averaging: A Switched System Framework for Average Error Analysis</title><source>arXiv.org</source><creator>Lee, Kooktae</creator><creatorcontrib>Lee, Kooktae</creatorcontrib><description>This paper investigates an expected average error for distributed averaging problems under asynchronous updates. The asynchronism in this context implies no existence of a global clock as well as random characteristics in communication uncertainty such as communication delays and packet drops. Although some previous works contributed to the design of average consensus protocols to guarantee the convergence to an exact average, these methods may increase computational burdens due to extra works. Sometimes it is thus beneficial to make each agent exchange information asynchronously without modifying the algorithm, which causes randomness in the average value as a trade-off. In this study, an expected average error is analyzed based on the switched system framework, to estimate an upper bound of the asynchronous average compared to the exact one in the expectation sense. Numerical examples are provided to validate the proposed results.</description><identifier>DOI: 10.48550/arxiv.2006.01925</identifier><language>eng</language><subject>Computer Science - Multiagent Systems ; Computer Science - Systems and Control</subject><creationdate>2020-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2006.01925$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2006.01925$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Lee, Kooktae</creatorcontrib><title>Asynchronous Distributed Averaging: A Switched System Framework for Average Error Analysis</title><description>This paper investigates an expected average error for distributed averaging problems under asynchronous updates. The asynchronism in this context implies no existence of a global clock as well as random characteristics in communication uncertainty such as communication delays and packet drops. Although some previous works contributed to the design of average consensus protocols to guarantee the convergence to an exact average, these methods may increase computational burdens due to extra works. Sometimes it is thus beneficial to make each agent exchange information asynchronously without modifying the algorithm, which causes randomness in the average value as a trade-off. In this study, an expected average error is analyzed based on the switched system framework, to estimate an upper bound of the asynchronous average compared to the exact one in the expectation sense. Numerical examples are provided to validate the proposed results.</description><subject>Computer Science - Multiagent Systems</subject><subject>Computer Science - Systems and Control</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71uwjAUhb10qKAP0Kl-gaSOnevEbBGFthJSB5i6RI5zA1ZJUl0HaN6-_E1H50dH-hh7TkSc5gDi1dKfP8ZSCB2LxEh4ZN9FGDu3o77rD4G_-TCQrw4D1rw4Itmt77YzXvD1yQ9ud07XYxiw5UuyLZ56-uFNT_cp8gXRxXV2PwYfpuyhsfuAT3edsM1ysZl_RKuv9895sYqsziDSmUzBolSJQachl2gSV2PeqApEXSlQLnONNLXUWaqsQ4Ug63NrQEtonJqwl9vtFa78Jd9aGssLZHmFVP_5jk2v</recordid><startdate>20200602</startdate><enddate>20200602</enddate><creator>Lee, Kooktae</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20200602</creationdate><title>Asynchronous Distributed Averaging: A Switched System Framework for Average Error Analysis</title><author>Lee, Kooktae</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-67245ae2319ec6582e91cde8f3b50db353c7cf29d26743ace3e52df3b95625fc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Multiagent Systems</topic><topic>Computer Science - Systems and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Lee, Kooktae</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lee, Kooktae</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Asynchronous Distributed Averaging: A Switched System Framework for Average Error Analysis</atitle><date>2020-06-02</date><risdate>2020</risdate><abstract>This paper investigates an expected average error for distributed averaging problems under asynchronous updates. The asynchronism in this context implies no existence of a global clock as well as random characteristics in communication uncertainty such as communication delays and packet drops. Although some previous works contributed to the design of average consensus protocols to guarantee the convergence to an exact average, these methods may increase computational burdens due to extra works. Sometimes it is thus beneficial to make each agent exchange information asynchronously without modifying the algorithm, which causes randomness in the average value as a trade-off. In this study, an expected average error is analyzed based on the switched system framework, to estimate an upper bound of the asynchronous average compared to the exact one in the expectation sense. Numerical examples are provided to validate the proposed results.</abstract><doi>10.48550/arxiv.2006.01925</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2006.01925
ispartof
issn
language eng
recordid cdi_arxiv_primary_2006_01925
source arXiv.org
subjects Computer Science - Multiagent Systems
Computer Science - Systems and Control
title Asynchronous Distributed Averaging: A Switched System Framework for Average Error Analysis
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T22%3A13%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Asynchronous%20Distributed%20Averaging:%20A%20Switched%20System%20Framework%20for%20Average%20Error%20Analysis&rft.au=Lee,%20Kooktae&rft.date=2020-06-02&rft_id=info:doi/10.48550/arxiv.2006.01925&rft_dat=%3Carxiv_GOX%3E2006_01925%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true