关键词: 进化算法, 多目标优化, 区间, 偏好, 机器人, 路径规划

Abstract: Interval multi-objective optimization problems are very popular and important. There exist few evolutionary optimization methods for directly solving them, and these existing methods aim at finding a set of well-converged and evenly-distributed Pareto-optimal solutions. Three preference-based interval multi-objective evolutionary algorithms are surveyed to obtain the most preferred solution fitted the decision maker’s preferences. Additionally, the above algorithms are applied in robot path planning problems under a special environment, and are compared about their performance. The research enriches the methods of solving robot path planning problems under a special environment, and improves the optimization performance of the problems.

Key words: evolutionary algorithm, multi-objective optimization, interval, preference, robot, path planning