The complexity of the free space for a robot moving amidst fat obstacles
- 31 December 1993
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 3 (6) , 353-373
- https://doi.org/10.1016/0925-7721(93)90007-s
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Algorithmic motion planningPublished by Taylor & Francis ,2004
- Point location in fat subdivisionsInformation Processing Letters, 1992
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figuresAlgorithmica, 1992
- Efficient Motion Planning for an L-Shaped ObjectSIAM Journal on Computing, 1992
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal spaceDiscrete & Computational Geometry, 1990
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal spaceAlgorithmica, 1987
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal spaceDiscrete & Computational Geometry, 1987
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriersJournal of Algorithms, 1987
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985
- On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriersCommunications on Pure and Applied Mathematics, 1983