During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution qual...During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization （CPSO） for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle＇s historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.展开更多
The Differential Evolution (DE) algorithm is arguably one of the most powerful stochastic optimization algorithms, which has been widely applied in various fields. Global numerical optimization is a very important and...The Differential Evolution (DE) algorithm is arguably one of the most powerful stochastic optimization algorithms, which has been widely applied in various fields. Global numerical optimization is a very important and extremely dif-ficult task in optimization domain, and it is also a great need for many practical applications. This paper proposes an opposition-based DE algorithm for global numerical optimization, which is called GNO2DE. In GNO2DE, firstly, the opposite point method is employed to utilize the existing search space to improve the convergence speed. Secondly, two candidate DE strategies “DE/rand/1/bin” and “DE/current to best/2/bin” are randomly chosen to make the most of their respective advantages to enhance the search ability. In order to reduce the number of control parameters, this algorithm uses an adaptive crossover rate dynamically tuned during the evolutionary process. Finally, it is validated on a set of benchmark test functions for global numerical optimization. Compared with several existing algorithms, the performance of GNO2DE is superior to or not worse than that of these algorithms in terms of final accuracy, convergence speed, and robustness. In addition, we also especially compare the opposition-based DE algorithm with the DE algorithm without using the opposite point method, and the DE algorithm using “DE/rand/1/bin” or “DE/current to best/2/bin”, respectively.展开更多
As one of the important components of computational flight mechanics and control,numerical algorithms of trajectory optimization for flight vehicles are currently studied by many researchers in aerospace engineering t...As one of the important components of computational flight mechanics and control,numerical algorithms of trajectory optimization for flight vehicles are currently studied by many researchers in aerospace engineering to completely solve these difficult problems,but few papers on the survey of this research field have been published recently.Based on the investigation of more than one hundred literatures,considering the application perspectives of computational flight mechanics and recent developments of trajectory optimization,the numerical algorithms of trajectory optimizations for aerospace vehicles are summarized and systematically analyzed.This paper summarized the basic principle,characteristics and application for all kinds of current trajectory optimization algorithms;and introduced some new methods and theories appearing in recent years.Finally,collaborative trajectory optimization for many flight vehicles,and hypersonic vehicle trajectory optimization were mainly reviewed in this paper.In the conclusion of this paper,the future research properties are presented regarding to numerical algorithms of trajectory optimization and control for flight vehicles as follows:collaboration and antagonization for many flight vehicles and multiple targets,global,real-time online,high accuracy of 7-D trajectory,considering all kinds of unknown random disturbances in trajectory optimization,and so on.展开更多
基金Projects(50275150,61173052)supported by the National Natural Science Foundation of China
文摘During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization （CPSO） for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle＇s historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.
文摘The Differential Evolution (DE) algorithm is arguably one of the most powerful stochastic optimization algorithms, which has been widely applied in various fields. Global numerical optimization is a very important and extremely dif-ficult task in optimization domain, and it is also a great need for many practical applications. This paper proposes an opposition-based DE algorithm for global numerical optimization, which is called GNO2DE. In GNO2DE, firstly, the opposite point method is employed to utilize the existing search space to improve the convergence speed. Secondly, two candidate DE strategies “DE/rand/1/bin” and “DE/current to best/2/bin” are randomly chosen to make the most of their respective advantages to enhance the search ability. In order to reduce the number of control parameters, this algorithm uses an adaptive crossover rate dynamically tuned during the evolutionary process. Finally, it is validated on a set of benchmark test functions for global numerical optimization. Compared with several existing algorithms, the performance of GNO2DE is superior to or not worse than that of these algorithms in terms of final accuracy, convergence speed, and robustness. In addition, we also especially compare the opposition-based DE algorithm with the DE algorithm without using the opposite point method, and the DE algorithm using “DE/rand/1/bin” or “DE/current to best/2/bin”, respectively.
基金supported by the Fundatmental Research Funds for the Central Universities of China (Grant No. CXZZ11_0215)
文摘As one of the important components of computational flight mechanics and control,numerical algorithms of trajectory optimization for flight vehicles are currently studied by many researchers in aerospace engineering to completely solve these difficult problems,but few papers on the survey of this research field have been published recently.Based on the investigation of more than one hundred literatures,considering the application perspectives of computational flight mechanics and recent developments of trajectory optimization,the numerical algorithms of trajectory optimizations for aerospace vehicles are summarized and systematically analyzed.This paper summarized the basic principle,characteristics and application for all kinds of current trajectory optimization algorithms;and introduced some new methods and theories appearing in recent years.Finally,collaborative trajectory optimization for many flight vehicles,and hypersonic vehicle trajectory optimization were mainly reviewed in this paper.In the conclusion of this paper,the future research properties are presented regarding to numerical algorithms of trajectory optimization and control for flight vehicles as follows:collaboration and antagonization for many flight vehicles and multiple targets,global,real-time online,high accuracy of 7-D trajectory,considering all kinds of unknown random disturbances in trajectory optimization,and so on.
