Nonlinear Filters. Simon Haykin

Читать онлайн книгу.

Nonlinear Filters - Simon  Haykin


Скачать книгу
k Baseline right-parenthesis comma EndLayout"/>

      (4.6)p left-parenthesis bold y Subscript k Baseline vertical-bar bold x Subscript k Baseline comma bold u Subscript k Baseline right-parenthesis period

      The input sequence and the available measurement sequence at time instant k are denoted by bold upper U Subscript k Baseline equals left-brace bold u Subscript i Baseline vertical-bar i equals 0 comma ellipsis comma k right-brace identical-to bold u Subscript 0 colon k and bold upper Y Subscript k Baseline equals left-brace bold y Subscript i Baseline vertical-bar i equals 0 comma ellipsis comma k right-brace identical-to bold y Subscript 0 colon k, respectively. These two sequences form the available information at time k, hence the union of these two sets is called the information set, bold upper I Subscript k Baseline equals StartSet bold upper U Subscript k Baseline comma bold upper Y Subscript k Baseline EndSet equals StartSet bold u Subscript 0 colon k Baseline comma bold y Subscript 0 colon k Baseline EndSet [47].

      A filter uses the inputs and available observations up to time instant k, to estimate the state at k, ModifyingAbove bold x With Ì‚ Subscript k vertical-bar k. In other words, a filter tries to solve an inverse problem to infer the states (cause) from the observations (effect). Due to uncertainties, different values of the state could have led to the obtained measurement sequence, bold y Subscript 0 colon k. The Bayesian framework allows us to associate a degree of belief to these possibly valid values of state. The main idea here is to start from an initial density for the state vector, p left-parenthesis bold x 0 right-parenthesis, and recursively calculate the posterior PDF, p left-parenthesis bold x Subscript k Baseline vertical-bar bold u Subscript 0 colon k Baseline comma bold y Subscript 0 colon k Baseline right-parenthesis based on the measurements. This can be done by a filtering algorithm that includes two‐stages of prediction and update [46].

      When a new measurement bold y Subscript k plus 1 is obtained, the prediction stage is followed by the update stage, where the above prediction density will play the role of the prior. Bayes' rule is used to compute the posterior density of the state as [46, 47]: