Characteristics of a genetic based approach to path planning for mobile robots

被引:19
作者
Ashiru, I [1 ]
Czarnecki, C [1 ]
Routen, T [1 ]
机构
[1] DE MONTFORT UNIV, INTELLIGENT & ROBOT SYST RES GRP, DEPT COMP SCI, LEICESTER LE1 9BH, LEICS, ENGLAND
关键词
D O I
10.1006/jnca.1996.0012
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a novel intelligent path planning algorithm for mobile robots operating in cluttered environments. The formulation of the problem for solution by the genetic algorithm is described and experiments are performed to determine the most appropriate path representation. A novel path guidance mechanism termed displacement to goal minimization is described. Further, the approach proposed utilizes multiple constraints, the development of which is presented. The results show that utilizing the formulation proposed, the genetic algorithm can plan and optimize paths without placing restrictions on the shapes of the obstacles in the working environment. It is also shown that the best path optimization takes place when the path representation has a relatively large and flexible step size as well as a flexible direction change capacity. (C) 1996 Academic Press Limited
引用
收藏
页码:149 / 169
页数:21
相关论文
共 27 条
[1]  
AKISHITA S, 1990, P IEEE INT WORKSH IN, P413
[2]  
ASHIRU I, 1995, P EUR C MACH LEARN W
[3]   A SUBDIVISION ALGORITHM IN CONFIGURATION SPACE FOR FINDPATH WITH ROTATION [J].
BROOKS, RA ;
LOZANOPEREZ, T .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1985, 15 (02) :224-233
[4]  
CROWLEY JL, 1991, P 2 INT S EXP ROB, P329
[5]  
DAVIDOR Y, 1990, PROCEEDINGS OF THE 1990 IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND SOFTWARE ENGINEERING, P186
[6]  
DAVIDOR Y, 1993, P 3 INT C GEN ALG, P98
[7]  
DAVIS L, 1991, 4TH P INT C GEN ALG, P18
[8]  
Emmanuel T., 1994, Proceedings EURISCON '94. European Robotics and Intelligent Systems Conference, P130
[9]  
Goldberg DE, 1989, GENETIC ALGORITHMS S
[10]  
IKEGAMI T, 1992, P IEEE RSJ INT C ROB, P453