By Topic

Scanline algorithms in robot path planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tokuta, A. ; Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA ; Hughes, K.

The problem of finding a path for a mobile robot in two dimensions among stationary obstacles using a free-space graph representation of the robot's workspace is examined. One problem with solutions of this type has been the time it takes to construct a graph from the image of the workspace. Two solutions are presented which seek to resolve this situation by constructing the graph representation `on the fly' in a scanline fashion by processing the image one line at a time from top to bottom. Each method consists of three processes: one which breaks the obstacles in the image into pseudo-obstacles, another which analyzes the pseudo-obstacles and locates regions in the free space which represent nodes in the graph, and a third which completes the graph by locating similarities of the free space regions and uses them as edges. The modularity lends itself toward pipelined processing to reach the solution. Discussions are presented and results given of the graph construction process and the paths found on sample images as well as comparative times

Published in:

Robotics and Automation, 1990. Proceedings., 1990 IEEE International Conference on

Date of Conference:

13-18 May 1990