Mobile Sensor Path Planning for Kalman Filter Spatiotemporal Estimation
Sensors · 2024-06-08 · 24 (12) · 3727
DOI: 10.3390/s24123727 ↗At a glance
Journal article in Sensors, published online on 2024-06-08. Written by Jiazhong Mei and 2 co-authors. Institution: Department of Applied Mathematics, University of Washington, Seattle, WA 98195, USA. Cited 4 times so far (Crossref); 63 references. The full text is freely available (open access, CC BY 4.0). Funded by: AI Institute in Dynamic Systems, United States Air Force Office of Scientific Research, National Science Foundation AI Institute in Dynamic Systems.
Abstract (original language)
The estimation of spatiotemporal data from limited sensor measurements is a required task across many scientific disciplines. In this paper, we consider the use of mobile sensors for estimating spatiotemporal data via Kalman filtering. The sensor selection problem, which aims to optimize the placement of sensors, leverages innovations in greedy algorithms and low-rank subspace projection to provide model-free, data-driven estimates. Alternatively, Kalman filter estimation balances model-based information and sparsely observed measurements to collectively make better estimation with limited sensors. It is especially important with mobile sensors to utilize historical measurements. We show that mobile sensing along dynamic trajectories can achieve the equivalent performance of a larger number of stationary sensors, with performance gains related to three distinct timescales: (i) the timescale of the spatiotemporal dynamics, (ii) the velocity of the sensors, and (iii) the rate of sampling. Taken together, these timescales strongly influence how well-conditioned the estimation task is. We draw connections between the Kalman filter performance and the observability of the state space model and propose a greedy path planning algorithm based on minimizing the condition number of the observability matrix. This approach has better scalability and computational efficiency compared to previous works. Through a series of examples of increasing complexity, we show that mobile sensing along our paths improves Kalman filter performance in terms of better limiting estimation and faster convergence. Moreover, it is particularly effective for spatiotemporal data that contain spatially localized structures, whose features are captured along dynamic trajectories.
Subjects
Author keywords
Authors and institutions
- Department of Applied Mathematics, University of Washington, Seattle, WA 98195, USA.
- Department of Mechanical Engineering, University of Washington, Seattle, WA 98195, USA.
- Department of Electrical and Computer Engineering, University of Washington, Seattle, WA 98195, USA.
ORCID profiles: Jiazhong Mei, J Nathan Kutz
Funding
- AI Institute in Dynamic Systems
- United States Air Force Office of Scientific Research
- National Science Foundation AI Institute in Dynamic Systems
- Air Force Office of Scientific Research
Cite
APA
Mei, J., Brunton, S. L., & Kutz, J. N. (2024). Mobile Sensor Path Planning for Kalman Filter Spatiotemporal Estimation. Sensors, 24(12), 3727. https://doi.org/10.3390/s24123727
Vancouver
Mei J, Brunton SL, Kutz JN. Mobile Sensor Path Planning for Kalman Filter Spatiotemporal Estimation. Sensors. 2024;24(12):3727. doi:10.3390/s24123727
BibTeX
@article{Mei2024,
author = {Mei, Jiazhong and Brunton, Steven L and Kutz, J Nathan},
title = {Mobile Sensor Path Planning for Kalman Filter Spatiotemporal Estimation},
journal = {Sensors},
year = {2024},
volume = {24},
number = {12},
pages = {3727},
doi = {10.3390/s24123727}
}
EUVIMED