Sensor-based navigation for car-like mobile robots based on a generalized Voronoi graph
Authors:
- Keiji NagataniKNKeiji Nagatani
- Yosuke IwaiYIYosuke Iwai
- Yutaka TanakaYTYutaka Tanaka
- 1 January 2003
- journal article
- Published by Taylor & Francis in Advanced Robotics
- Vol. 17 (5) , 385-401
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Topological simultaneous localization and mapping (SLAM): toward exact localization without explicit localizationIEEE Transactions on Robotics and Automation, 2001
- Obstacle distance for car-like robotsIEEE Transactions on Robotics and Automation, 1999
- Shortest Paths for a Car-like Robot to Manifolds in Configuration SpaceThe International Journal of Robotics Research, 1996
- Optimal paths for a car that goes both forwards and backwardsPacific Journal of Mathematics, 1990
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shapeAlgorithmica, 1987