Efficient Delay-Tolerant Particle Filtering
From MaRDI portal
Abstract: This paper proposes a novel framework for delay-tolerant particle filtering that is computationally efficient and has limited memory requirements. Within this framework the informativeness of a delayed (out-of-sequence) measurement (OOSM) is estimated using a lightweight procedure and uninformative measurements are immediately discarded. The framework requires the identification of a threshold that separates informative from uninformative; this threshold selection task is formulated as a constrained optimization problem, where the goal is to minimize tracking error whilst controlling the computational requirements. We develop an algorithm that provides an approximate solution for the optimization problem. Simulation experiments provide an example where the proposed framework processes less than 40% of all OOSMs with only a small reduction in tracking accuracy.
Recommendations
- Particle filter with Markovian packet dropout and time delay
- Particle filter with one-step randomly delayed measurements and unknown latency probability
- Target Tracking With Particle Filters Under Signal Propagation Delays
- Particle filters
- Particle filtering: the need for speed
- Efficient estimation and particle filter for max-stable processes
- Efficient particle filtering for stochastic Korteweg-de Vries equations
- Particle Filtering
- Parallel particle filtering
- scientific article; zbMATH DE number 2044131
Cited in
(2)
This page was built for publication: Efficient Delay-Tolerant Particle Filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573063)
