Optimal measurement budget allocation for Kalman prediction over a finite time horizon by genetic algorithms

EURASIP journal on advances in signal processing

article

Aspeel, Antoine¹  Legay, Axel¹  Jungers, Raphaël M.¹  Macq, Benoit¹ 

[1]ICTEAM Institute, UCLouvain University

关键词: Kalman filtering;    Optimal sampling;    Genetic algorithms;    Budget allocation;   

DOI  :  10.1186/s13634-021-00732-8

来源: SpringerOpen

【 摘 要 】

In this paper, we address the problem of optimal measurement budget allocation to estimate the state of a linear discrete-time dynamical system over a finite horizon. More precisely, our aim is to select the measurement times in order to minimize the variance of the estimation error over a finite horizon. In addition, we investigate the closely related problem of finding a trade-off between number of measurements and signal to noise ratio.First, the optimal measurement budget allocation problem is reduced to a deterministic combinatorial program. Then, we propose a genetic algorithm implementing a count preserving crossover to solve it. On the theoretical side, we provide a one-dimensional analysis that indicates that the benefit of using irregular measurements grows when the system is unstable or when the process noise becomes important. Then, using the duality between estimation and control, we show that the problem of selecting optimal control times for a linear quadratic regulator can be reduced to our initial problem.Finally, numerical implementations demonstrate that using measurement times optimized by our genetic algorithm gives better estimate than regularly spaced measurements. Our method is applied to a discrete version of a continuous-time system and the impact of the discretization time step is studied. It reveals good convergence properties, showing that our method is well suited to both continuous-time and discrete-time setups.

【 授权许可】

CC BY