https://murray.cds.caltech.edu/index.php?action=history&feed=atom&title=Sensor_Scheduling_Algorithms_Requiring_Limited_Computation 2026-05-13T03:53:17Z Revision history for this page on the wiki MediaWiki 1.44.2 https://murray.cds.caltech.edu/index.php?title=Sensor_Scheduling_Algorithms_Requiring_Limited_Computation&diff=19909&oldid=prev 2016-05-15T06:18:28Z

<p>htdb2wiki: creating page for 2003y_gchm04-icassp.html</p> <p><b>New page</b></p><div>{{HTDB paper<br /> | authors = Vijay Gupta, Timothy Chung, Babak Hassibi and Richard M. Murray<br /> | title = Sensor Scheduling Algorithms Requiring Limited Computation<br /> | source = Submitted, 2004 International Conference on Acoustics, Speech, and Signal Processing (ICASSP)<br /> | year = 2003<br /> | type = Conference Paper<br /> | funding = AFOSR/info<br /> | url = http://www.cds.caltech.edu/~murray/preprints/gchm04-icassp_s.pdf<br /> | abstract = <br /> In this paper, we consider the scenario where many sensors<br /> co-operate to estimate a process. Only one sensor can take<br /> a measurement at any time step. We wish to come up with<br /> optimal sensor scheduling algorithms. The problem is motivated<br /> by the use of sonar range-finders used by the vehicles<br /> on the Caltech Multi-Vehicle Wireless Testbed. We see that<br /> this problem involves searching a tree in general and propose<br /> and analyze two strategies for pruning the tree to keep<br /> the computation limited. The first is a sliding window strategy<br /> motivated by the Viterbi algorithm, and the second one<br /> uses thresholding. We also study a technique that employs<br /> choosing the sensors randomly from a probability distribution<br /> which can then be optimized. The performance of the<br /> algorithms are illustrated with the help of numerical examples.<br /> | flags = <br /> | tag = gchm04-icassp<br /> | id = 2003y<br /> }}</div>

Murray