A Hybrid Algorithm to Solute the Problem of the Robot Path Planning

被引：0

作者：

Yuan Quan-bo ^{[1
]}

Wang Hui-juan ^{[1
]}

Zhu Peng-hua ^{[1
]}

Zhao Hui ^{[1
]}

机构：

[1] N China Inst Aerosp Engn, Langfang 065000, Hebei, Peoples R China

来源：

MANUFACTURING SCIENCE AND TECHNOLOGY, PTS 1-8 | 2012年 / 383-390卷

关键词：

Artificial potential fields; Genetic Algorithm; Path planning;

D O I：

10.4028/www.scientific.net/AMR.383-390.385

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper analyzes the problems of artificial potential fields in robot path planning. A hybrid algorithm for robot path planning is proposed. Robot searching for path in artificial potential fields method, it is possible that the robot can't reach the goal because of local minimum, when it is best to use a genetic algorithm for robot. Simulation results show the effectiveness of the models, and it can effectively solve the problem caused by defects of artificial potential fields in the path planning.

引用

页码：385 / 389

页数：5

共 6 条

[1]

Goldberg EE., 1989, Genetic Algorithm in Searching, Optimization, and Machine Learning

[2]

Han WG, 1997, IEEE SYS MAN CYBERN, P2747, DOI 10.1109/ICSMC.1997.635354

[3]

Liu Jinkun, 2008, DESIGN ROBOT CONTROL, P680

[4]

NOBORU N, 1997, COMPUTERS ELECT AGR, V18, P187

[5]

Park MG, 2003, IEEE ASME INT C ADV, P735

[6]

Wang CM, 2002, IEEE CCEC 2002: CANADIAN CONFERENCE ON ELECTRCIAL AND COMPUTER ENGINEERING, VOLS 1-3, CONFERENCE PROCEEDINGS, P1652, DOI 10.1109/CCECE.2002.1013004

← 1 →