Tracking moving optima using Kalman-based predictions

The dynamic optimization problem concerns finding an optimum in a changing environment. In the field of evolutionary algorithms, this implies dealing with a timechanging fitness landscape. In this paper we compare different techniques for integrating motion information into an evolutionary algorithm, in the case it has to follow a time-changing optimum, under the assumption that the changes follow a nonrandom law. Such a law can be estimated in order to improve the optimum tracking capabilities of the algorithm. In particular, we will focus on first order dynamical laws to track moving objects. A vision-based tracking robotic application is used as testbed for experimental comparison

Prediction of Short-term Traffic Variables using Intelligent Swarm-based Neural Networks

This paper presents an innovative algorithm integrated with particle swarm optimization and artificial neural networks to develop short-term traffic flow predictors, which are intended to provide traffic flow forecasting information for traffic management in order to reduce traffic congestion and improve mobility of transportation. The proposed algorithm aims to address the issues of development of short-term traffic flow predictors which have not been addressed fully in the current literature namely that: a) strongly non-linear characteristics are unavoidable in traffic flow data; b) memory space for implementation of short-term traffic flow predictors is limited; c) specification of model structures for short-term traffic flow predictors which do not involve trial and error methods based on human expertise; d) adaptation to newly-captured, traffic flow data is required. The proposed algorithm was applied to forecast traffic flow conditions on a section of freeway in Western Australia, whose traffic flow information is newly-captured. These results clearly demonstrate the effectiveness of using the proposed algorithm for real-time traffic flow forecasting

Modeling and interpolation of the ambient magnetic field by Gaussian processes

Anomalies in the ambient magnetic field can be used as features in indoor positioning and navigation. By using Maxwell's equations, we derive and present a Bayesian non-parametric probabilistic modeling approach for interpolation and extrapolation of the magnetic field. We model the magnetic field components jointly by imposing a Gaussian process (GP) prior on the latent scalar potential of the magnetic field. By rewriting the GP model in terms of a Hilbert space representation, we circumvent the computational pitfalls associated with GP modeling and provide a computationally efficient and physically justified modeling tool for the ambient magnetic field. The model allows for sequential updating of the estimate and time-dependent changes in the magnetic field. The model is shown to work well in practice in different applications: we demonstrate mapping of the magnetic field both with an inexpensive Raspberry Pi powered robot and on foot using a standard smartphone.Comment: 17 pages, 12 figures, to appear in IEEE Transactions on Robotic

A Stochastic Resampling Based Selective Particle Filter for Robust Visual Object Tracking

In this work, a new variant of particle filter has been proposed. In visual object tracking, particle filters have been used popularly because they are compatible with system non-linearity and non-Gaussian posterior distribution. But the main problem in particle filtering is sample degeneracy. To solve this problem, a new variant of particle filter has been proposed. The resampling algorithm used in this proposed particle filter is derived by combining systematic resampling, which is commonly used in SIR-PF (Sampling Importance Resampling Particle Filter) and a modified bat algorithm; this resampling algorithm reduces sample degeneracy as well as sample impoverishments. The measurement model is modified to handle clutter in presence of varying background. A new motion dynamics model is proposed which further reduces the chance of sample degeneracy among the particles by adaptively shifting mean of the process noise. To deal with illumination fluctuation and object deformation in presence of complete occlusion, a template update algorithm has also been proposed. This template update algorithm can update template even when the difference in the spread of the color-histogram is especially large over time. The proposed tracker has been tested against many challenging conditions and found to be robust against clutter, illumination change, scale change, fast object movement, motion blur, and complete occlusion; it has been found that the proposed algorithm outperforms the SIR-PF (Sampling Importance Resampling Particle Filter), bat algorithm and some other state-of-the-art tracking algorithms