Multiple Objective Genetic Algorithms for Path-planning Optimization in Autonomous Mobile Robots

  • Authors:
  • Oscar Castillo;Leonardo Trujillo;Patricia Melin

  • Affiliations:
  • Deptartment of Computer Science, Tijuana Institute of Technology, Tijuana, Mexico;Deptartment of Computer Science, Tijuana Institute of Technology, Tijuana, Mexico;Deptartment of Computer Science, Tijuana Institute of Technology, Tijuana, Mexico

  • Venue:
  • Soft Computing - A Fusion of Foundations, Methodologies and Applications - Fuzzy-neural computation and robotics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes the use of a genetic algorithm (GA) for the problem of offline point-to-point autonomous mobile robot path planning. The problem consists of generating “valid” paths or trajectories, for an Holonomic Robot to use to move from a starting position to a destination across a flat map of a terrain, represented by a two-dimensional grid, with obstacles and dangerous ground that the Robot must evade. This means that the GA optimizes possible paths based on two criteria: length and difficulty. First, we decided to use a conventional GA to evaluate its ability to solve this problem (using only one criteria for optimization). Due to the fact that we also wanted to optimize paths under two criteria or objectives, then we extended the conventional GA to implement the ideas of Pareto optimality, making it a multi-objective genetic algorithm (MOGA). We describe useful performance measures and simulation results of the conventional GA and of the MOGA that show that both types of GAs are effective tools for solving the point-to-point path-planning problem.