A simple algorithm for complete motion planning of translating polyhedral robots

International Journal of Robotics Research

Volumn 25, Issue 11, 2006, Pages 1049-1070

  Varadhan, Gokul ^a   Krishnan, Shankar ^b   Sriram, T V N ^a   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Configuration space; Deterministic sampling; Robot motion planning; Star shaped roadmaps

Indexed keywords

CONFIGURATION SPACE; DETERMINISTIC SAMPLING; ROBOT MOTION PLANNING; STAR-SHAPED ROADMAPS;

ALGORITHMS; COMPUTATION THEORY; DEGREES OF FREEDOM (MECHANICS); ELECTRIC CONNECTORS; ROBOTICS;

MOTION PLANNING;

EID: 33750182283     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364906071199     Document Type: Article

References (49)

1. Amato, N., Bayazit, O. B., Dale, L. K., Jones, C., and Vallejo, D. 1998. OBPRM: An obstacle-based PRM for 3D workspaces. Workshop on Algorithmic Foundations of Robotics, eds, P. K. Agarwal, L. E. Kavraki and M. Mason. A. K. Peters, Wellesley, MA.
2. Amenta, N. and Bern, M. 1998. Surface reconsruction by Voronoi filtering. ACM Symposium on Computational Geometry, pp. 39-48.
3. Aronov, B. and Sharir, M. 1994. On translational motion planning in 3-space. ACM Symposium on Computational Geometry, pp. 21-30.
4. Avnaim, F., Boissonnat, J. D., and Faverjon, B. 1988. A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles. Proceedings of 5th IEEE International Conference on Robotics and Automation, pp. 1656-1661.
5. Avnaim, F. and Boissonnat, J. D. 1989. Practical exact motion planning of a class of robots with three degrees of freedom. Proceedings of Canadian Conference on Computational Geometry, p. 19-19.
6. Barraquand, J., Kavraki, L., Latombe, J.-C., Motwani, R., Li, T.-Y., and Raghavan, P. 1997. A random sampling scheme for path planning. International Journal of Robotics Research 16 (6). 759-774.
7. Basch, J., Guibas, L. J., Hsu, D., and Nguyen, A. T. 2001. Disconnection proofs for motion planning. in International Conference on Robotics and Automation, pp. 1765-1772.
8. Boor, V., Overmars, M. H., and van der Stappen, A. F. 1999. The gaussian sampling strategy for probabilistic roadmap planners. Iinternational Conference on Robotics and Automation, pp. 1018-1023.
9. Branicky, M., Lavalle, S., Olson, K., and Yang, L. 2001. Quasirandomized path planning. cite-seer.ist.psu.edu/branicky01quasirandomized.html
10. Brooks, R. A. and Lozano-Pérez, T. 1985. A subdivision algorithm in configuration space for findpath with rotation. IEEE Transactions on Systems SMC-15: 224-233.
11. Canny, J. 1988, The Complexity of Robot Motion Planning. Series ACM Doctoral Dissertation Award. MIT Press.
12. Choset, H., Burgard, W., Hutchinson, S., Kantor, G., Kavraki, L. E., Lynch, K., and Thrun, S. 2004. Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press.
13. Donald, B. R. 1984. Motion planning with six degrees of freedom. Master's thesis, MIT Artificial Intelligence Laboratory, aI-TR-791.
14. Edelsbrunner, H. 1987. Algorithms in Combinatorial Geometry, Series EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, vol. 10.
15. Ghosh, S. K. and Mount, D. M. 1987. An output sensitive algorithm for computing visibility graphs. Proceedings of 28th Annual IEEE Symposium Foundations of Computer Science, pp. 11-19.
16. Guibas, L. J. and Hershberger, J. 1985. Computing the visibility graph of n line segments in O(n2) time. Bulletin EATCS 26: 13-20.
17. Halperin, D. 2002. Robust geometric computing in motion. International Journal of Robotics Research 21 (3). 219-232.
18. Hoffmann, C. 1989. Geometric and Solid Modeling. Morgan Kaufmann, San Mateo, CA.
19. Hoffmann, C. 2001. Robustness in geometric computations. Journal of Computing and Information Science in Engineering 1: 143-156.
20. Hsu, D., Kavraki, L. E., Latombe, J.-C., Motwani, R., and Sorkin, S. 1998. On finding narrow passages with probabilistic roadmap planners. Wellesley, MA: A. K. Peters, to appear.
21. Hsu, D., Latombe, J.-C., and Motwani, R. 1999. Path planning in expansive configuration spaces. International Journal of Computational Geometry and Applications 9 (4 & 5). 495-512.
22. Hsu, D., Jiang, T., Reif, J. H., and Sun, Z. 2003. The bridge test for sampling narrow passages with probabilistic roadmap planners. International Conference on Robotics and Automation, pp. 4420-4426.
23. Kavraki, L., Kolountzakis, M., and Latombe, J. 1996. Analysis of probabilistic roadmaps for path planning. cite-seer.ist.psu.edu/article/ kavraki98analysis.html
24. Kavraki, L. and Latombe, J. C. 1994. Randomized preprocessing of configuration space for fast path planning. IEEE Conference on Robotics and Automation, pp. 2138-2145.
25. Kavraki, L., Svestka, P., Latombe, J. C., and Overmars, M. 1996. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions Robotics and Automation, 12 (4). 566-580.
26. Kedem, K. and Sharir, M. 1988. An automatic motion planning system for a convex polygonal mobile robot in 2-d polygonal space. ACM Symposium on Computational Geometry, pp. 329-340.
27. Latombe, J. 1991. Robot Motion Planning. KluwerAcademic Publishers.
28. Latombe, J. 1999. Motion planning: A journey of robots, molecules, digital actors, and other artifacts. International Journal of Robotics Research 18 (11). 1119-1128.
29. Lee, D. T. 1978. Proximity and reachability in the plane. Dept. Electrical Engineering, University of Illinois, Urbana, IL, Report R-831.
30. Lin, M. and Manocha, D. 2003. Collision and proximity queries. In Handbook of Discrete and Computational Geometry.
31. Lozano-Pérez, T. 1983. Spatial planning: A configuration space approach. IEEE Transactions on Computers C- 32: 108-120.
32. Lozano-Pérez, T. and Wesley, M. 1979. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM 22 (10). 560-570.
33. Ó'Dúnlaing, C., Sharir, M., and Yap, C. K. 1983. Retraction: A new approach to motion-planning. Proceedings of 15thAn-nual ACM Symposium on Theory of Computing, pp. 207-220.
34. O'Rourke, J. Art Gallery Theorems and Algorithms. The International Series of Monographs on Computer Science. Oxford University Press, New York.
35. Overmars, M. H. and Svestka, P. 1995. A probabilistic learning approach to motion planning. WAFR: Proceedings of the Workshop on Algorithmic Foundations of Robotics, A. K. Peters, Natick, MA, pp. 19-37.
36. Redon, S. and Lin, M. C. 2005. Practical local planning in the contact space. Proceedings of IEEE International Conference on Robotics and Automation.
37. Sacks, E. 1999. Practical sliced configuration space for curved planar pairs. International Journal of Robotics Research 18 (1). 59-63.
38. Schwartz, J. T. and Sharir, M. 1983. On the piano movers probelem ii, general techniques for computing topological properties of real algebraic manifolds. Advances in Applied Maths 4: 298-351.
39. Sharir, M. 1997. Algorithmic motion planning. In Handbook of Discrete and Computational Geometry (eds J. E. Goodman and J. O'Rourke) pp. 733-754, CRC Press, Boca Raton, FL.
40. Simeon, T., Laumond, J. P., and Nissoux, C. 2000. Visibility based probabilistic roadmaps for motion planning. Advanced Robotics Journal 14 (6). 477-493.
41. Snyder, J. M. 1992. Interval analysis for computer graphics. Computer Graphics (SIGGRAPH '92 Proceedings), ed. E. E. Catmull, vol. 26, July, pp. 121-130.
42. van der Stappen, A. F. and Overmars, M. H. 1994. Motion planning amidst fat obstacles. ACM Symposium on Computational Geometry, pp. 31-40.
43. Varadhan, G. 2005. Accurate sampling-based algorithms for surface extraction and motion planning. Doctoral Dissertation, University of North Carolina at Chapel Hill.
44. Varadhan, G., Krishnan, S., Sriram, T. V. N., and Manocha, D. 2004a. Topology preserving surface extraction using adaptive subdivision. Eurographics Symposium on Geometry Processing.
45. Varadhan, G., Krishnan, S., Sriram, T. V. N., and Manocha, D. 2004b. A simple algorithm for complete motion planning of translating polyhedral robots. Workshop on Algorithmic Foundations of Robotics.
46. Vleugels, J. and Overmars, M. 1997. Approximating Voronoi diagrams of convex sites in any dimension. International Journal of Computational Geometry and Applications 8: 201-222.
47. Wilmarth, S. A., Amato, N. M., and Stiller, P. F. 1999. Maprm: A probabilistic roadmap planner with sampling on the me-dial axis of the free space. IEEE Conference on Robotics and Automation, pp. 1024-1031.
48. Zhang, L., Kim, Y., Varadhan, G., and Manocha, D. 2005. Fast c-obstacle query computation for motion planning. Submitted for publication.
49. Zhu, D. and Latombe, J. 1990. Constraint reformulation in a hierarchical path planner. Proceedings of International Conference on Robotics and Automation, pp. 1918-1923.