Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Optimal measurement selection for Any-time Kalman Filtering with processing constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Moshtagh, N. ; Sci. Syst. Co., Inc., Woburn, MA, USA ; Lingji Chen ; Mehra, R.

In an embedded system with limited processing resources, as the number of tasks grows, they interfere with each other through preemption and blocking while waiting for shared resources such as CPU time and memory. The main task of an Any-Time Kalman Filter (AKF) is real-time state estimation from measurements using available processing resources. Due to limited computational resources, the AKF may have to select only a subset of all the available measurements or use out-of-sequence measurements for processing. This paper addresses the problem of measurement selection needed to implement AKF on systems that can be modeled as double-integrators, such as mobile robots, aircraft, satellites etc. It is shown that a greedy sequential selection algorithm provides the optimal selection of measurements for such systems given the processing constraints.

Published in:

Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on

Date of Conference:

15-18 Dec. 2009