Skip navigation
Skip navigation

Agreeing Asynchronously: Announcement of Results

Cao, Ming; Morse, A Stephen; Anderson, Brian

Description

This paper formulates and solves a continuoustime version of the widely studied Vicsek consensus problem in which each agent independently updates its heading at times determined by its own clock. It is not assumed that the agents' clocks are synchronized or that the "event" times between which any one agent updates its heading are evenly spaced. Heading updates need not occur instantaneously. Using the concept of "analytic synchronization" together with several key results concerned with...[Show more]

dc.contributor.authorCao, Ming
dc.contributor.authorMorse, A Stephen
dc.contributor.authorAnderson, Brian
dc.coverage.spatialSan Diego USA
dc.date.accessioned2015-12-08T22:33:15Z
dc.date.createdDecember 13-15 2006
dc.identifier.isbn1424401712
dc.identifier.urihttp://hdl.handle.net/1885/34601
dc.description.abstractThis paper formulates and solves a continuoustime version of the widely studied Vicsek consensus problem in which each agent independently updates its heading at times determined by its own clock. It is not assumed that the agents' clocks are synchronized or that the "event" times between which any one agent updates its heading are evenly spaced. Heading updates need not occur instantaneously. Using the concept of "analytic synchronization" together with several key results concerned with properties of "compositions" of directed graphs, it is shown that the conditions under which a consensus is achieved are essentially the same as those applicable in the synchronous discrete-time case provided the notion of an agent's neighbor between its event times is appropriately defined.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE Inc)
dc.relation.ispartofseriesIEEE Conference on Decision and Control 2006
dc.sourceProceedings of the 45th IEEE Conference on Decision and Control
dc.source.urihttp://www.ieeecss.org/CAB/conferences/cdc2006/index.php
dc.subjectKeywords: Directed graphs; Heading updates; Synchronous discrete-time case; Vicsek consensus problem; Clocks; Graph theory; Problem solving; Synchronization; Continuous time systems
dc.titleAgreeing Asynchronously: Announcement of Results
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2006
local.identifier.absfor080503 - Networking and Communications
local.identifier.absfor010203 - Calculus of Variations, Systems Theory and Control Theory
local.identifier.ariespublicationu3357961xPUB115
local.type.statusPublished Version
local.contributor.affiliationCao, Ming, Yale University
local.contributor.affiliationMorse, A Stephen, Yale University
local.contributor.affiliationAnderson, Brian, College of Engineering and Computer Science, ANU
local.description.embargo2037-12-31
local.bibliographicCitation.startpage4301
local.bibliographicCitation.lastpage4306
dc.date.updated2015-12-08T09:34:14Z
local.identifier.scopusID2-s2.0-39649091407
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Cao_Agreeing_Asynchronously:_2006.pdf168.78 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator