Computing the configuration space for a convex robot on hypercube multiprocessors

Jing Fu Jenq, Wing Ning Li

Research output: Contribution to journalConference article

2 Scopus citations

Abstract

Computing the configuration space obstacles is an important problem in spatial planning for robotics applications. In this paper, we present 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(1) space which is asymptotically optimal for hypercube computers.

Original languageEnglish
Pages (from-to)160-167
Number of pages8
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
Publication statusPublished - 1 Dec 1995
EventProceedings of the 1995 7th IEEE Symposium on Parallel and Distributed Processing - San Antonio, TX, USA
Duration: 25 Oct 199528 Oct 1995

    Fingerprint

Cite this