This paper introduces drift analysis approach in studying the convergence and hitting times of evolutionary algorithms. First the methodology of drift analysis is introduced, which links evolutionary algorithms with M...This paper introduces drift analysis approach in studying the convergence and hitting times of evolutionary algorithms. First the methodology of drift analysis is introduced, which links evolutionary algorithms with Markov chains or supermartingales. Then the drift conditions which guarantee the convergence of evolutionary algorithms are described. And next the drift conditions which are used to estimate the hitting times of evolutionary algorithms are presented. Finally an example is given to show how to analyse hitting times of EAs by drift analysis approach.展开更多
Extended Kalman Filter(EKF)algorithm is widely used in parameter estimation for nonlinear systems.The estimation precision is sensitively dependent on EKF’s initial state covariance matrix and state noise matrix.The ...Extended Kalman Filter(EKF)algorithm is widely used in parameter estimation for nonlinear systems.The estimation precision is sensitively dependent on EKF’s initial state covariance matrix and state noise matrix.The grid optimization method is always used to find proper initial matrix for off-line estimation.However,the grid method has the draw back being time consuming hence,coarse grid followed by a fine grid method is adopted.To further improve efficiency without the loss of estimation accuracy,we propose a genetic algorithm for the coarse grid optimization in this paper.It is recognized that the crossover rate and mutation rate are the main influencing factors for the performance of the genetic algorithm,so sensitivity experiments for these two factors are carried out and a set of genetic algorithm parameters with good adaptability were selected by testing with several gyros’experimental data.Experimental results show that the proposed algorithm has higher efficiency and better estimation accuracy than the traversing grid algorithm.展开更多
基金Supported by Engineering and Physical Science Research Courcil(GR/R52541/01)and State Laboratory of Software Engineering at Wuhan University
文摘This paper introduces drift analysis approach in studying the convergence and hitting times of evolutionary algorithms. First the methodology of drift analysis is introduced, which links evolutionary algorithms with Markov chains or supermartingales. Then the drift conditions which guarantee the convergence of evolutionary algorithms are described. And next the drift conditions which are used to estimate the hitting times of evolutionary algorithms are presented. Finally an example is given to show how to analyse hitting times of EAs by drift analysis approach.
文摘Extended Kalman Filter(EKF)algorithm is widely used in parameter estimation for nonlinear systems.The estimation precision is sensitively dependent on EKF’s initial state covariance matrix and state noise matrix.The grid optimization method is always used to find proper initial matrix for off-line estimation.However,the grid method has the draw back being time consuming hence,coarse grid followed by a fine grid method is adopted.To further improve efficiency without the loss of estimation accuracy,we propose a genetic algorithm for the coarse grid optimization in this paper.It is recognized that the crossover rate and mutation rate are the main influencing factors for the performance of the genetic algorithm,so sensitivity experiments for these two factors are carried out and a set of genetic algorithm parameters with good adaptability were selected by testing with several gyros’experimental data.Experimental results show that the proposed algorithm has higher efficiency and better estimation accuracy than the traversing grid algorithm.
