Efficient algorithms for planning purely translational collision-free motion in two and three dimensions
- 23 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 1326-1331
- https://doi.org/10.1109/robot.1987.1087897
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Planar realizations of nonlinear Davenport-Schinzel sequences by segmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- A fast algorithm for the Boolean masking problemComputer Vision, Graphics, and Image Processing, 1985
- An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstaclesPublished by Association for Computing Machinery (ACM) ,1985
- An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Constructing arrangements of lines and hyperplanes with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- A kinetic framework for computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979