Distributed consensus and linear functional calculation in networks an observability perspective

We study the problem of performing sensor fusion and distributed consensus in networks, where the objective is to calculate some linear function of the initial sensor values at some or all of the sensors. We utilize a linear iteration where, at each time-step, each sensor updates its value to be a w...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the 6th international conference on Information processing in sensor networks s. 99 - 108
Hlavní autori: Sundaram, Shreyas, Hadjicostis, Christoforos N.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: New York, NY, USA ACM 25.04.2007
Edícia:ACM Conferences
Predmet:
Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms
Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms > Algebraic algorithms
Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms > Linear algebra algorithms
Mathematics of computing > Mathematical analysis > Numerical analysis > Computations on matrices
Theory of computation > Design and analysis of algorithms
distributed consensus
networked control
distributed fusion
in-network processing and aggregation
ISBN:9781595936387, 1595936386
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We study the problem of performing sensor fusion and distributed consensus in networks, where the objective is to calculate some linear function of the initial sensor values at some or all of the sensors. We utilize a linear iteration where, at each time-step, each sensor updates its value to be a weighted average of its own previous value and those of its neighbors. We show that this approach can be viewed as a linear dynamical system, with dynamics that are given by the weight matrix for the linear iteration, and with outputs for each sensor that are captured by the subset of the state vector that is measurable by that sensor. We then cast the fusion and consensus problems as that of observing a linear functional of the initial state vector using only local measurements (that are available at each sensor). When the topology of the network is time-invariant, we show that the weight matrix can be chosen so that each sensor can calculate the desired function as a linear combination of its measurements over a finite number of time-steps.
ISBN:9781595936387
1595936386
DOI:10.1145/1236360.1236374