Skip navigation
Skip navigation

Stochastic Lyapunov Analysis for Consensus Algorithms with Noisy Measurements

Huang , Minyi; Manton, Jonathan

Description

This paper studies the coordination and consensus of networked agents in an uncertain environment. We consider a group of agents on an undirected graph with fixed topology, but differing from most existing work, each agent has only noisy measurements of its neighbors' states. Traditional consensus algorithms in general cannot deal with such a scenario. For consensus seeking, we introduce stochastic approximation type algorithms with a decreasing step size. We present a stochastic Lyaponuv...[Show more]

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
URI: http://hdl.handle.net/1885/38677
Source: Proceedings of the 2007 American Control Conference
DOI: 10.1109/ACC.2007.4282791

Download

File Description SizeFormat Image
01_Huang _Stochastic_Lyapunov_Analysis_2007.pdf269.78 kBAdobe PDF    Request a copy


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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator