By Topic

Computing the configuration space for a convex robot on hypercube multiprocessors

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)
Jing-Fu Jenq ; Dept. of Comput. Sci., Tennessee State Univ., Nashville, TN, USA ; Li, W.N.

Computing the configuration space obstacles is an important problem in spatial planning for robotics applications. In this paper we present a parallel algorithm for computing the configuration space obstacles by using hypercube multiprocessors. The digitized images of the obstacles and the robot are stored in an N×N image plane. An algorithm for handling robots whose shapes are arbitrary convex polygons was presented. Our algorithms take O(logN) time and O(I) space which is asymptotically optimal for hypercube computers

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on

Date of Conference:

25-28 Oct 1995