Clear and Concise Particle Filter Tutorial with Python Implementation- Part 1: Problem Formulation – Fusion of Engineering, Control, Coding, Machine Learning, and Science

In this estimation, control theory, machine learning, signal processing, and data science tutorial, we provide a clear and concise explanation of a particle filter algorithm. We focus on the problem of using the particle filter algorithm for state estimation of dynamical systems. Besides providing a detailed explanation of particle filters, we also explain how to implement the particle filter algorithm from scratch in Python. Due to the objective complexity of the particle filters, we split the tutorial into three parts:

Part 1. You are currently reading Part I. In this tutorial part, we define the particle filter estimation problem. We explain what is the main goal of particle filters and what particle filers are actually computing or better to say, estimating. We also clearly explain the concepts of state transition probability (state transition probability density function), measurement probability (measurement probability density function), posterior distribution (posterior probability density function), etc.
Part 2: In the second tutorial part whose link is given here, we present the particle filter algorithm.
Part 3: In the third tutorial part whose link is given here, we explain how to implement the particle filter in Python from scratch.

These tutorials are specially designed for students who are not experts in statistics and who are not experts in control theory. We thoroughly explain all the used statistics concepts. Nowadays, there is a trend not to thoroughly study theoretical concepts and quickly jump to Python scripts implementing algorithms, without first properly understanding the theoretical background of algorithms. If you follow such an approach, you will never be able to understand particle filters, and you will not even be able to understand the Python implementation of particle filters. To properly understand particle filters, you need to first properly understand important concepts from dynamical system theory, probability theory, and statistics. These concepts are thoroughly explained in this tutorial. Consequently, reserve some time and stay focused while reading this tutorial. Do not immediately jump to the second or third parts without properly understanding the material presented in this tutorial.

That is, THIS TUTORIAL IS NOT FOR STUDENTS WHO EASILY GIVE UP. PROPER UNDERSTANDING OF PARTICLE FILTERS REQUIRES EFFORT FROM THE STUDENT’S SIDE.

In this tutorial:

We explain what are state-space models.
We explain what are the process disturbance and measurement noise of state-space models.
We explain what is a transition state probability of a state-space model.
We explain what is a measurement probability of a state-space model.
We explain what is a Markov process.
We explain the classical state estimation problems, such as recursive and batch state estimation problems.
We explain the main difference between particle filter estimation problems and classical estimation problems.
We explain what is a posterior distribution in particle filter estimation problems.
We explain what are particles in particle filter algorithms.
We explain what are weights and state-space samples in particle filter algorithms.
We provide an intuitive explanation of the approximation of posterior distribution by using discrete probability involving particles.
We define the problem of estimating the posterior distribution by using particle filters.

The YouTube tutorial accompanying this tutorial is given below.

By the end of this tutorial, you will be able to understand these two important graphs that illustrate the particle filter problem formulation.

Also, by going through all 3 tutorial parts, you will be able to simulate a particle filter shown in the video below.

State Estimation By Using Particle Filters – Problem Formulation

First, we explain the concept of a state-space model of a dynamical system. Then, we introduce statistical distributions that are related to the state-space model. Finally, we define the state estimation problem for particle filters.

State-Space Models

First, we need to define what is a model of a dynamical system. In a fairly general form, models of dynamical systems are represented by the state and output equations:

(1) $\begin{align*}\mathbf{x}_{k}& =\mathbf{f}(\mathbf{x}_{k-1},\mathbf{u}_{k-1},\mathbf{w}_{k-1}) \\\mathbf{y}_{k}&= \mathbf{g}(\mathbf{x}_{k},\mathbf{v}_{k})\end{align*}$

where $\mathbf{x}_{k}\in \mathbb{R}^{n}$ is the state vector at the (discrete) time step $k$ , $\mathbf{u}_{k-1}\in \mathbb{R}^{m_{1}}$ is the control input vector at the time step $k-1$ , $\mathbf{w}_{k-1}\in \mathbb{R}^{m_{2}}$ is the process disturbance vector (process noise vector) at the time step $k-1$ , $\mathbf{y}_{k}\in \mathbb{R}^{r}$ is the observed output vector at the time step $k$ , and $\mathbf{v}_{k}\in \mathbb{R}^{r}$ is the measurement noise vector at the discrete time step $k$ . In the most general case, the functions $\mathbf{f}(\cdot)$ and $\mathbf{g}(\cdot)$ are nonlinear functions.

It is always important to keep in mind the following facts when dealing with state-space models of dynamical systems given by (1).

The state of the system $\mathbf{x}_{k}$ is usually not completely observable. We can only observe or sense the output of the system denoted by $\mathbf{y}_{k}$ . The main purpose of state estimators is to estimate the state of the system $\mathbf{x}_{k}$ by using the measurements of $\mathbf{y}_{k}$ .
The vector $\mathbf{w}_{k-1}$ is the process disturbance vector. This vector is also called the process noise vector. The exact value of this vector is usually not known (unless we use a method to estimate its value). However, we can model the statistics of this vector. For example, we can model or estimate the mean and covariance matrix of the distribution describing the statistics of this vector. In practice, this vector can for example mathematically model stochastic state disturbances affecting the dynamics. Some researchers use this vector to take into account model uncertainties. We will talk more about the statistics of this vector in the next subsection of this tutorial.
The vector $\mathbf{v}_{k}$ is the measurement noise vector. In practice, the measurement process or sensors introduce noise in the observed variables. This vector is used to mathematically model the sensor or measurement process noise. Similar to the process disturbance vector, we do not know the exact value of the measurement noise vector. Instead, we can either model or estimate the statistical description of this vector. For example, we can model or estimate the mean and the covariance matrix of the statistical distribution of this vector. We will talk more about the statistics of this vector in the next subsection of this tutorial.
The vector $\mathbf{u}_{k-1}$ is the control input vector. We assume that the control input vector is perfectly known. This is because the control algorithm computes the numerical value of the control input vector. Here, there is an additional complication that we will simply ignore in this tutorial. Namely, the control input vector $\mathbf{u}_{k-1}$ is computed by using the information from states and outputs at the past time steps. That is, this input is not independent of the statistics of the past states and outputs. This fact creates additional complications when deriving the estimation algorithms and when analyzing their behavior. For simplicity, in this tutorial, we completely ignore this fact.

For clarity and not to blur the main ideas of particle filters with too many details of complex nonlinear functions, in this tutorial and other parts of the tutorial series, we assume that the model (1) is linear and that it has the following form

(2) $\begin{align*}\mathbf{x}_{k}& =A\mathbf{x}_{k-1}+B\mathbf{u}_{k-1}+\mathbf{w}_{k-1} \\\mathbf{y}_{k}& =C\mathbf{x}_{k}+\mathbf{v}_{k}\end{align*}$

where $A$ , $B$ , and $C$ are state, input, and output system matrices. Everything explained in this tutorial can be generalized to a broad class of nonlinear systems.

Statistics and State Space Models

Here, we explain the statistics of random vectors in the state-space model (2). The proper understanding of the statistics of these vectors is important for the proper understanding and implementation of particle filters. Here, for clarity, we repeat the state-space model description:

(3) $\begin{align*}\mathbf{x}_{k}& =A\mathbf{x}_{k-1}+B\mathbf{u}_{k-1}+\mathbf{w}_{k-1} \\\mathbf{y}_{k}& =C\mathbf{x}_{k}+\mathbf{v}_{k}\end{align*}$

Here, for simplicity and presentation clarity, we assume that

The process disturbance vector $\mathbf{w}_{k}$ is a Gaussian random vector. That is, the vector $\mathbf{w}_{k}$ is distributed according to the Gaussian distribution which is also known as the normal distribution. We assume that the mean of $\mathbf{w}_{k}$ is zero and that the covariance matrix is $Q$ . In the general case, the mathematical notation for Gaussian random vectors is

(4) $\begin{align*}\mathbf{w}_{k} \sim \mathcal{N}(0, Q) \end{align*}$

where this notation means that the vector $\mathbf{w}_{k}$ is distributed according to the normal distribution with the mean of $0$ and the covariance matrix of $Q$ . In the general case, a vector with the mean of $\mu$ and the covariance matrix of $C_{m}$ is said to be distributed according to $\mathcal{N}(\mu, C_{m})$ . That is, the first entry in the notation $\mathcal{N}(\cdot ,\cdot)$ is the mean of the vector, and the second entry is the covariance matrix.
The measurement noise vector $\mathbf{v}_{k}$ is a Gaussian random vector. We assume that the mean of $\mathbf{v}_{k}$ is zero and that the covariance matrix is $R$ . That is,

(5) $\begin{align*}\mathbf{v}_{k} \sim \mathcal{N}(0, R) \end{align*}$

We introduced these assumptions to simplify the explanation of particle filters. However, particle filters can be used when random vectors have non-Gaussian probability distributions.

In our previous tutorial given here, we explained how to simulate the stochastic state-space model (3) in Python. It is a good idea to go over that tutorial in order to get yourself familiar with the simulation of random state space models. The simulated state-space trajectory is given below.

Figure 1: Simulated state-space trajectory of a stochastic state-space model. The tutorial on how to perform this simulation is given here.

In Fig. 1 above, at every discrete-time step, we generate a random sample of the process disturbance vector $\mathbf{w}_{k-1}$ from the normal distribution. If we would repeat the simulation from the same initial condition represented by the red circle, we would obtain a different state-space trajectory. This is the direct consequence of the stochastic nature of the state-space model.

Here is very important to properly understand the following. In (3), since the vector $\mathbf{w}_{k-1}$ is random, for known values of $\mathbf{x}_{k-1}$ and $\mathbf{u}_{k-1}$ , the vector $\mathbf{x}_{k}$ is also random! That is, the randomness of the process disturbance vector induces a probability distribution of $\mathbf{x}_{k}$ . This probability is called the state transition probability. Other names for this probability are next-state probability or transition probability. The state transition distribution plays a very important role in particle filters. The probability density function of the state transition probability is denoted by

(6) $\begin{align*}p(\mathbf{x}_{k}|\mathbf{x}_{k-1},\mathbf{u}_{k-1})\end{align*}$

This is a probability density function of a conditional probability. That is, this is a probability density function of a probability of $\mathbf{x}_{k}$ under the assumption that the values of $\mathbf{x}_{k-1}$ and $\mathbf{u}_{k-1}$ are known and fixed.

Now, the main question is: What is the mathematical form of the state transition probability? Since the vector $\mathbf{w}_{k-1}$ in the state equation of (3) is normally distributed, and since the state equation is linear, we conclude that the state transition probability belongs to the class of normal distributions. The mean of this distribution is computed from the state equation and is equal to

(7) $\begin{align*}A\mathbf{x}_{k-1}+B\mathbf{u}_{k-1}\end{align*}$

The covariance matrix is equal to the covariance of $\mathbf{w}_{k}$ . That is, the covariance of the state transition distribution is $Q$ . From this, we conclude that the state transition distribution is a normal distribution with the mean of $A\mathbf{x}_{k-1}+B\mathbf{u}_{k-1}$ and with the covariance matrix of $Q$ . The mathematical form of the state transition probability density function is

(8) $\begin{align*}& p(\mathbf{x}_{k}|\mathbf{x}_{k-1},\mathbf{u}_{k-1})= \\ &= (2\pi)^{-\frac{n}{2}}\det (Q)^{-\frac{1}{2}}e^{-\frac{1}{2}(\mathbf{x}_{k}-A\mathbf{x}_{k-1}-B\mathbf{u}_{k-1})^{T}Q^{-1}(\mathbf{x}_{k}-A\mathbf{x}_{k-1}-B\mathbf{u}_{k-1})}\end{align*}$

where $n$ is the state dimension.

On the other hand, since the measurement vector $\mathbf{v}_{k}$ is a random vector, the output measurement vector $\mathbf{y}_{k}$ is a random vector. The probability of $\mathbf{y}_{k}$ is called the measurement probability. The measurement distribution also plays a very important role in particle filters. The probability density function of the measurement probability is denoted by

(9) $\begin{align*}p(\mathbf{y}_{k}|\mathbf{x}_{k})\end{align*}$

This is a probability density function of the conditional probability that is derived under the assumption that the value of $\mathbf{x}_{k}$ is known and fixed. Now, the main question is: “What is the mathematical form of the measurement probability?” Since the output equation of (2) is linear and the vector $\mathbf{v}_{k}$ is distributed according to the normal distribution, we conclude that the measurement probability belongs to the class of normal distributions. The mean of this distribution is $C\mathbf{x}_{k}$ and the covariance is $R$ .

Consequently, we conclude

(10) $\begin{align*}p(\mathbf{y}_{k}|\mathbf{x}_{k})=(2\pi)^{-\frac{r}{2}}\det (R)^{-\frac{1}{2}}e^{-\frac{1}{2}(\mathbf{y}_{k}-C\mathbf{x}_{k})^{T}R^{-1}(\mathbf{y}_{k}-C\mathbf{x}_{k})}\end{align*}$

where $r$ is the dimension of the output vector.

Here, we need to explain an additional concept that you will need to understand in order to understand the derivation of the particle filter that we will present in the next tutorial. Namely, often in estimation and statistics literature, you will encounter the term “Markov process” or a “Markov chain”. Loosely speaking, a stochastic process is Markov if the state probability at the current time step depends only on the state (and known constants) from the previous time step. This means that the state sequence:

(11) $\begin{align*}\mathbf{x}_{0},\mathbf{x}_{1},\mathbf{x}_{2},\mathbf{x}_{3},\ldots,\mathbf{x}_{k-1},\mathbf{x}_{k},\mathbf{x}_{k+1},\ldots\end{align*}$

is generated such that the probability of moving from the previous state $\mathbf{x}_{k-1}$ to the current state $\mathbf{x}_{k}$ only depends on the previous state $\mathbf{x}_{k-1}$ . That is, the transition probability of a Markov process does not depend on the past states $\mathbf{x}_{k-2},\mathbf{x}_{k-3},\ldots,\mathbf{x}_{0}$ . From the mathematical point of view, this means that the probability density function of a Markov process must satisfy

(12) $\begin{align*}p(\mathbf{x}_{k}|\mathbf{x}_{k-1},\mathbf{x}_{k-2},\mathbf{x}_{k-3},\ldots, \mathbf{x}_{0})=p(\mathbf{x}_{k}|\mathbf{x}_{k-1})\end{align*}$

However, since an output equation participates in a state-space model description, for a state-space model to be a Markov state-space model, we also need an additional requirement. This requirement is that the output probability at the current time step depends only on the state (and known constants) at the current time step. This means that the output probability density function must satisfy

(13) $\begin{align*}p(\mathbf{y}_{k}|\mathbf{x}_{k},\mathbf{x}_{k-1},\mathbf{x}_{k-2},\ldots, \mathbf{x}_{0})=p(\mathbf{y}_{k}|\mathbf{x}_{k})\end{align*}$

Obviously, the linear state-space model (3) is a Markov state-space model.

State Estimation Using Particle Filters – Problem Formulation

Here again, for presentation clarity, we repeat the state-space model

(14) $\begin{align*}\mathbf{x}_{k}& =A\mathbf{x}_{k-1}+B\mathbf{u}_{k-1}+\mathbf{w}_{k-1} \\\mathbf{y}_{k}& =C\mathbf{x}_{k}+\mathbf{v}_{k}\end{align*}$

The standard notation for the state estimate at the time step $k$ is $\hat{\mathbf{x}}_{k}$ . That is, we use the so-called “hat” notation for state estimates.

To be able to understand the state estimation problem for particle filters, one first needs to understand the classical state estimation problem. The classical state estimation problem is to estimate the state at the current time step $k$ by using

State-space model of the system (14).
Past state estimates up to and NOT including the time step $k$ : $\hat{\mathbf{x}}_{0}$ , $\hat{\mathbf{x}}_{1}$ , $\hat{\mathbf{x}}_{2}$ , $\ldots$ , $\hat{\mathbf{x}}_{k-1}$ .
Past observed outputs up to AND including the time step $k$ : $\mathbf{y}_{0}$ , $\mathbf{y}_{1}$ , $\mathbf{y}_{2}$ , $\ldots$ , $\mathbf{y}_{k}$ .
Past control inputs up to and NOT including the time step $k$ : $\mathbf{u}_{0}$ , $\mathbf{u}_{1}$ , $\mathbf{u}_{2}$ , $\ldots$ , $\mathbf{u}_{k-1}$ .

That is, the classical state estimation problem is to compute the state estimate $\hat{\mathbf{x}}_{k}$ by incorporating all available information up to the time step $k$ .

Generally speaking, the classical state estimation problem can be solved by using three approaches. The first approach is to use the batch mathematical formulation, where the state is directly estimated by solving an optimization problem involving a sequence of past input and output data. The most basic estimator that uses this idea is an open-loop least-squares observer which we explained in our previous tutorial:

Easy Introduction to Observability and Open-loop Observers with MATLAB Implementation

The second approach is to recursively (sequentially or iteratively) estimate the state at the time step $k$ by using the past state estimate and past input information from the previous time step $k-1$ , as well as the output at the time step $k$ . The most popular recursive estimators are the Luenberger observer and Kalman filter. We covered these recursive estimators in our previous tutorials:

The third approach is to combine the first and second approaches. The third approach is called moving horizon estimation. We will cover the moving horizon estimation approach in our future tutorials.

Most of the above-mentioned estimation approaches produce a single estimate of the state vector. That is, they aim at directly computing $\hat{\mathbf{x}}_{k}$ . Also, under the assumption that the process and measurement noise are Gaussian and under the assumption that the dynamics is linear, we can use these approaches to extract the covariance matrix of the estimation error and some other useful Gaussian statistics that can help us to evaluate and quantify the estimation uncertainty, and statistical properties of the estimate $\hat{\mathbf{x}}_{k}$ . However, when the measurement and process noise are not Gaussian and when the dynamics is not linear it becomes challenging to extract statistical information about the estimate and to quantify the estimation uncertainty.

On the other hand, particle filters use a completely different estimation paradigm.

Instead of mainly being focused on computing a single state estimate, particle filters aim at estimating a probability distribution or a probability density function of the state $\mathbf{x}_{k}$ conditioned on the output observations $\mathbf{y}_{0},\mathbf{y}_{1},\mathbf{y}_{2},\ldots,\mathbf{y}_{k}$ and on past control inputs $\mathbf{u}_{0},\mathbf{u}_{1},\mathbf{u}_{2},\ldots,\mathbf{u}_{k-1}$ .

By using the Bayesian estimation terminology, this distribution is called the posterior distribution or posterior probability. The probability density function of the posterior probability is denoted by

(15) $\begin{align*}p(\mathbf{x}_{k}|\mathbf{y}_{0:k},\mathbf{u}_{0:k-1})\end{align*}$

where $\mathbf{y}_{0:k}$ and $\mathbf{u}_{0:k-1}$ denote the sets of inputs and outputs

(16) $\begin{align*}\mathbf{y}_{0:k} & =\{\mathbf{y}_{0},\mathbf{y}_{1},\mathbf{y}_{2},\ldots,\mathbf{y}_{k} \} \\\mathbf{u}_{0:k-1} & =\{\mathbf{u}_{0},\mathbf{u}_{1},\mathbf{u}_{2},\ldots,\mathbf{u}_{k-1} \} \\\end{align*}$

In robotics literature, the posterior probability is also called the belief distribution. Also, some researchers call the posterior density as the filtering density. The vertical bar in the notation for the posterior probability density function (15) means that this posterior is computed by using the information available in the output $\mathbf{y}_{0:k}$ and input $\mathbf{u}_{0:k-1}$ time series.

The figure below shows a simulated state-space trajectory of a second-order system, and a possible posterior distribution at the time step $k$ .

Figure 2: A state-space trajectory of a stochastic state-space model and a possible posterior distribution of the state $\mathbf{x}_{k}$

In Fig. 2 above, the posterior distribution is represented by the contour plot. The colors represent the values of the probability density function. The brighter the color is, the higher the value of the probability density function of the posterior distribution is.

The posterior probability encapsulates the complete statistical information about the posterior state. The knowledge of the posterior probability enables us to accurately compute important statistical quantities related to our estimate, such as the mean (which can serve as a form of estimate), covariance matrix, higher-order moments, mode, confidence intervals, etc. We can also formulate an estimate as some other statistical measure that is computed on the basis of the posterior probability density function. That is, the complete solution to the state estimation problem is the posterior probability or posterior probability density function.

Motivated by this, a particle filter estimation algorithm aims at reconstructing or estimating the posterior probability density function or posterior probability of state.

That is, in sharp contrast to the classical estimation algorithms that are mainly focused on computing a single state estimate (and possibly moments of distributions related to the estimation problem, however, this is often only feasible for normal distributions), the particle filters aim at reconstructing or estimating the complete posterior probability density of the state. This is very important to understand!

The output of the particle filter is a discrete approximation of the posterior probability density function. The output is a set of particles approximating the distribution. Let us now explain what are the particles in particle filters.

Generally speaking, a particle is defined by the state $\mathbf{x}_{k}^{(i)}$ (also known as the state sample) and the associated weight (also known as the importance weight) that is usually denoted by $w^{(i)}_{k}$ . The particle is denoted by $(\mathbf{x}_{k}^{(i)},w^{(i)}_{k})$ . The set of particles is denoted by

(17) $\begin{align*}\{(\mathbf{x}_{k}^{(i)},w^{(i)}_{k}) | i=1,2,3,\ldots, N\}\end{align*}$

The weights are normalized, such that $\sum_{i=1}^{N}w^{(i)}_{k}=1$ . Loosely speaking, the weights tell us how important each particle or point (sample point) is. By knowing the weights $w^{(i)}_{k}$ , and state samples $\mathbf{x}_{k}^{(i)}$ , we can approximate the posterior distribution as follows

(18) $\begin{align*}p(\mathbf{x}_{k}|\mathbf{y}_{0:k},\mathbf{u}_{0:k-1}) \approx \sum_{i=1}^{N}w^{(i)}_{k} \delta(\mathbf{x}_{k}- \mathbf{x}_{k}^{(i)})\end{align*}$

where $\delta(\mathbf{x}_{k}- \mathbf{x}_{k}^{(i)})$ is the symbol for the Dirac delta function. The Dirac delta function is shifted and centered at the sample $\mathbf{x}_{k}^{(i)}$ .

In probability theory, the Dirac delta function is used to represent a distribution of discrete variables by using the probability density function of the continuous variables. That is, the Dirac delta function is used to extend the definition of the probability density function for discrete random variables. This is very important to understand. For example, let us assume that we have a discrete set of values (points) that some random variable $z$ can take: $z^{(1)},z^{(2)},\ldots, z^{(N)}$ . Let the probabilities at these points be $\pi^{(1)},\pi^{(2)},\ldots, \pi^{(N)}$ . The set of points, and probabilities, define a probability mass function $P_{z}$ , such that $P_{z}(z^{(i)})=\pi^{(i)}$ , $i=1,2,3,\ldots,N$ . Then, the probability density function is defined by

(19) $\begin{align*}f_{z}(z)=\sum_{i=1}^{N}P_{z}(z^{(i)})\delta(z-z^{(i)})=\sum_{i=1}^{N}\pi^{(i)}\delta(z-z^{(i)})\end{align*}$

By using this probability theory fact, we can interpret the weights $w^{(i)}_{k}$ in (18) as the probabilities at the points $\mathbf{x}_{k}^{(i)},$ of the discrete distribution approximating the posterior distribution. If you want to know more about the Dirac delta function and its use in probability theory and statistics, you can read this tutorial and this tutorial.

For example, let us consider a simple case. Let us assume that the samples are scalar (states are scalars), and let us assume that we only have $4$ particles: $(x_{k}^{(1)}=2.3, w_{k}^{(1)}=0.2)$ , $(x_{k}^{(2)}=3.1, w_{k}^{(2)}=0.6)$ , $(x_{k}^{(3)}=5.1, w_{k}^{(3)}=0.1)$ , and $(x_{k}^{(4)}=4.9, w_{k}^{(4)}=0.2)$ . For example, if weights are interpreted as probabilities of a discrete distribution, we have the probability of $0.6$ of the state $x_{k}$ being equal to $x_{k}=x_{k}^{(2)}$ , that is, $x_{k}^{(2)}=3.1$ .

Next, let us consider another example, where the state is two-dimensional. The figure shown below shows the possible particles for the 2D state-space trajectory (see also the prior distribution shown in Fig. 2.). This trajectory is generated in Python by simulating the dynamics of a 2D dynamical system. The tutorial is given here.

Figure 3: Illustration of the particles in 2D state-space.

In the figure above, the weight value is represented by the radius of the light blue circles. The larger the value of the weight is, the larger the radius of the circle is. The particle $(\mathbf{x}_{k}^{(4)},w_{k}^{4})$ is closest to the true state, and consequently, it has the largest radius.

Generally, speaking the knowledge of the particles

(20) $\begin{align*}\{(\mathbf{x}_{k}^{(i)},w^{(i)}_{k}) | i=1,2,3,\ldots, N\}\end{align*}$

enable us to approximate any statistical moment (mean, covariance, and higher-order moments) or expectation of a nonlinear function of state by using this equation

(21) $\begin{align*}E[\mathbf{d}(\mathbf{x}_{k})|\mathbf{y}_{0:k},\mathbf{u}_{0:k-1}]=\sum_{i=1}^{N}w^{(i)}_{k}\mathbf{d}(\mathbf{x}_{k}^{(i)})\end{align*}$

where $E[\cdot]$ is the expecation operator, and $\mathbf{d}(\mathbf{x}_{k})$ is in the general case, a nonlinear function. For example, if we want to compute the expectation, the function $\mathbf{d}(\mathbf{x}_{k})$ is simply equal to the state $\mathbf{d}(\mathbf{x}_{k})=\mathbf{x}_{k}$ .

TO CONCLUDE: BY COMPUTING THE PARTICLES $\{(\mathbf{x}_{k}^{(i)},w^{(i)}_{k}) | i=1,2,3,\ldots, N\}$ WE CAN APPROXIMATE THE POSTERIOR STATE DISTRIBUTION AND WE CAN APPROXIMATE ANY STATISTICS OF THE STATE!

Now we are ready to formulate the estimation problem for particle filters. We will formulate two problems.

ESTIMATION PROBLEM 1- GENERAL ESTIMATION PROBLEM FOR THE POSTERIOR DISTRIBUTION: By using the information about

State-space model of the system (14).
Transition probability $p(\mathbf{x}_{k}|\mathbf{x}_{k-1},\mathbf{u}_{k-1})$ .
Measurement probability $p(\mathbf{y}_{k}|\mathbf{x}_{k})$ .
Observed outputs $\mathbf{y}_{0},\mathbf{y}_{1},\mathbf{y}_{2},\ldots, \mathbf{y}_{k}$ and applied control inputs $\mathbf{u}_{0},\mathbf{u}_{1},\mathbf{u}_{2},\ldots, \mathbf{u}_{k-1}$ .
Initial guess of the particles

(22) $\begin{align*}\{(\mathbf{x}_{0}^{(i)},w^{(i)}_{0}) | i=1,2,3,\ldots, N\}\end{align*}$

At every time step $k$ , estimate the set of particles (weights and state samples)

(23) $\begin{align*}\{(\mathbf{x}_{k}^{(i)},w^{(i)}_{k}) | i=1,2,3,\ldots, N\}\end{align*}$

that approximate the posterior distribution of the state $\mathbf{x}_{k}$

(24) $\begin{align*}p(\mathbf{x}_{k}|\mathbf{y}_{0:k},\mathbf{u}_{0:k-1}) \approx \sum_{i=1}^{N}w^{(i)}_{k} \delta(\mathbf{x}_{k}- \mathbf{x}_{k}^{(i)})\end{align*}$

The above estimation problem is defined in a batch estimation framework. The particle filter algorithm solves this problem recursively. Consequently, let us define the recursive estimation problem.

ESTIMATION PROBLEM 2- RECURSIVE ESTIMATION PROBLEM FOR THE POSTERIOR DISTRIBUTION: By using the information about

State-space model of the system (14).
Transition probability $p(\mathbf{x}_{k}|\mathbf{x}_{k-1},\mathbf{u}_{k-1})$ .
Measurement probability $p(\mathbf{y}_{k}|\mathbf{x}_{k})$ .
Observed outputs $\mathbf{y}_{k}$ and the control input $\mathbf{u}_{k-1}$ applied at the previous time step $k-1$ .
The set of particles computed at the time step $k-1$

(25) $\begin{align*}\{(\mathbf{x}_{k-1}^{(i)},w^{(i)}_{k-1}) | i=1,2,3,\ldots, N\}\end{align*}$

At the time step $k$ , compute the set of particles

(26) $\begin{align*}\{(\mathbf{x}_{k}^{(i)},w^{(i)}_{k}) | i=1,2,3,\ldots, N\}\end{align*}$

That recursively approximates the posterior distribution

(27) $\begin{align*}p(\mathbf{x}_{k}|\mathbf{y}_{0:k},\mathbf{u}_{0:k-1}) \approx \sum_{i=1}^{N}w^{(i)}_{k} \delta(\mathbf{x}_{k}- \mathbf{x}_{k}^{(i)})\end{align*}$

You should notice the main difference between these two problem formulations. The first problem formulation uses all the information up to the time instant $k$ to approximate the posterior distribution. The second problem uses the information from the previous time step $k-1$ and the current time step $k$ to approximate the posterior distribution.

State Estimation By Using Particle Filters – Problem Formulation

State-Space Models

Statistics and State Space Models

State Estimation Using Particle Filters – Problem Formulation

admin

You might also like

State-Space Modeling of Double Mass-Spring-Damper System with Python Modeling

Clear and Detailed Explanation of Kinematics, Equations, and Geometry of Motion of Differential Wheeled Robot (Differential Drive Robot)

How To Approximate Expectations and Integrals of Functions by Using the Monte Carlo Method