A FAST MOTION PLANNING ALGORITHM FOR A MOBILE ROBOT USING A DISTANCE TRANSFORMATION IMAGE

被引:1
作者
SHIN, D
机构
[1] School of Science and Engineering, Waseda University, Tokyo
关键词
MOBILE ROBOT; DISTANCE TRANSFORMATION IMAGE; MOTION PLANNING; DEADLOCK;
D O I
10.1002/scj.4690250508
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes a new high-speed motion planning algorithm for the mobile robot functioning on the distance-transformation image. The method utilizes the property that the value of the distance transformation image represents the distance from the obstacle. By the proposed method, the robot can move by translation to the farthest possible point only by examining a small number of points on the straight-line of the progress. This makes it possible to realize the fast motion planning. When a deadlock is produced, a new posture of the robot is determined at the position so that the collision with the obstacle does not occur. Then, the part of the motion down to the initial point is regenerated. Finally, the speed of the proposed algorithm is compared to that of the conventional motion planning algorithm, and the fast operation is demonstrated experimentally.
引用
收藏
页码:88 / 99
页数:12
相关论文
共 8 条
[1]   SOLVING THE FIND-PATH PROBLEM BY GOOD REPRESENTATION OF FREE SPACE [J].
BROOKS, RA .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1983, 13 (02) :190-197
[2]   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
[3]   MULTIRESOLUTION PATH PLANNING FOR MOBILE ROBOTS [J].
KAMBHAMPATI, S ;
DAVIS, LS .
IEEE JOURNAL OF ROBOTICS AND AUTOMATION, 1986, 2 (03) :135-145
[4]   ALGORITHM FOR PLANNING COLLISION-FREE PATHS AMONG POLYHEDRAL OBSTACLES [J].
LOZANOPEREZ, T ;
WESLEY, MA .
COMMUNICATIONS OF THE ACM, 1979, 22 (10) :560-570
[5]  
MASE K, 1979, IEICE PRL7940 TECHN
[6]  
NOBORIO K, 1989, J ROBOT SOC JAP, V7, P403
[7]  
NOBORIO K, 1989, J ROBOT SOC JAP, V7, P414
[8]  
SHIN D, 1991, 42ND NAT C INF P SOC