학술논문

Guaranteed Robust Performance of $\mathcal {H}_{\infty }$ Filters With Sparse and Low Precision Sensing
Document Type
Periodical
Source
IEEE Transactions on Automatic Control IEEE Trans. Automat. Contr. Automatic Control, IEEE Transactions on. 69(2):1029-1036 Feb, 2024
Subject
Signal Processing and Analysis
Sensors
Sensor systems
Estimation
Uncertainty
Thermal sensors
Linear systems
Observers
++%24%5Cmathcal+{H}%5F{%5Cinfty+}%24<%2Ftex-math>+<%2Finline-formula>+<%2Fnamed-content>+filtering%22"> $\mathcal {H}_{\infty }$ filtering
greedy algorithm
optimal sensor precision
sparse sensing
Language
ISSN
0018-9286
1558-2523
2334-3303
Abstract
The performance of estimation algorithms depends on the available sensors and their precisions. While higher precisions of sensors provide better estimation accuracy, it may lead to unnecessarily expensive designs and higher operational costs due to the higher costs of high-precision sensing modalities. Also, higher precision can cause interference for other sensors in the environment, such as RADARs, resulting in degradation in the overall system's performance. This article presents a framework for codesigning a sparse sensing network with the least precise sensors and the filter that guarantees the prescribed $\mathcal {H}_{\infty }$ estimation accuracy. Convex optimization problems for minimizing sensor precisions are formulated for continuous and discrete-time linear time-invariant systems, with and without model uncertainties. Different heuristics for determining a sparse sensor set with the least precise sensors are discussed, and their performances are compared using numerical simulations. The application of the proposed framework is demonstrated using numerical examples.