Compliant motion planning with geometric models

Authors:
C. Bajaj;M. Kim
Affiliations:
Department of Computer Science, Purdue University, West Lafayette, IN;Department of Computer Science, Purdue University, West Lafayette, IN
Venue:
SCG '87 Proceedings of the third annual symposium on Computational geometry
Year:
1987

Citing 13
Cited 3

Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm

SIAM Journal on Computing
Computer algebra: symbolic and algebraic computation (2nd ed.)

Computer algebra: symbolic and algebraic computation (2nd ed.)
Robot vision

Robot vision
Computing convolutions by reciprocal search

SCG '86 Proceedings of the second annual symposium on Computational geometry
Shortest paths on polyhedral surfaces

Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Automatic parameterization of rational curves and surfaces 1: conics and conicoids

Computer-Aided Design
The Calculation of Multivariate Polynomial Resultants

Journal of the ACM (JACM)
An algorithm for planning collision-free paths among polyhedral obstacles

Communications of the ACM
Representaiton of Rigid Solid Objects

Computer Aided Design: Modelling, Systems Engineering, CAD-Systems - CREST Advanced Course
On shortest paths in polyhedral spaces

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Geometric Ambiguities in Boundary Representations

Geometric Ambiguities in Boundary Representations
Collision Detection for Moving Polyhedra

Collision Detection for Moving Polyhedra
Motion Planning with Six Degrees of Freedom

Motion Planning with Six Degrees of Freedom

A bibliography of quantifier elimination for real closed fields

Journal of Symbolic Computation
Red-Blue intersection detection algorithms, with applications to motion planning and collision detection

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The complexity of planar compliant motion planning under uncertainty

SCG '88 Proceedings of the fourth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present algebraic algorithms to generate the boundary of configuration space obstacles arising from the translatory motion of objects amongst obstacles. In particular we consider obtaining compliant motion paths where a curved convex object with fixed orientation moves in continuous contact with the boundary of curved convex obstacles in three Dimensions. Both the boundaries of the objects and obstacles are given by patches of algebraic surfaces. We also give a method to obtain approximate geodesic paths on convex C-space obstacles with algebraic boundary surfaces.