Sensor-based navigation for car-like mobile robots based on a generalized Voronoi graph

被引:22
作者
Nagatani, K
Iwai, Y
Tanaka, Y
机构
[1] Okayama Univ, Grad Sch Nat Sci & Technol, Okayama 7008530, Japan
[2] OMRON Corp, Open Control Business Dev Dept, Shinagawa Ku, Tokyo 1410032, Japan
关键词
mobile robot exploration; generalized Voronoi graph; non-holonomic constraint; Bezier curve;
D O I
10.1163/15685530360663409
中图分类号
TP24 [机器人技术];
学科分类号
080202 [机械电子工程]; 1405 [智能科学与技术];
摘要
Our research objective is to realize sensor-based navigation for car-like mobile robots. We adopt the generalized Voronoi graph (GVG) for the robot's local path and a map representation. It has the advantage to describe the mobile robot's path for sensor-based navigation from the point of view of completeness and safety. However, it is impossible to apply the path to car-like mobile robots directly, because the limitation of the minimum turning radius for a car-like robot may prevent it from following the GVG exactly. To solve this problem, we propose a local smooth path-planning algorithm for car-like mobile robots. Basically, an initial local path is generated by a conventional path-planning algorithm using GVG theory and it is modified smoothly by a Bezier curve to enable the car-like robots to follow it by maximizing our evaluation function. In this paper, we introduce a local smooth path-planning algorithm based on the GVG and explain the details of our evaluation function. Simulation and experimental results support the validity of the algorithm.
引用
收藏
页码:385 / 401
页数:17
相关论文
共 11 条
[1]
[Anonymous], 1996, Robot_motion_planning
[2]
Topological simultaneous localization and mapping (SLAM): Toward exact localization without explicit localization [J].
Choset, H ;
Nagatani, K .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2001, 17 (02) :125-137
[3]
CHOSET H, 1997, P IEEE INT C ADV ROB, P333
[4]
CHOSET H, 1996, P IEEE SICE RSJ INT, P241
[5]
PATH-PLANNING STRATEGIES FOR A POINT MOBILE AUTOMATON MOVING AMIDST UNKNOWN OBSTACLES OF ARBITRARY SHAPE [J].
LUMELSKY, VJ ;
STEPANOV, AA .
ALGORITHMICA, 1987, 2 (04) :403-430
[6]
Shortest paths for a car-like robot to manifolds in configuration space [J].
Moutarlier, P ;
Mirtich, B ;
Canny, J .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1996, 15 (01) :36-60
[7]
Nagatani K, 1998, IEEE INT CONF ROBOT, P342, DOI 10.1109/ROBOT.1998.676421
[8]
Nagatani K., 1999, Proceedings 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human and Environment Friendly Robots with High Intelligence and Emotional Quotients (Cat. No.99CH36289), P1687, DOI 10.1109/IROS.1999.811721
[9]
OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS [J].
REEDS, JA ;
SHEPP, LA .
PACIFIC JOURNAL OF MATHEMATICS, 1990, 145 (02) :367-393
[10]
Obstacle distance for car-like robots [J].
Vendittelli, M ;
Laumond, JP ;
Nissoux, C .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1999, 15 (04) :678-691