Constrained Multi-objective Biogeography Optimization Algorithm for Robot Path Planning

Constrained multi-objective optimization involves multiple objectives subjected to some equality or inequality constraints so that it may require search a set of non-dominated feasible solutions. Inspired from this, in this paper, a novel constrained multi-objective biogeography optimization algorithm is proposed and used for solving robot path planning problem since it can be defined as a constrained multi-objective optimization problem. Experimental results compared with Non-dominated Sorting Genetic AlgorithmII show that the proposed algorithm has better performance.