mlsanityData to 14 Oct 2026

Leveraging arbitrary mobile sensor trajectories with shallow recurrent decoder networks for full-state reconstruction

arXiv 2307.11793 ↗First posted 20 Jul 2023cs.LG math.DScited by 12

Not on the map. Why?

Abstract (arXiv)

Sensing is one of the most fundamental tasks for the monitoring, forecasting and control of complex, spatio-temporal systems. In many applications, a limited number of sensors are mobile and move with the dynamics, with examples including wearable technology, ocean monitoring buoys, and weather balloons. In these dynamic systems (without regions of statistical-independence), the measurement time history encodes a significant amount of information that can be extracted for critical tasks. Most model-free sensing paradigms aim to map current sparse sensor measurements to the high-dimensional state space, ignoring the time-history all together. Using modern deep learning architectures, we show that a sequence-to-vector model, such as an LSTM (long, short-term memory) network, with a decoder network, dynamic trajectory information can be mapped to full state-space estimates. Indeed, we demonstrate that by leveraging mobile sensor trajectories with shallow recurrent decoder networks, we can train the network (i) to accurately reconstruct the full state space using arbitrary dynamical trajectories of the sensors, (ii) the architecture reduces the variance of the mean-square error of the reconstruction error in comparison with immobile sensors, and (iii) the architecture also allows for rapid generalization (parameterization of dynamics) for data outside the training set. Moreover, the path of the sensor can be chosen arbitrarily, provided training data for the spatial trajectory of the sensor is available. The exceptional performance of the network architecture is demonstrated on three applications: turbulent flows, global sea-surface temperature data, and human movement biomechanics.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 12 of its 70 references that are in the map. First posted on arXiv 20 Jul 2023.

Builds on

12 of 70 references.

References · 12

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2021Convex optimizationcited by 2,515
  3. 2014Recurrent Neural Network Regularizationcited by 189
  4. 2017Recent Advances in Recurrent Neural Networkscited by 89
  5. 2017Data-Driven Sparse Sensor Placement for Reconstructioncited by 57
  6. 2015Data Assimilation: A Mathematical Introductioncited by 27
  7. 2021Learning Efficient Navigation in Vortical Flow Fieldscited by 26
  8. 2019Zermelo's problem: Optimal point-to-point navigation in 2D turbulent flows using Reinforcement Learningcited by 21
  9. 2021Optimal control of point-to-point navigation in turbulent time-dependent flows using Reinforcement Learningcited by 6
  10. 2021Finite-Horizon, Energy-Optimal Trajectories in Unsteady Flowscited by 3
  11. 2021Dynamic Compressed Sensing of Unsteady Flows with a Mobile Robotcited by 2
  12. 2022Mobile Sensor Path Planning for Kalman Filter Spatiotemporal Estimationcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 7; 2026: 3.

12 papers.