The sequential optimization-constraint multi-objective problem and its applications for robust planning of robot paths

In this paper a new approach to search for diverse solutions for a multi-objective problem is presented. Commonly, a search for solutions for a multi-objective problem, which is aimed at optimization, results in a set of Pareto optimal solutions. There are cases where more solutions should be also considered, nonetheless preserving the optimization inspiration. These solutions should not resemble the Pareto set, so as to provide diversity within the design space, and therefore they might not always be found by taking an epsilon-Pareto approach. With this motivation in mind, an already established method, which searches for diverse solutions, which are not all necessarily optimal, is herewith discussed and its shortages are highlighted. In contrast to the already established design method, the approach taken in this paper is to solve the multi-objective problem repeatedly, adding (automatically or interactively) at each run constraints, which are constructed, based on the obtained Pareto set. The motivation for the introduced approach comes from the need to generate a set of robot paths, which allow a mobile robot operator, flexibility in complying with different planning demands and a rapid response to a developing scenario. The methodology and the applicability of the approach are explained and demonstrated by utilizing multi-objective path planning problems.

[1]  Kalyanmoy Deb,et al.  Introducing Robustness in Multi-Objective Optimization , 2006, Evolutionary Computation.

[2]  Jürgen Branke,et al.  A Multi-population Approach to Dynamic Optimization Problems , 2000 .

[3]  Marco Laumanns,et al.  A Tutorial on Evolutionary Multiobjective Optimization , 2004, Metaheuristics for Multiobjective Optimisation.

[4]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[5]  Peter J. Rousseeuw,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[6]  David Wallace,et al.  Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach , 2006, GECCO.

[7]  Kalyanmoy Deb,et al.  Dynamic multiobjective optimization problems: test cases, approximations, and applications , 2004, IEEE Transactions on Evolutionary Computation.

[8]  Marco Laumanns,et al.  On the convergence and diversity-preservation properties of multi-objective evolutionary algorithms , 2001 .

[9]  Gary B. Lamont,et al.  Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art , 2000, Evolutionary Computation.

[10]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[11]  Kalyanmoy Deb,et al.  Unveiling innovative design principles by means of multiple conflicting objectives , 2003 .

[12]  A. Moshaiov,et al.  Concept-based interactive evolutionary computation for multi-objective path planning , 2004, Second IEEE International Conference on Computational Cybernetics, 2004. ICCC 2004..

[13]  Carlos A. Coello Coello,et al.  Recent Trends in Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.