Mathematical control of complex systems

Copyright © 2013 ZidongWang et al.This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited

Evolutionary computing and particle filtering: a hardware-based motion estimation system

Particle filters constitute themselves a highly powerful estimation tool, especially when dealing with non-linear non-Gaussian systems. However, traditional approaches present several limitations, which reduce significantly their performance. Evolutionary algorithms, and more specifically their optimization capabilities, may be used in order to overcome particle-filtering weaknesses. In this paper, a novel FPGA-based particle filter that takes advantage of evolutionary computation in order to estimate motion patterns is presented. The evolutionary algorithm, which has been included inside the resampling stage, mitigates the known sample impoverishment phenomenon, very common in particle-filtering systems. In addition, a hybrid mutation technique using two different mutation operators, each of them with a specific purpose, is proposed in order to enhance estimation results and make a more robust system. Moreover, implementing the proposed Evolutionary Particle Filter as a hardware accelerator has led to faster processing times than different software implementations of the same algorithm

Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

No abstract available

GPU Implementation of DPSO-RE Algorithm for Parameters Identification of Surface PMSM Considering VSI Nonlinearity

In this paper, an accurate parameter estimation model of surface permanent magnet synchronous machines (SPMSMs) is established by taking into account voltage-source-inverter (VSI) nonlinearity. A fast dynamic particle swarm optimization (DPSO) algorithm combined with a receptor editing (RE) strategy is proposed to explore the optimal values of parameter estimations. This combination provides an accelerated implementation on graphics processing unit (GPU), and the proposed method is, therefore, referred to as G-DPSORE. In G-DPSO-RE, a dynamic labor division strategy is incorporated into the swarms according to the designed evolutionary factor during the evolution process. Two novel modifications of the movement equation are designed to update the velocity of particles. Moreover, a chaotic-logistic-based immune RE operator is developed to facilitate the global best individual (gBest particle) to explore a potentially better region. Furthermore, a GPU parallel acceleration technique is utilized to speed up parameter estimation procedure. It has been demonstrated that the proposed method is effective for simultaneous estimation of the PMSM parameters and the disturbance voltage (Vdead) due to VSI nonlinearity from experimental data for currents and rotor speed measured with inexpensive equipment. The influence of the VSI nonlinearity on the accuracy of parameter estimation is analyzed

Comparison between RLS-GA and RLS-PSO For Li-ion battery SOC and SOH estimation: a simulation study

This paper proposes a new method of concurrent SOC and SOH estimation using a combination of recursive least square (RLS) algorithm and particle swarm optimization (PSO). The RLS algorithm is equipped with multiple fixed forgetting factors (MFFF) which are optimized by PSO. The performance of the hybrid RLS-PSO is compared with the similar RLS which is optimized by single objective genetic algorithms (SOGA) as well as multi-objectives genetic algorithm (MOGA). Open circuit voltage (OCV) is treated as a parameter to be estimated at the same timewith internal resistance. Urban Dynamometer Driving Schedule (UDDS) is used as the input data. Simulation results show that the hybrid RLS-PSO algorithm provides little better performance than the hybrid RLS-SOGA algorithm in terms of mean square error (MSE) and a number of iteration. On the other hand, MOGA provides Pareto front containing optimum solutions where a specific solution can be selected to have OCV MSE performance as good as PSO