1. Agarwal, P., Amenta, N., Aronov, B., & Sharir, M. (1996, August). Largest placements and motion planning of a convex polygon. In Proceedings 2nd Annual Workshop Algorithmic Foundations of Robotics, Toulouse, France (pp. 143-154).
2. Motion planning for a convex polygon in a polygonal environment;Agarwal;GEOMETRY: Discrete and Computational Geometry,1999
3. Alt, H., Fleischer, R., Kaufmann, M., Mehlhorn, K., Naher, S., Schirra, S., & Uhrig, C. (1990, June). Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. In Proceedings of the ACM Symposium on Computational Geometry, Berkeley, CA (pp. 281-289).
4. Nearly time-optimal paths for a ground vehicle;Anisi;Journal of Control Theory and Applications,2003
5. Barraquand, J., Kavraki, L., Latombe, J.-C., Li, T.-Y., Motwani, R., & Raghavan, P. (1996, October). A random sampling scheme for robot path planning. In G. Giralt & G. Hirzinger (Eds.), Proceedings of the 7th International Symposium on Robotics Research, Osaka, Japan (pp. 249-264). New York: Springer.