MOD* Lite: An Incremental Path Planning Algorithm Taking Care of Multiple Objectives


Oral T., POLAT F.

IEEE TRANSACTIONS ON CYBERNETICS, vol.46, no.1, pp.245-257, 2016 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 46 Issue: 1
  • Publication Date: 2016
  • Doi Number: 10.1109/tcyb.2015.2399616
  • Title of Journal : IEEE TRANSACTIONS ON CYBERNETICS
  • Page Numbers: pp.245-257
  • Keywords: Incremental path planning, multiobjective path planning (MOPP), OPTIMIZATION, ROBOTS

Abstract

The need for determining a path from an initial location to a target one is a crucial task in many applications, such as virtual simulations, robotics, and computer games. Almost all of the existing algorithms are designed to find optimal or suboptimal solutions considering only a single objective, namely path length. However, in many real life application path length is not the sole criteria for optimization, there are more than one criteria to be optimized that cannot be transformed to each other. In this paper, we introduce a novel multiobjective incremental algorithm, multiobjective D* lite (MOD* lite) built upon a well-known path planning algorithm, D* lite. A number of experiments are designed to compare the solution quality and execution time requirements of MOD* lite with the multiobjective A* algorithm, an alternative genetic algorithm we developed multiobjective genetic path planning and the strength Pareto evolutionary algorithm.