Scheduling parallel Kalman filters for multiple processes

Authors:
Zhiyun Lin;Chen Wang
Affiliations:
Asus Intelligent Systems Lab, College of Electrical Engineering, Zhejiang University, 38 Zheda Road, Hangzhou, 310027, PR China and School of Electrical Engineering and Computer Science, Universit ...;Asus Intelligent Systems Lab, College of Electrical Engineering, Zhejiang University, 38 Zheda Road, Hangzhou, 310027, PR China
Venue:
Automatica (Journal of IFAC)
Year:
2013

Citing 4
Cited 0

General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction

IEEE Transactions on Computers
Sensor selection via convex optimization

IEEE Transactions on Signal Processing
Sensor selection strategies for state estimation in energy constrained wireless sensor networks

Automatica (Journal of IFAC)
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage

Automatica (Journal of IFAC)

Quantified Score

Hi-index	22.14

Visualization

Abstract

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, the threshold method and the 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.