On the general motion-planning problem with two degrees of freedom
- 1 October 1989
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 4 (5), 491-521
- https://doi.org/10.1007/bf02187744
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Solving the two-dimensional findpath problem using a line-triangle representation of the robotJournal of Algorithms, 1988
- Planar realizations of nonlinear davenport-schinzel sequences by segmentsDiscrete & Computational Geometry, 1988
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal spaceAlgorithmica, 1987
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriersJournal of Algorithms, 1987
- Generalized voronoi diagrams for moving a ladder. I: Topological analysisCommunications on Pure and Applied Mathematics, 1986
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985
- On the piano movers' problem: V. The case of a rod moving in three‐dimensional space amidst polyhedral obstaclesCommunications on Pure and Applied Mathematics, 1984
- On the Piano Movers' problem: IV. Various decomposable two‐dimensional motion‐planning problemsCommunications on Pure and Applied Mathematics, 1984
- On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifoldsAdvances in Applied Mathematics, 1983
- On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal BarriersThe International Journal of Robotics Research, 1983