Scheduling Parallel Kalman Filters for Multiple Processes

TL;DR

This paper addresses scheduling multiple Kalman filters observing different processes under constraints where only one filter can observe at a time, proposing novel criteria and algorithms for optimal scheduling.

Contribution

It introduces the PCOL and LCO notions for feasible observation sequences and develops algorithms for scheduling Kalman filters considering these constraints.

Findings

Proposes PCOL and LCO as new criteria for scheduling feasibility.

Develops the Sxy and tree search algorithms for different scenarios.

Validates approaches through analysis and simulation results.

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, 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.