A survey of motion planning and related geometric algorithms
Open Access
- 31 December 1988
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 37 (1-3) , 157-169
- https://doi.org/10.1016/0004-3702(88)90053-7
Abstract
No abstract availableThis publication has 35 references indexed in Scilit:
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal spaceAlgorithmica, 1987
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagramAlgorithmica, 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
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 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: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal BarriersThe International Journal of Robotics Research, 1983