Skip navigation
Skip navigation

Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach

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

Description

This paper presents new graph-theoretic results appropriate for the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, strongly rooted, and neighbor-shared are defined, and conditions are derived for compositions of sequences of directed graphs to be of these types. The graph of a stochastic matrix is defined, and it is shown that under certain conditions the graph of a Sarymsakov matrix and a rooted graph are one and the same. As an...[Show more]

CollectionsANU Research Publications
Date published: 2008
Type: Journal article
URI: http://hdl.handle.net/1885/39156
Source: Siam Journal on Control and Optimization
DOI: 10.1137/060657005

Download

File Description SizeFormat Image
01_Cao_Reaching_a_Consensus_in_a_2008.pdf289.41 kBAdobe PDF    Request a copy


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

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator