An approximation algorithm for d₁-optimal motion of a rod robot with fixed rotations

References

• Reif , J. Complexity of the movers problem and generalizations . Proceedings of the 20th IEEE Symposium on Foundations of Computer Science . pp. 420 – 427 .
   Google Scholar
• Schwartz , J. T. and Sharir , M. 1983 . On the piano movers' problem. I: The case of a rigid polygonal body moving amidst polygonal barriers . Communications on Pure and Applied Mathematics , 36 : 345 – 398 .
   Web of Science ®Google Scholar
• Schwartz , J. T. and Sharir , M. 1983 . On the piano movers' problem. II: General techniques for computing topological properties of real algebraic manifolds . Advances in Applied Mathematics , 4 : 298 – 351 .
   Google Scholar
• Schwartz , J. T. and Sharir , M. 1983 . On the piano movers' problem. III: Coordinating the motion of several independent bodies: the special case of circular bodies moving amidst polygonal barriers . Robotics Research , 2 : 46 – 75 .
   Web of Science ®Google Scholar
• Schwartz , J. T. and Sharir , M. 1985 . “ On the piano movers' problem. IV: Efficient motion planning algorithms in environments of bounded local complexity ” . Courant Institute, New York University . Technical Report 164
   Google Scholar
• Leven , D. and Sharir , M. An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers . Proceedings of the 1st Annual ACM Symposium on Computational Geometry . pp. 221 – 227 .
   Google Scholar
• Schwartz , J. T. and Sharir , M. 1984 . On the piano movers' problem. V: The case of a rod moving in three-dimensional space amidst polyhedral obstacles . Communications in Pure and Applied Mathematics , 37 : 815 – 848 .
   Web of Science ®Google Scholar
• Sifrony , S. and Sharir , M. A new efficient motion planning algorithm for a rod in polygonal space . Proceedings of the 2nd Annual ACM Symposium on Computational Geometry . pp. 178 – 185 .
   Google Scholar
• Icking , C. , Rote , G. , Welzl , E. and Yap , C. K. 1993 . Shortest paths for line segment . Algorithmica , 10 : 182 – 200 .
   Web of Science ®Google Scholar
• O'Rourke , J. 1987 . “ Finding a shortest ladder path: a special case ” . IMA Preprint Series 353 Institute for Mathematic and its Applications, University of Minnesota .
   Google Scholar
• Asano , T. , Kirkpatrick , D. and Yap , C. K. d 1 optimal motion for a rod . Proceedings of the 12th Annual ACM Symposium on Computational Geometry . pp. 252 – 263 .
   Google Scholar
• Asano , T. , Kirkpatrick , D. and Yap , C. K. d 1 minimizing the endpoint trace length of the rod motions amidst polygonal obstacles is NP-hard . Proceedings of the 15th Canadian Conference on Computational Geometry . pp. 10 – 13 .
   Google Scholar
• Papadimitriou , C. H. and Silverberg , E. B. 1987 . Optimal piecewise linear motion of an object among obstacles . Algorithmica , 2 : 523 – 539 .
   Web of Science ®Google Scholar
• Sharir , M. 1989 . “ A note on the Papadimitriou–Silverberg algorithm for planning optimal piecewise-linear motion of a ladder ” . Courant Institute, New York University . NYU Robotics Report, no. 188
   Google Scholar
• Asano , T. , Kirkpatrick , D. and Yap , C. K. Pseudo approximation algorithms, with applications to optimal motion planning . Proceedings of the 18th Annual ACM Symposium on Computational Geometry . pp. 170 – 178 .
   Google Scholar
• De Berg , D. , Van Kreveld , M. , Overmars , M. and Schwarzkopf , O. 1997 . Computational Geometry: Algorithms and Applications , Berlin : Springer . Chapters 2, 13, 15
   Google Scholar
• Choi , J. , Sellen , J. and Yap , C. K. Approximate Euclidean shortest path in 3-space . Proceedings of the 10th Annual ACM Symposium on Computational Geometry . pp. 41 – 48 .
   Google Scholar