Dattasharma, Abhi and Keerthi, Sathiya S (1995) An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles. In: Theoretical Computer Science, 140 (2). pp. 205-230.
Restricted to Registered users only
Download (1775Kb) | Request a copy
This paper concerns the development of a piecewise linear Voronoi roadmap for translating a convex polyhedron in a three-dimensional (3-D) polyhedral world. In general the Voronoi roadmap is incomplete for motion planning, i.e., it can have several disjoint components in one connected component of free space. An analysis of the roadmap shows that incompleteness is caused by the occurrence of the following simple geometric structure: a polygon in the Voronoi surface containing one or more polygons inside it. We formally bring out the details of this geometric structure and give an efficient augmentation of the roadmap that makes it complete. We show that the roadmap has size $e= O(n^2Q^2l^2)$, where n is the total number of faces on the obstacles, Q is the total number of obstacles and I is the number of faces on the moving object. We also present an algorithm to construct the roadmap in $O((n + Ql)e+Q^2 log Q)$ time.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||21 Feb 2007|
|Last Modified:||19 Sep 2010 04:35|
Actions (login required)