Robotics

Selected bibliography

• P. K. Agarwal and M. Sharir. Motion planning of a ball amid segments in three dimensions. In Proc. ACM-SIAM Symp. on Discrete Algorithms, 1999. (PostScript)

• P. K. Agarwal and M. Sharir. Pipes, cigars, and kreplach: The union of minkowski sums in three dimensions. In Proc. ACM Symp. on Computational Geometry, 1999. (PostScript)

• P. K. Agarwal, P. Raghavan, and H. Tamaki. Motion planning for a steering-constrained robot through moderate obstacles. In Proc. ACM Symp. on Theory of Computation, 1995. (PostScript)

• P. K. Agarwal, M. de Berg, D. Halperin, and M. Sharir. Efficient generation of k-directional assembly sequences. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 122-131, 1996. (PostScript)

• P. K. Agarwal, N. Amenta, B. Aronov, and M. Sharir. Largest placements and motion planning of a convex polygon. In Jean-Paul Laumond and Mark Overmars, editors, Algorithms for Robotic Motion and Manipulation, pages 143-154, Wellesley, MA, 1997. A. K. Peters. Proc. 1996 Workshop on the Algorithmic Foundations of Robotics. (PostScript)

• P. K. Agarwal, B. Aronov, and M. Sharir. Motion planning for a convex polygon in a polygonal environment. Technical Report CS-1997-17, Dept. Computer Science, Duke University, 1997. To appear in Discrete Comput. Geom. (PostScript)

• P. K. Agarwal, S. Har-Peled, M. Sharir, and K. R. Varadarajan. Approximate shortest paths on a convex polytope in three dimensions. J. ACM, 44:567-584, 1997. (PostScript)

• P. K. Agarwal, J.-C. Latombe, R. Motwani, and P. Raghavan. Nonholonomic path planning for pushing a disk among obstacles. In em Intl. Conf. Robotics and Auto., 1997. (PostScript)

• P. K. Agarwal, T. Biedl, S. Lazard, S. Robbins, S. Suri, and S. Whitesides. Curvature-constrained shortest paths in a convex polygon. In Proc. ACM Symp. on Computational Geometry, 1998. (PostScript)

• P. K. Agarwal, L. E. Kavraki, and M. T. Mason, editors. Robotics: The Algorithmic Perspective. A. K. Peters, Wellesley, 1998.

• J. Erickson, L. J. Guibas, J. Stolfi, and L. Zhang. Separation-sensitive collision detection for convex objects. In Proc. ACM-SIAM Symp. on Discrete Algorithms, 1999.

• S. B. Kang and P. K. Desikan. Virtual navigation of complex scenes using clusters of cylindrical panoramic images. In Proc. Graphics Interface, 1998.

• K. Varadarajan and P. K. Agarwal. Approximating shortest paths on a nonconvex polyhedron. In Proc. IEEE Symp. on Foundations of Comp. Sci., 1997. (PostScript)

• H. Wang and P. K. Agarwal. Approximation algorithms for curvature-constrained shortest paths. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 409-418, 1996. (PostScript)