Skip to content
naulon
Not checkedNot checked for notices yet.

Wrapped Particle Filtering for Angular Data

Guddu Kumar, Paresh Date, Ram Bilas Pachori and 2 more

IEEE Access · 2022

doi:10.1109/access.2022.3200478 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Particle filtering is probably the most widely accepted methodology for general nonlinear filtering applications. The performance of a particle filter critically depends on the choice of proposal distribution. In this paper, we propose using a wrapped normal distribution as a proposal distribution for angular data, <italic>i.e.</italic> data within finite range <inline-formula> <tex-math notation="LaTeX">$(-\pi, \pi]$ </tex-math></inline-formula>. We then use the same method to derive the proposal density for a particle filter, in place of a standard assumed Gaussian density filter such as the unscented Kalman filter. The numerical integrals with respect to wrapped normal distribution are evaluated using Rogers-Szeg&#x0151; quadrature. Compared to using the unscented filter and similar approximate Gaussian filters to produce proposal densities, we show through examples that wrapped normal distribution gives a far better filtering performance when working with angular data. In addition, we demonstrate the trade-off involved in particle filters with local sampling and global sampling (<italic>i.e.</italic> by running a bank of approximate Gaussian filters vs running a single approximate Gaussian filter) with the former yielding a better filtering performance than the latter at the cost of increased computational load.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.