Scheduling Parallel Kalman Filters for Multiple Processes

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, 11 figures

Scientific paper

In this paper, we investigate the problem of scheduling parallel Kalman filters for multiple processes, where each process is observed by a Kalman filter and at each time step only one Kalman filter could obtain observation due to practical constraints. To solve the problem, two novel notions, permissible consecutive observation loss (PCOL) and least consecutive observation (LCO), are introduced as criteria to describe feasible observation sequences for a process ensuring desired estimation qualities. Then two methods, namely, threshold method and periodic method, are proposed to calculate PCOL and LCO for each process. Based on the derived PCOL and LCO requirements, we develop two algorithms that are applicable to different situations: Sxy algorithm from the pinwheel problem for the case of LCO = 1 and tree search algorithm for general cases. Also, to reduce the computational complexity of tree search algorithm, several useful pruning conditions are obtained. Both rigorous analysis and simulation results are provided to validate the approaches.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Scheduling Parallel Kalman Filters for Multiple Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scheduling Parallel Kalman Filters for Multiple Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling Parallel Kalman Filters for Multiple Processes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-596950

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.