An efficient algorithm for one-step planar compliant motion planning with uncertainty
- 1 December 1992
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 8 (1-6) , 195-208
- https://doi.org/10.1007/bf01758843
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On computability of fine motion plansPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Computing metric and topological properties of configuration-space obstaclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The complexity of planar compliant motion planning under uncertaintyAlgorithmica, 1990
- Compliant motion in a simple polygonPublished by Association for Computing Machinery (ACM) ,1989
- The complexity of planar compliant motion planning under uncertaintyPublished by Association for Computing Machinery (ACM) ,1988
- New lower bound techniques for robot motion planning problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Visibility of disjoint polygonsAlgorithmica, 1986
- Using Backprojections for Fine Motion Planning with UncertaintyThe International Journal of Robotics Research, 1986
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Force Feedback Control of Manipulator Fine MotionsJournal of Dynamic Systems, Measurement, and Control, 1977