Analysis of selection methods for cost-reference particle filtering with applications to maneuvering target tracking and dynamic optimization

Authors:
Joaquín Míguez
Affiliations:
Departamento de Teoría de la Seòal y Comunicaciones, Universidad Carlos III de Madrid, Avenida de la Universidad 30, 28911 Leganés, Madrid, Spain
Venue:
Digital Signal Processing
Year:
2007

Citing 10
Cited 1

Adaptive filter theory

Adaptive filter theory
Elements of information theory

Elements of information theory
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
On sequential Monte Carlo sampling methods for Bayesian filtering

Statistics and Computing
On Accelerated Random Search

SIAM Journal on Optimization
A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems

Journal of Global Optimization
A new class of particle filters for random dynamic systems with unknown statistics

EURASIP Journal on Applied Signal Processing
A survey of convergence results on particle filtering methods forpractitioners

IEEE Transactions on Signal Processing
Particle filters for positioning, navigation, and tracking

IEEE Transactions on Signal Processing
Resampling algorithms and architectures for distributed particle filters

IEEE Transactions on Signal Processing

Analysis of a sequential Monte Carlo method for optimization in dynamical systems

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cost-reference particle filtering (CRPF) is a recently proposed sequential Monte Carlo (SMC) methodology aimed at estimating the state of a discrete-time dynamic random system. The estimation task is carried out through the dynamic optimization of a user-defined cost function which is not necessarily tied to the statistics of the signals in the system. In this paper, we first revisit the basics of the CRPF methodology, introducing a generalization of the original algorithm that enables the derivation of some common particle filters within the novel framework, as well as a new and simple convergence analysis. Then, we propose and analyze a particle selection algorithm for CRPF that is suitable for implementation with parallel computing devices and, therefore, circumvents the main drawback of the conventional resampling techniques for particle filters. We illustrate the application of the methodology with two examples. The first one is an instance of one class of problems typically addressed using SMC algorithms, namely the tracking of a maneuvering target using a sensor network. The second example is the application of CRPF to solve a dynamic optimization problem.