Scheduling Nonlinear Sensors for Stochastic Process Estimation
Vasileios Tzoumas, Nikolay A. Atanasov, Ali Jadbabaie, George J., Pappas

TL;DR
This paper presents a computationally efficient algorithm for sensor scheduling in stochastic process estimation, achieving near-optimal performance with linear time complexity for nonlinear systems and Gaussian noise.
Contribution
It introduces a novel sensor selection algorithm with provable approximation guarantees applicable to general stochastic processes and nonlinear measurements.
Findings
Algorithm achieves performance within a factor of 1/2 of optimal.
Time complexity is linear in the planning horizon for general cases.
For Gaussian processes, complexity matches that of linear system algorithms.
Abstract
In this paper, we focus on activating only a few sensors, among many available, to estimate the state of a stochastic process of interest. This problem is important in applications such as target tracking and simultaneous localization and mapping (SLAM). It is challenging since it involves stochastic systems whose evolution is largely unknown, sensors with nonlinear measurements, and limited operational resources that constrain the number of active sensors at each measurement step. We provide an algorithm applicable to general stochastic processes and nonlinear measurements whose time complexity is linear in the planning horizon and whose performance is a multiplicative factor 1/2 away from the optimal performance. This is notable because the algorithm offers a significant computational advantage over the polynomial-time algorithm that achieves the best approximation factor 1/e. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
