Browse wiki

From MurrayWiki
Jump to: navigation, search
Scheduling for Distributed Sensor Networks with Single Sensor Measurement per Time Step
Abstract Abstract—We examine the problem of distrib
Abstract—We examine the problem of distributed estimation when only one sensor can take a measurement per time step. We solve for the optimal recursive estimation algorithm when the sensor switching schedule is given. We then consider the effect of noise in communication channels. We also investigate the problem of determining an optimal sensor switching strategy. We see that this problem involves searching a tree in general and propose two strategies for pruning the tree to minimize the computation. The first is a sliding window strategy motivated by the Viterbi algorithm, and the second one uses thresholding. The performance of the algorithms is illustrated using numerical examples.
s is illustrated using numerical examples.  +
Authors Timothy Chung, Vijay Gupta, Babak Hassibi, Joel Burdick, Richard M. Murray  +
ID 2003w  +
Source Submitted, 2004 International Conference on Robotics and Automation  +
Tag chu+04-icra  +
Title Scheduling for Distributed Sensor Networks with Single Sensor Measurement per Time Step +
Type Conference Paper  +
Categories Papers
Modification date
This property is a special property in this wiki.
15 May 2016 06:18:29  +
URL
This property is a special property in this wiki.
http://www.cds.caltech.edu/~murray/preprints/chu+04-icra.pdf  +
hide properties that link here 
Scheduling for Distributed Sensor Networks with Single Sensor Measurement per Time Step + Title
 

 

Enter the name of the page to start browsing from.