An effective initialization method for genetic algorithm-based robot path planning using a directed acyclic graph

Citations

WEB OF SCIENCE

81
Citations

SCOPUS

126

초록

The goal of robot path planning is to find a feasible path that proceeds from a starting point to a destination point without intersecting any obstacles in the given environment. Recently, genetic algorithm-based robot path planning methods have been widely considered in the intelligent robotics community. Because the initialization process significantly influences the performance of the genetic algorithm, an effective initialization method is required. However, investigation on this subject is still lacking. In this paper, we propose an effective initialization method for genetic algorithm-based robot path planning. Experimental results comparing genetic algorithms with conventional initialization methods and the proposed initialization method showed that the proposed method leads to high quality paths in a significantly shorter execution time. (C) 2015 Elsevier Inc. All rights reserved.

키워드

Robot path planning; Genetic algorithm; Initialization; Directed acyclic graph; MOBILE ROBOTS; OPTIMIZATION; NAVIGATION; EFFICIENT
제목
An effective initialization method for genetic algorithm-based robot path planning using a directed acyclic graph
저자
Lee, Jaesung; Kim, Dae-Won
DOI
10.1016/j.ins.2015.11.004
발행일
2016-03
유형
Article
저널명
Information Sciences
권
332
페이지
1 ~ 18