The Data Processing of Single-yarn Strength Testing Based on the Particle Filter Algorithm

In this paper, a novel methodology is proposed to solve the simultaneous localization and mapping (SLAM) problem of mobile robot with particle filter (PF) algorithm. Compared with Kalman filter (KF) and extended Kalman filter (EKF), PF has a better performance in non-linear non-Gaussian environments. A close-loop updating scheme is developed in which positions of the robot and landmarks are updated with particle filtering and a weighted averaging algorithm respectively, and are linked through an additional feedback and correction process. An adaptive re-sampling method is used to reduce the computational load. The results of the simulation indicate that the PF-SLAM algorithm can localize the robot and landmarks accurately, and the error of landmarks' estimation converges better than general SLAM algorithms.

Channel estimation is an important part in a coherent detection of MIMO system. This paper proposes tracking of fast time varying channel coefficients for a MIMO system using particle filter algorithm. As the system is highly mobile, MIMO channel is fast time-varying, non-linear and non-Gaussian, particle filter is the best candidate to track the swiftly varying channel co-efficient. Even though there exist Kalman filter, the BLUE (Best Linear Unbiased Estimator), it is not suitable for nonlinear and non-Gaussian problems. Moreover Kalman filter variants namely EKF (Extended Kalman Filter) and UKF (Unscented Kalman Filter) are limited to Gaussian noise.

Wireless Sensor Network (WSN) is a new technology integrated with communications, embedded technology, and network functions; having capability of real-time collecting, communicating, and sensing, for which dynamic target locating and tracking is its critical task, as well as a basic element in its commercial and military application such as battlefield information accessing and traffic monitoring. Sensor target tracking is the technology of target location estimate based on measurements from corresponding sensors. An inaccurate estimated location may very easily lead to target tracking failure which reduces the reliability and stability of the target tracking [1]. Experts and scholars have done a lot of researches to solve problems exited in wireless sensor target tracking, and many new tracking algorithms have been proposed, among which tracking algorithms such as target contrail-fitting, linear prediction, Kalman filter, unscented Kalman filter(UKF) and particle filter[2] are most common applied. Sikdar, with his partners, has proposed target location tracking algorithm based on linear sensor which is proved better than conventional contrail fitting algorithm in its effects. Zhang Xiaoping , with his partners, has proposed WSN target tracking algorithm through modeling for quadratic polynomial motions which has improved target tracking accuracy[3]. However, there is a problem in common: all the algorithms above assume the tracking target contrail-fittings being in linear motion, while the actual contrail fitting is of uncertainty and variability, and the estimated accuracy can hardly be improved after being to a certain level. In this condition, the tracking error of the above algorithms can be greater [4]. Kalman filter algorithm can be applied for weakly nonlinear models, but for strongly nonlinear models, Unscented Kalman Filter algorithm can be better. Kalman filter work well in cases based on model-linear and Gaussian noise, thus its estimated accuracy is not that ideal [5, 6]. Particle filter algorithm is based on optimal regression Bayesian filtering algorithm in Monte Carlo simulation, which can accurately estimate the any distribution state with only a small amount of mobile anchor nodes. PF algorithm has distinguished advantages in processing non-linear, non-Gaussian cases [7]. However, in PF application process after several iterations, diversified degradation of the particles will occur, which is likely to lead a target tracking loss, thus further affect WSN target tracking accuracy [8]. In order to solve the diversified degradation of the particles in Particle Filter algorithm, this paper Research on the Target Tracking Algorithm for Wireless Sensor Network Based on Improved Particle Filter Liang Peng,Xinhan Huang, Li He

A key problem of mobile robots is that of the positioning capability in order to detect their locations in the operating environment. A promising technology used in indoor localization recently is Visible Light Communication (VLC). In this paper, an integrated Angle of Arrival-Received Signal Strength (AOA-RSS) localization method using the VLC, which could get high accuracy with simple hardware, is proposed. In addition, the Extended Kalman Filter (EKF) and Particle Filter (PF) algorithms are combined with the proposed AOA-RSS localization method in order to achieve higher accuracy of the mobile robot positioning. By computer simulation, the performance of the proposed AOA-RSS localization method combined with the EKF and PF algorithms are compared. The combination scheme outperforms the individual VLC localization with small error approximation of a few centimetres.

The underwater target tracking environment usually has the characteristics of strong nonlinearity and non-Gaussian. The target tracking problem usually uses the nonlinear filtering algorithm, which combines the nonlinear measurement model with the linear system dynamics. The primary goal of target tracking is to extract accurate information about the real-time state of the target from the noise nonlinear observation obtained by the sensor. A new Gaussian Hermitt Kalman particle filter algorithm (GHKF-PF) is used to improve the tracking accuracy of the particle filter algorithm (PF). GHKF-PF uses the GHKF sampling method to sample particles from the posterior distribution of the target, calculates the mean and covariance for each particle, and uses the mean and variance to guide sampling. In the simulation experiment, the uniform linear motion model of underwater 3D target in the environment of Gaussian mixture noise (GMN) is established, and the application of GHKF-PF algorithm in 3D space is realized, and the accuracy is higher than that of PF. In order to further verify the effectiveness of the algorithm, a six-dimensional uniform acceleration motion model is established and compared with the extended particle filter (EPF) algorithm and the unscented particle filter (UPF) algorithm. The simulation results show that the performance of the GHKF-PF algorithm is similar to that of the UPF algorithm and better than the EPF algorithm.

To deal with the problem of ballistic reentry target trajectory tracking, a novel particle filter algorithm is proposed to mitigate the particle degeneracy. It can eliminate the inefficient particles by judging the degree of particle degradation at each time and generates new particles based on the estimation state values and their covariance according to the degeneracy ratio of particles. Compared with Standard Particle Filter (SPF) algorithm and Unscented Particle Filter (UPF) algorithm, simulation results show that the proposed algorithm can achieve better tracking performance with lower computational burden for the trajectory reentry target tracking model. Especially in the case of ballistic target maneuver, the performance stability of the proposed algorithm is even more significant.

Owing to low cost and relatively accurate range measurement, ultrasonic sensors are widely used in various simultaneous localisation and mapping (SLAM) applications. In spite of the abundance of ultrasonic sensor based SLAM applications, a simple and efficient algorithm for an ultrasonic sensor based positioning system with good accuracy and low computational complexity has not yet emerged. The major difficulty is the trade-off between localisation accuracy and computational complexity in most SLAM algorithms, such as extended Kalman filter (EKF) and particle filter. Typically, they improve localisation accuracy by increasing the density of the landmarks, as a result leading to high computational complexity of algorithms and limiting the utilisation of algorithms into online SLAM systems. This study addresses an improved particle filter algorithm to solve ultrasonic sensor based 2D range-only SLAM problem with relatively good accuracy and low computational complexity. This algorithm uses a simple four fixed features based system model to limit the density of the landmarks. A technique called map adjustment is proposed to increase the accuracy and efficiency of the algorithm. Using map adjustment, the proposed particle filter algorithm can improve localisation accuracy and lower computational complexity. The experiment results demonstrate that this algorithm has a better performance than conventional particle filter localisation algorithm.

Satellite formation flying has arisen much attention in various space missions due to its wide application, low cost and strong adaptability. As relative position and attitude measurement is essential to satellite formation flying, a RF-based measurement model has been proposed in this paper. Two algorithms, extended Kalman filter (EKF) and particle filter (PF) are employed to estimate parameters of satellite relative position and attitude. Estimation performance of the two algorithms is analyzed and compared through simulations under different conditions. Comparison results show that both EKF and PF algorithms have respective advantages and disadvantages. By analysis and simulations, the paper provides a guidance that helps to choose proper filters to achieve better estimation performance in the scenario of satellite formation flying.

We present the parallel particle filtering (PPF) software library, which enables hybrid shared-memory/distributedmemory parallelization of particle filtering (PF) algorithms combining the Message Passing Interface (MPI) with multithreading for multi-level parallelism. The library is implemented in Java and relies on OpenMPI's Java bindings for inter-process communication. It includes dynamic load balancing, multi-thread balancing, and several algorithmic improvements for PF, such as input-space domain decomposition. The PPF library hides the difficulties of efficient parallel programming of PF algorithms and provides application developers with a tool for parallel implementation of PF methods. We demonstrate the capabilities of the PPF library using two distributed PF algorithms in two scenarios with different numbers of particles. The PPF library runs a 38 million particle problem, corresponding to more than 1.86 TB of particle data, on 192 cores with 67% parallel efficiency.

Most of the countries have paid great attention to flood water level monitoring and tracking because flood may damages people's life and property. Since flood water level fluctuate highly nonlinear, it is very difficult to predict the flood water level. The particle filter algorithm is well known as a very effective solution for handling nonlinear problems. Thus, in this paper, this algorithm is applied to predict the flood water level. There are many variations of particle filter. This paper proposes Sequential Importance Sampling (SIS) particle filter to solve the above mentioned problem. SIS is the basic particle filter. However, the problems with SIS particle filter are the particle degeneration phenomenon, when after a few iterations only a few particles have nonzero weight. So, Sampling Importance Resampling (SIR) particle filter is also introduced as the improved particle filter. From the simulation results using Matlab, SIR particle filter outperforms SIS particle filter by comparing the Root Mean Square Error (RMSE) value.

Indoor localization using the magnetic fingerprint collected by the embedded sensors of smartphone has been under constant improvement with the widespread popularity of the smartphone. Most of the current systems rely on the Particle Filter (PF) or the Kalman Filter (KF) to combine the Pedestrian Dead Reckoning (PDR) with the magnetic or WiFi fingerprint for improving their accuracy. In this paper, a system using the PDR and the magnetic fingerprint is proposed for indoor localization, which is based on the combination of the Particle Filter (PF) and the Extend Kalman Filter (EKF). The system includes the Pedestrian Dead Reckoning (PDR) module and the magnetic fingerprint matching module. In particular, the hybrid indoor positioning algorithm which combines the Particle Filter (PF) and the Extend Kalman Filter (EKF) is proposed in the magnetic fingerprint matching module for the fusion of the results of the Pedestrian Dead Reckoning module and the magnetic fingerprint. This hybrid indoor positioning algorithm is the key component which can reduce the computation of the Particle Filter effectively and solve the inherent blindness and particles degeneration problem. The obtained results in the real scenarios show that our fusion system achieves better results than the widely adopted system in which the Particle Filter (PF) or the Kalman Filter (KF) is used. The evaluation shows the system achieves a localization accuracy about 1-2m on average in a large building.

State of Charge (SOC) estimation plays a crucial role in managing the performance and longevity of electric vehicle (EV) batteries. Various estimation techniques, including various Kalman Filters (KF), have been employed for this purpose. The mathematical process and limits of different KF family algorithms are analysed. In this study, an impact of nonlinear KF parameters on SOC estimation accuracy for EV batteries is analyzed. Specifically, the performance of Extended Kalman Filter (EKF), Unscented Kalman Filter (UKF), and Particle Filter (PF) is examined. EKF is most preferred for SOC estimation whereas introducing sigma points in UKF is the basic difference between EKF and UKF. In comparison to EKF and UKF, PF is more flexible since it applies to nonlinear systems with non-Gaussian distributions. Utilising a sequence of noisy measurements, KF is a recursive method that approximates the state of a dynamic system. It requires accurate parameters such as process noise covariance (Q) and measurement noise covariance (R) to work effectively. In this work, the effect of these parameters on state of charge estimation using nonlinear KFs has been analysed under different settings of noise covariance matrices. Tuning these parameters is essential for optimizing the performance of the KF and ensuring accurate and reliable state estimation in real-world applications. To find parameter values that provide the best balance between accuracy, robustness, and computational efficiency, the tuning process involves experimentation, simulation, and validation using real-world data. According to the results observed, the filter parameters such as three diagonal elements of Q are selected as 2e-8, 0.005, 0.003 and R as 2e-6. By evaluating the state estimation accuracy under different driving scenarios, robustness and sensitivity of filtering technique in estimating SOC for EV batteries has been studied. This analysis contributes to the optimization of SOC estimation algorithms, enhancing the reliability and efficiency of EV battery management systems.

Tracking a maneuvering target weakens the performance of predictive-model-based Bayesian state estimators (Kalman Filter). Therefore, the particle is used to track maneuverable targets instead of Kalman filter and its extensions. The particle filter proved more efficiency compared to Kalman filter and its extensions, e.g. Extended Kalman Filter (EKF) and Interacting Multiple Model (IMM). Unfortunately, due to the highly uncertainty and incompleteness of the information in a highly-maneuverable target-tracking problem, the advantage of the particle filter is weakened. Both auxiliary and smoothing particle filter were proposed to overcome this problem. In this paper, we compare the performance of both auxiliary and smoothing particle filter in tracking a highly maneuverable target. We applied both algorithms to track a maneuverable target in a multiple-sensors network. Monte Carlo simulation showed that the smoothing particle filter has a better performance when compared to auxiliary particle filter in tracking a maneuvering target.

Surveillance of underwater for maritime warfare is traditionally being carried out by bearings-only tracking from many decades. The measurements used for state estimation here are nonlinear. Also the noise in the measurements and the process cannot be always Gaussian. The traditional nonlinear filtering algorithms like extended Kalman filter and modified gain extended Kalman filter use the linearisation of the system. The unscented Kalman filter (UKF) uses the sigma point approach based on Gaussian distribution to deal with nonlinearity. The particle filter (PF) uses the randomly generated particles based on the pdf of the state. PF is highly complex to implement and it also suffers from sample impoverishment. Hence, ensemble Kalman filter (EnKF) which is a simplified form of PF will be tried out for bearings-only tracking in this research work. The performance of EnKF is compared with PF and UKF and the results obtained using these filters in Matlab are presented.

Adaptive data processing in modern radar systems is standard approach. The classic kalman filter, extended kalman filter and many other applications are usually used for state estimate and radar target tracking. Signal and data processing technology improvement allows the more effective target tracking in real time. In this paper, we approach the structure and key features of the optimal particle filtering (PF). The optimization criteria for PF are proposed and analyzed. The dependence of mean square error on the number of particles during track prediction by particle filter is discussed. Using this dependence, we were able to determine the minimum required number of particles to correctly predict the trajectory of the target depending on its dynamics (trajectory complexity). The results of off-line real radar data processing are analyzed.