A Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function

Similar documents
Quantifying Uncertainty

AN IMPROVED PARTICLE FILTER ALGORITHM BASED ON NEURAL NETWORK FOR TARGET TRACKING

Appendix B: Resampling Algorithms

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Parameter Estimation for Dynamic System using Unscented Kalman filter

sensors ISSN by MDPI

The Study of Teaching-learning-based Optimization Algorithm

Chapter 13: Multiple Regression

RBF Neural Network Model Training by Unscented Kalman Filter and Its Application in Mechanical Fault Diagnosis

A Robust Method for Calculating the Correlation Coefficient

Unscented Particle Filtering Algorithm for Optical-Fiber Sensing Intrusion Localization Based on Particle Swarm Optimization

Hopfield Training Rules 1 N

A Network Intrusion Detection Method Based on Improved K-means Algorithm

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

LINEAR REGRESSION ANALYSIS. MODULE VIII Lecture Indicator Variables

Multi-user Detection Based on Weight approaching particle filter in Impulsive Noise

A Hybrid Evaluation model for Distribution Network Reliability Based on Matter-element Extension Method

Multigradient for Neural Networks for Equalizers 1

An Improved multiple fractal algorithm

Assessment of Site Amplification Effect from Input Energy Spectra of Strong Ground Motion

Estimation of Large Truck Volume Using Single Loop Detector Data

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm

A Hybrid Variational Iteration Method for Blasius Equation

Statistical Evaluation of WATFLOOD

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

DERIVATION OF THE PROBABILITY PLOT CORRELATION COEFFICIENT TEST STATISTICS FOR THE GENERALIZED LOGISTIC DISTRIBUTION

Pulse Coded Modulation

THE Kalman filter (KF) rooted in the state-space formulation

Global Sensitivity. Tuesday 20 th February, 2018

Assignment 5. Simulation for Logistics. Monti, N.E. Yunita, T.

Analytic Local Linearization Particle Filter for Bayesian State Estimation in Nonlinear Continuous Process

RELIABILITY ASSESSMENT

Uncertainty and auto-correlation in. Measurement

829. An adaptive method for inertia force identification in cantilever under moving mass

b ), which stands for uniform distribution on the interval a x< b. = 0 elsewhere

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests

An R implementation of bootstrap procedures for mixed models

Uncertainty in measurements of power and energy on power networks

Linear Approximation with Regularization and Moving Least Squares

Synchronized Multi-sensor Tracks Association and Fusion

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Phase I Monitoring of Nonlinear Profiles

This column is a continuation of our previous column

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

Lab 2e Thermal System Response and Effective Heat Transfer Coefficient

Research on Route guidance of logistic scheduling problem under fuzzy time window

Chapter 8 Indicator Variables

Feature Selection & Dynamic Tracking F&P Textbook New: Ch 11, Old: Ch 17 Guido Gerig CS 6320, Spring 2013

Joseph Formulation of Unscented and Quadrature Filters. with Application to Consider States

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

A Novel Method for Weighted Cooperative Spectrum Sensing in Cognitive Radio Networks

Power law and dimension of the maximum value for belief distribution with the max Deng entropy

Statistical inference for generalized Pareto distribution based on progressive Type-II censored data with random removals

A Fast Computer Aided Design Method for Filters

Investigating the Calculation Error of the Monte-Carlo Bayesian Estimator

Particle Filter Approach to Fault Detection andisolation in Nonlinear Systems

x i1 =1 for all i (the constant ).

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Operating conditions of a mine fan under conditions of variable resistance

A Multimodal Fusion Algorithm Based on FRR and FAR Using SVM

Probability Theory (revisited)

A Gauss Implementation of Particle Filters The PF library

x = , so that calculated

Natural Images, Gaussian Mixtures and Dead Leaves Supplementary Material

Hidden Markov Models & The Multivariate Gaussian (10/26/04)

Econ Statistical Properties of the OLS estimator. Sanjaya DeSilva

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

Composite Hypotheses testing

On the correction of the h-index for career length

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation

USE OF DOUBLE SAMPLING SCHEME IN ESTIMATING THE MEAN OF STRATIFIED POPULATION UNDER NON-RESPONSE

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

Article A Hybrid Adaptive Unscented Kalman Filter Algorithm

Calculating the Quasi-static Pressures of Confined Explosions Considering Chemical Reactions under the Constant Entropy Assumption

Appendix B. The Finite Difference Scheme

Web Appendix B Estimation. We base our sampling procedure on the method of data augmentation (e.g., Tanner and Wong,

SOC Estimation of Lithium-ion Battery Packs Based on Thevenin Model Yuanqi Fang 1,a, Ximing Cheng 1,b, and Yilin Yin 1,c. Corresponding author

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Orientation Model of Elite Education and Mass Education

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

Basically, if you have a dummy dependent variable you will be estimating a probability.

ERROR RESEARCH ON A HEPA FILTER MEDIA TESTING SYSTEM OF MPPS(MOST PENETRATION PARTICLE SIZE) EFFICIENCY

A New Grey Relational Fusion Algorithm Based on Approximate Antropy

NONLINEAR KALMAN FILTERS

Average Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1

A linear imaging system with white additive Gaussian noise on the observed data is modeled as follows:

Lecture Notes on Linear Regression

Statistical tools to perform Sensitivity Analysis in the Context of the Evaluation of Measurement Uncertainty

The Expectation-Maximization Algorithm

Statistical analysis using matlab. HY 439 Presented by: George Fortetsanakis

Tracking with Kalman Filter

EVALUATION OF THE VISCO-ELASTIC PROPERTIES IN ASPHALT RUBBER AND CONVENTIONAL MIXES

Negative Binomial Regression

18.1 Introduction and Recap

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

EEE 241: Linear Systems

Transcription:

Advanced Scence and Technology Letters, pp.83-87 http://dx.do.org/10.14257/astl.2014.53.20 A Partcle Flter Algorthm based on Mxng of Pror probablty densty and UKF as Generate Importance Functon Lu Lu 1,1, Meng Yang 2, Shu Geng 1,Yong-hu Wang 1, Juan Wang 1, 1 Harbn Insttute of Petroleum,150027,Harbn, Chna 2 Haerbn Engneerng Unversty, 150001,Haerbn,Chna {Lu Lu, Meng Yang, Shu Geng,Yong-hu Wang, Juan Wang, lulu_hsy}@163.com Abstract. As an mportant nonlnear flter theory, partcle flter s a heated ssue n domestc and foregn researches. The opton of mportance densty s one of the ey steps of partcle flter algorthm. The proper opton of mportance densty can mnsh the negatve nfluence of flter algorthm caused by degeneracy problem. Ths paper ntroduces several dely-used optons of mportance densty systemcally, and analyzes ther features and appled perspectves respectvely. The paper also advances a comprehensve method of mportance densty, analyzes ts techncal features, explores the adjudgement and mprovement of ths method based on varous performance, and fnally puts forard the necessary further study accordng to the engneer requrements. Keyords: partcle flter; mportance functon; SIS; proposal dstrbuton Partcle flter s a dely used nonlnear flter algorthm recently. The man dea of partcle flter s descrbng the posteror probablty densty of the random varable usng eghted random samplng ponts. These samplng ponts are called partcles. The major problem of the partcle flter s the partcle degeneraton,.e. most partcles eghts become tremendously less than before after several teraton steps th only a fe partcles have relatvely hgh eghts. So that a lot of calculaton ll be asted on these lo-eghted partcles [1]. Plenty of research results sho that, the best ay to solve ths problem schoosng a proper mportance densty and add the resamplng step nto the algorthm. In order to choose a good mportance densty, one have to consder several factors: frst, the defnton doman of probablty densty should cover all of the posteror probablty dstrbuton,.e. the mportance functon should have a de dstrbuton, second, t should be sampled easly, furthermore, t should consder both pror probablty densty of the status and the neest observaton data so as to get the smallest varance and mae t close to the true posteror probablty densty. In practcal applcaton, there s no common ay to desgn the mportance functon. The mportance functon s usually desgned by choosng a method to meet the performance requrement based on the specfc case. Ths paper descrbes several mostly used methods that are used to desgn the mportance functon. The advantages and dsadvantages of these methods have been analyzed. ISS: 2287-1233 ASTL Copyrght 2014 SERSC

Advanced Scence and Technology Letters 1 The optmum mportance densty functon Theoretcally, after choosng the mportance densty functon, 1, 1,hen the reference dstrbuton equal to the actual dstrbuton, q x x y p x x y the mportance eght s mnmzed. can be teratvely calculated to = p y x p x x d x. But there are to obvous dsadvantages. Frst, the - 1 1 actual dstrbuton p x x, y 1 usually cannot be calculated. Second, the ntegraton of cannot be solved [2]. 2 Desgn the mportance functon through UKF EKF s a partal lnear method, so t s suboptmum for estmaton of mean value and varance of mportance dstrbuton. Smlar to EKF, Unscented Kalman Flter (UKF) can also be used to approxmate the proposal dstrbuton of partcle flter [3]. UKF drectly use the nonlnear system model and observaton model, va several determned Sgma pont to get the statstc property after nonlnear transformaton. It can mae posteror probablty dstrbuton s mean value and varance be exacted to second order or even hgher. So UKF s better than EKF for ts consderaton of the neest observed mportance densty. Ths s so-called Unscented Partcle Flter (UPF). 3 Mxng of Pror probablty densty and UKF to generate mportance functon UPF frst use the last partcle and ts varance to determne a set of sgma pont. The poston and eghts of ths set of pont can only be determned by the expectaton and varance of partcle. It can get the exactly character of partcle probablty dstrbuton, then substtute t nto status equaton to get a ne set of pont. Use the eghted sum of ths set of pont as expectaton, and use the eghted sum of the varance as varance, then use measurement equaton to correct the obtaned expectaton and varance. The corrected value s used as the expectaton and varance of the Gaussan dstrbuton to generate a partcle of currently pont[4]. Because the suffcently consderaton of the nfluence of the current observaton value on the posteror probablty functon, ths algorthm mproves the effcency of partcle. Hoever, the calculaton cost of each partcle s generaton s hgh. A report [5] gave the mprovement of the UPF algorthm: use UKF that based on the estmaton of the former status to get the mportance functon and generate a porton of partcles. The remanng partcles can be generated by pror probablty. In ths ay, the nfluence of both the currently observaton value and the pror probablty on the posteror probablty s under consderaton. Also, the calculaton cost s reduced hle eepng 84 Copyrght 2014 SERSC

Advanced Scence and Technology Letters the accuracy of flterng. The mproved UPF algorthm s shon belo: (1) Intalzaton 0 Get the samplng ponts x ~ p x, set 1/ 0 (2) Importance samplng 0 0, 1,..., For each samplng pont x, usng UKF to get the mean value x 1 and varance P of the set of partcles. (3) Generaton of partcles Generate 0.5 partcles from the result of UKF x, P. Generate 0.5 partcles from the pror probablty dstrbuton p x x 1. (4) Update of eght value p y x p x x 1 1 x x, y 1 1: The mportance probablty densty functon s: x x, y x, P. It ntroduces the neest observaton value, so the 1 1: performance of the flter s mproved. (5) Get the normalzed eght value j 1 j (6) Resamplng Defne for evaluaton of the number of effectve partcle e ff If e ff th r, resample for x, 1,...,, generate ne set x 1,..., readjust the eghts of partcle as: (7) Update the status x x 1 1 /.,, The number rato of the partcles that generated by UKF to the partcles that generated by pror probablty densty s not alays fxed. A parameter c ( 0 c 1) can be ntroduced to control the rato. The evaluaton of c can be based on the accuracy requrement and the speed requrement of the flterng. For smaller c, the calculaton tme s shorter hle the flterng accuracy s loer; For bgger number c, the calculaton tme s longer and the flterng accuracy s hgher. Table 1. The calculaton tme th dfferent c c 0.1 0.2 0.3 0.4 0.5 Calculaton tme(s) 0.6832 0.8455 0.9559 1.1522 1.3117 c 0.6 0.7 0.8 0.9 1 Copyrght 2014 SERSC 85

Advanced Scence and Technology Letters Calculaton tme(s) 1.4237 1.6365 1.8387 1.9771 2.1644 Fg. 1. The status estmaton for dfferent partcle flterng algorthm (n hch, c s 0.35 n UPF algorthm) Performance analyss and comparson of several partcle algorthm has been done usng smulaton. Example smulaton uses the nonlnear non-gaussan model. The status equatons and observaton equatons are shon belo: x e x v 2 0.2 x n 3 0 y 0.5 x 2 n 3 0 1 s n (( 4 2 ) ( 1)) 0.5 1 1 Durng the smulaton, the algorthms used are PF, EKPF and the UPF hch s suggested n ths report. The number of partcles s set to 200 for each algorthm. The observaton tme s T=60. The smulaton conducts 100 tmes ndependent experments. From the smulaton results, the flter accuracy that suggested n ths report s obvously better than classcal PF algorthm and EKPF algorthm. 4 Concluson As a concluson, n the desgn of flter algorthm, the frst thng s analyzng the detals of problem to be solved, hle systematcally consderng the statstcal property of nose and observng the nfluence of the relatonshp beteen the statstcal propertes on the partcle flter s performance, mang the best usage of pror dstrbuton functon, lelhood functon and the neest observaton; second, the relatonshp beteen the flter s performance and the calculaton cost, complexty of calculaton can also affect the flter s performance. Only f the above factors are consdered, a good mportance functon can be desgned hen usng proper method. 86 Copyrght 2014 SERSC

Advanced Scence and Technology Letters Acnoledgements. Ths study as supported by Helongjang Provncal Department of Educaton Scence and Technology Research Projet(12543037). Reference 1. Janmn Yao, Study on Partcle Flter Based Vsual Tracng Method[D]. Ph.D Dssertaton of CAS, 2004 2. Sh-qang Hu, Zhong-lang Jng, Overve of partcle flter algorthm[j], Control and Decson, vol.20, o. 4, 361-365(2005) 3. Mere R V, Doucet A, Fretas De. The Unscented Partcle Flter[R]. Techncal Report CUED/F-IPEG/TR 380, Cambrdge Unversty Engneerng Department,2000 4. Quan Pan, Feng Yang, Lang Ye, Yan Lang and Yong-me Cheng, Survey of a nd of nonlnear flters-ukf[j], Control and Decson, vol. 20, o.5, 481-489(2005) 5. Juler S J, Uhlmann J K. Reduced sgma pont flters for the propagaton of means and covarances though nonlnear transformatons[a]. Proceedng of the Amercan Control Conference[C].Anchorage AK,2002 Copyrght 2014 SERSC 87