Combining the clonal selection mechanism of the immune system with the evolution equations of particle swarm optimization, an advanced algorithm was introduced for functions optimization. The advantages of this algori...Combining the clonal selection mechanism of the immune system with the evolution equations of particle swarm optimization, an advanced algorithm was introduced for functions optimization. The advantages of this algorithm lies in two aspects. Via immunity operation, the diversity of the antibodies was maintained, and the speed of convergent was improved by using particle swarm evolution equations. Simulation programme and three functions were used to check the effect of the algorithm. The advanced algorithm were compared with clonal selection algorithm and particle swarm algorithm. The results show that this advanced algorithm can converge to the global optimum at a great rate in a given range, the performance of optimization is improved effectively.展开更多
A large sample size is required for Monte Carlo localization （MCL） in multi-robot dynamic environ- ment, because of the ＂kidnapped robot＂ phenomenon, which will locate most of the samples in the regions with small...A large sample size is required for Monte Carlo localization （MCL） in multi-robot dynamic environ- ment, because of the ＂kidnapped robot＂ phenomenon, which will locate most of the samples in the regions with small value of desired posterior density. For this problem the crossover and mutation operators in evolutionary computation are introduced into MCL to make samples move towards the regions where the desired posterior density is large, so that the sample set can represent the density better. The proposed method is termed genetic Monte Carlo localization （GMCL）. Application in robot soccer system shows that GMCL can considerably reduce the required number of samples, and is more precise and robust in dynamic environment.展开更多
This paper presents a hybrid heuristic-triangle evolution (TE) for global optimization. It is a real coded evolutionary algorithm. As in differential evolution (DE), TE targets each individual in current population an...This paper presents a hybrid heuristic-triangle evolution (TE) for global optimization. It is a real coded evolutionary algorithm. As in differential evolution (DE), TE targets each individual in current population and attempts to replace it by a new better individual. However, the way of generating new individuals is different. TE generates new individuals in a Nelder-Mead way, while the simplices used in TE is 1 or 2 dimensional. The proposed algorithm is very easy to use and efficient for global optimization problems with continuous variables. Moreover, it requires only one (explicit) control parameter. Numerical results show that the new algorithm is comparable with DE for low dimensional problems but it outperforms DE for high dimensional problems.展开更多
基金Project(A1420060159) supported by the National Basic Research of China projects(60234030, 60404021) supported by the National Natural Science Foundation of China
文摘Combining the clonal selection mechanism of the immune system with the evolution equations of particle swarm optimization, an advanced algorithm was introduced for functions optimization. The advantages of this algorithm lies in two aspects. Via immunity operation, the diversity of the antibodies was maintained, and the speed of convergent was improved by using particle swarm evolution equations. Simulation programme and three functions were used to check the effect of the algorithm. The advanced algorithm were compared with clonal selection algorithm and particle swarm algorithm. The results show that this advanced algorithm can converge to the global optimum at a great rate in a given range, the performance of optimization is improved effectively.
文摘A large sample size is required for Monte Carlo localization （MCL） in multi-robot dynamic environ- ment, because of the ＂kidnapped robot＂ phenomenon, which will locate most of the samples in the regions with small value of desired posterior density. For this problem the crossover and mutation operators in evolutionary computation are introduced into MCL to make samples move towards the regions where the desired posterior density is large, so that the sample set can represent the density better. The proposed method is termed genetic Monte Carlo localization （GMCL）. Application in robot soccer system shows that GMCL can considerably reduce the required number of samples, and is more precise and robust in dynamic environment.
基金the National Natural Science Foundation of China （No. 10671029）.
文摘This paper presents a hybrid heuristic-triangle evolution (TE) for global optimization. It is a real coded evolutionary algorithm. As in differential evolution (DE), TE targets each individual in current population and attempts to replace it by a new better individual. However, the way of generating new individuals is different. TE generates new individuals in a Nelder-Mead way, while the simplices used in TE is 1 or 2 dimensional. The proposed algorithm is very easy to use and efficient for global optimization problems with continuous variables. Moreover, it requires only one (explicit) control parameter. Numerical results show that the new algorithm is comparable with DE for low dimensional problems but it outperforms DE for high dimensional problems.
