본문 바로가기
  • Home

Effective Robot Path Planning Method based on Fast Convergence Genetic Algorithm

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2015, 20(4), pp.25-32
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

서민관 1 Jaesung Lee 1 DaeWonKim 1

1중앙대학교

Accredited

ABSTRACT

The Genetic algorithm is a search algorithm using evaluation, genetic operator, natural selection to populational solution iteratively. The convergence and divergence characteristic of genetic algorithm are affected by selection strategy, generation replacement method, genetic operator when genetic algorithm is designed. This paper proposes fast convergence genetic algorithm for time-limited robot path planning. In urgent situation, genetic algorithm for robot path planning does not have enough time for computation, resulting in quality degradation of found path. Proposed genetic algorithm uses fast converging selection strategy and generation replacement method. Proposed genetic algorithm also uses not only traditional crossover and mutation operator but additional genetic operator for shortening the distance of found path. In this way, proposed genetic algorithm find reasonable path in time-limited situation.

Citation status

* References for papers published after 2023 are currently being built.