Generalized predictive control—Part I. The basic algorithm
Automatica (Journal of IFAC)
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Weighted optimization for multiobjective full-information control problems
Systems & Control Letters
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Multi-Objective Optimization by Means of the Thermodynamical Genetic Algorithm
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Multiobjective controller design handling human preferences
Engineering Applications of Artificial Intelligence
Technical communique: Structurally constrained H2 and H∞ control: A rank-constrained LMI approach
Automatica (Journal of IFAC)
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms
IEEE Transactions on Evolutionary Computation
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Weighted preferences in evolutionary multi-objective optimization
AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is a sound method to deal with the multi-objective optimization problem, and even spread Pareto front preserving strategy is one of its two key principles. However, especially for some dynamic problems, the most interested area is certain special area among the Pareto front. To meet this requirement, the non-even Pareto front spread preserving principle is proposed and is taken as the optimization tool for the multi-objective compatible control problem (MOCCP). To decrease the real-time computation load at every control step, based on the tight relation between the system states of the neighboring sampling instants, an iterative control algorithm is presented. The stability preference selection strategy in the algorithm tends to produce a stable controller in face of the Pareto front with the divergent or oscillating segment. To further decrease the computation time, adaptable population corresponding with the control process is adopted. Comparative simulation example illustrates the validity.