Optimal Estimation on the Graph Cycle Space
- 22 February 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 59 (6) , 2834-2846
Abstract
This paper addresses the problem of estimating the states of a group of agents from noisy measurements of pairwise differences between agents' states. The agents can be viewed as nodes in a graph and the relative measurements between agents as the graph's edges. We propose a new distributed algorithm that exploits the existence of cycles in the graph to compute the best linear state estimates. For large graphs, the new algorithm significantly reduces the total number of message exchanges that are needed to obtain an optimal estimate. We show that the new algorithm is guaranteed to converge for planar graphs and provide explicit formulas for its convergence rate for regular lattices.Keywords
This publication has 21 references indexed in Scilit:
- Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization2010
- Distributed Kalman filtering for sensor networks2007
- Algorithms for Sensor and Ad Hoc NetworksLecture Notes in Computer Science, 2007
- Approximate distributed kalman filtering in sensor networks with quantifiable performance2005
- Joint sensor registration and track-to-track fusion for distributed trackersIEEE Transactions on Aerospace and Electronic Systems, 2004
- Performance limits of track-to-track fusion versus centralized estimation: theory and applicationIEEE Transactions on Aerospace and Electronic Systems, 2003
- Numerical and Analytical Methods for Scientists and Engineers, Using Mathematica2003
- Collective localization: a distributed Kalman filter approach to localization of groups of mobile robots2002
- Matrix Analysis1985
- A structural characterization of planar combinatorial graphsDuke Mathematical Journal, 1937