Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts

International Journal of Robotics Research

Volumn 18, Issue 11, 1999, Pages 1119-1128

  Latombe, Jean Claude ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001209809     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/02783649922067753     Document Type: Article

References (64)

1. Alami, R., Laumond, J. P., and Siméon, T. 1995. Two manipulation planning algorithms. In Algorithmic Foundations of Robotics, WAFR'94, eds. K. Goldberg, D. Halperin, J. C. Latombe, and R. H. Wilson, 109-125. Natick, MA: A K Peters.
2. Amato, N. M., Bayazit, O. B., Dale, L. K., Jones, C., and Vallejo, D. 1998. Choosing good distance metrics and local planners for probabilistic roadmap methods. Paper presented at Proc. IEEE Int. Conf. on Robotics and Automation, Leuven Belgium.
3. Ambler, A. P., and Popplestone, R. J. 1975. Inferring the positions of bodies from specified spatial relationships. Artificial Intelligence 6(2):157-174.
4. Barraquand, J., and Latombe, J. C. 1989. On nonholonomic mobile robots and optimal maneuvering. Revue d'Intelligence Artificielle 3(2):77-103.
5. Barraquand, J., and Latombe, J. C. 1991. Robot motion planning: A distributed representation approach. Int. J. Rob. Res. 10(6):628-649.
6. Barraquand, J., and Latombe, J. C. 1993. Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles. Algorithmica 10(2-3-4):121-155.
7. Böhringer, K. F., Donald, B. R., Kavraki, L. E., and Lamiraux, F. 1999. Part orientation with one or two stable equilibria using programmable vector fields. Manuscript.
8. Böhringer, K. F., Donald, B. R., and MacDonald, N. C. 1996. What programmable vector fields can (and cannot) do: Force field algorithms for MEMS and vibratory parts feeders. Paper presented at Proc. IEEE Int. Conf. on Robotics and Automation, Minneapolis, MN 822-930.
9. Bregler, C., Covell, M., and Slaney, M. 1997. Video rewrite: Driving visual speech with audio. Paper presented at Proc. SIGGRAPH'97, Los Angeles, CA.
10. Briggs, A. J. 1989. An efficient algorithm for one-step planar compliant motion planning with uncertainty. Paper presented at Proc. 5th Annual Symp. Computational Geometry, Saarbrücken, Germany.
11. Brock, O., and Khatib, O. 1999. Elastic strips: A framework for integrated planning and execution. Paper presented at Proc. Int. Symp. Experimental Robotics.
12. Brooks, R., and Lozano-Pérez, T. 1983. A subdvision algorithm in configuration space for findpath with rotation. Paper presented at Proc. 8th Int. Joint Conf. on Artificial Intelligence (ICAI), Karlsruhe, Germany 799-806.
13. Canny, J. F. 1988. The Complexity of Robot Motion Planning. Cambridge, MA: MIT Press.
14. Casal, A., and Yim, M. 1999. Self-reconfiguration planning for a class of modular robots. Paper presented at Proc. SPIE Symp. on Intelligent Systems and Advanced Manufacturing, Boston, MA.
15. Chang, H., and Li, T. Y. 1995. Assembly maintainability study with motion planning. Paper presented at Proc. IEEE Int. Conf. on Robotics and Automation, Nagoya, Japan 1012-1019.
16. Delingette, H. 1998. Towards realistic soft tissue modeling in medical simulation. Rapport de Recherche No. 3506, INRIA, Sophia-Antipolis, France.
17. Erdmann, M., and Mason, M. 1988. An exploration of sensorless manipulation, IEEE Tr. on Robotics and Automation 4(4):369-379.
18. Goldberg, K. Y. 1993. Orienting polygonal parts without sensors. Algorithmica 10:201-225.
19. Gonzalez-Baños, H. H., Guibas, L. J., Latombe, J. C., LaValle, S. M., Lin, D., Motwani, R., and Tomasi, C. 1998. Motion planning with visibility constraints: Building autonomous observers. In Robotics Research - The Eighth Int. Symp., ed. Y. Shirai, and S. Hirose, 95-101. New York: Springer.
20. Guibas, L. J. 1998. Kinetic data structures: A state of the art report. In Robotics: The Algorithmic Perspective, 1998 WAFR, ed. P. K. Agarwal, L. E. Kavraki, and M. T. Mason, 191-209. Natick, MA: A K Peters.
21. Guibas, L. J., Halperin, D., Hirukawa, H. Latombe, J. C., and Wilson, R. H. 1998. Polyhedral assembly partitioning using maximally covered cells in arrangements of convex polygons. Int. J. of Computational Geometry and its Application 8(2):179-199.
22. Guibas, L. J., Latombe, J. C., LaValle, S. M., Lin, D., and Motwani, R. 1997. Visibility-based pursuit-evasion in a polygonal environment. Paper presented at Proc. 5th Int. Workshop on Algorithms and Data Structures (WADS'97), ed. F. Dehne, A. Rau-Chaplin, J. R. Sack, and R. Tamassia. Lecture Notes in Computer Science, Vol. 1272, 17-30.
23. Gupta, K., and del Pobil, A., eds. 1998. Practical Motion Planning in Robotics: Current Approaches and Future Directions. West Sussex, UK: Wiley.
24. Halperin, D., and Sharir, M. 1996. A Near-quadratic algorithm for planning the motion of a polygon in a polygonal environment. Discrete Comput. Geom. 16:121-134.
25. Han, C. S. 1999. Building design services in a distributed service architecture. Available on line: http://www-galerkin.stanford.edu/~ash/research. html.
26. Homem de Mello, L. S., and Sanderson, A. C. 1991. A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Tr. on Robotics and Automation 7(2):228-240.
27. Hsu, D., Kavraki, L. E, Latombe, J. C., Motwani, R., and Sorkin, S. 1998. On finding narrow passages with probabilistic roadmap planners. In Robotics: The Algorithmic Perspective, 1998 WAFR, ed. P. K. Agarwal, L. E. Kavraki, and M. T. Mason, 141-153. Natick, MA: A K. Peters.
28. Hsu, D., Latombe, J. C., and Motwani, R. 1997. Path planning in expansive configuration spaces. Paper presented at Proc. IEEE Int. Conf. on Robotics and Automation, Albuquerque, NM, 2719-2726.
29. Hsu, D., Latombe, J. C., and Sorkin, S. 1999. Placing a robot manipulator amid obstacles for optimized execution. Paper presented at Proc. IEEE Int. Symp. on Assembly and Task Planning (ISATP'99), Porto, Portugal.
30. Jones, R. E., Wilson, R. H., and Calton, T. L. 1997. Constraint-based interactive assembly planning. Paper presented at Proc. IEEE Int. Conf. on Robotics and Automation, Albequerque, NM 913-920.
31. Kavraki, L. E. 1997. Geometry and the discovery of new ligands. In Algorithms for Robotic Motion and Manipulation, 1996 WAFR, ed. J. P. Laumond and M. Overmars, 435-448. Natick, MA: A K Peters.
32. Kavraki, L. E., Lamiraux, F., and Holleman, C. 1998. Towards planning for elastic objects. In Robotics: The Algorithmic Perspective, 1998 WAFR, ed. P. K. Agarwal, L. E. Kavraki, and M. T. Mason, 313-326. Natick, MA: A K Peters.
33. Kavraki, L. E., Latombe, J. C., Motwani, R., and Raghavan, P. 1995. Randomized query processing in robot motion planning. Paper presented at Proc. ACM SIGACT Symp. on Theory of Computing (STOC), Las Vegas, NV, 353-362.
34. Kavraki, L. E., Švestka, P., Latombe, J. C., and Overmars, M. 1996. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Tr. on Robotics and Automation 12(4):566-580.
35. Khatib, O. 1986. Real-time obstacle avoidance for manipulators and mobile robots. Int. J. of Robotics Research 5(1):90-98.
36. Koga, Y., Kondo, K., Kuffner, J., and Latombe, J. C. 1994. Planning motions with intentions. Paper presented at Proc. SIGGRAPH'94, ACM, Orlando, FL 395-408.
37. Koga, Y., and Latombe, J. C. 1994. On multi-arm manipulation planning. Paper presented at Proc. IEEE Int. Conf. on Robotics and Automation, San Diego, CA 945-952.
38. Kotay, K., Rus, D., Vona, M., and McGray, C. 1998. The self-reconfiguring robotic module: Design and control algorithms. Robotics: The Algorithmic Perspective, 1998 WAFR, ed. P. K. Agarwal, L. E. Kavraki, and M. T. Mason, 375-386. Natick, MA: A K Peters.
39. Kuffner, J., and Latombe, J. C. 1999. Fast synthetic vision, memory, and learning for virtual humans. Paper presented at Proc. Computer Animation'99, IEEE, Geneva, Switzerland 118-127.
40. Latombe, J. C. 1991. Robot Motion Planning. Boston, MA: Kluwer Academic.
41. Latombe, J. C. 1995. Robot algorithms. Algorithmic Foundations of Robotics, WAFR'94, eds. K. Goldberg, D. Halperin, J. C. Latombe, and R. H. Wilson, 1-18. Natick, MA: A K Peters.
42. Laumond, J. P., Jacobs, P., Taix, M., and Murray, R. 1994. A motion planner for nonholonomic robots. IEEE Tr. on Robotics and Automation 10:577-593.
43. LaValle, S. M., and Kuffner, J. J. 1999. Randomized kinodynamic planning. Paper presented at Proc. IEEE Int. Conf. on Robotics and Automation, Detroit, MI.
44. Lazanas, A., and Latombe, J. C. 1995. Motion planning with uncertainty: A landmark approach. Artificial Intelligence 76(1-2):285-317.
45. Liebermann, L. I., and Wesley, M. A. 1977. AUTOPASS: An automatic programming system for computer controlled mechanical assembly. IBM J. of Res. and Dev. 21(4):321-333.
46. Lin, M. C., and Canny, J. F. 1991. Efficient algorithms for incremental distance computation. Paper presented at Proc. IEEE Int. Conf. on Robotics and Automation, Sacramento, CA 1008-1014.
47. Lozano-Pérez, T. 1976. The design of a mechanical assembly system, Tech. Rep. AI-TR 397, AI Lab, MIT, Cambridge, MA.
48. Lozano-Pérez, T. 1983. Statial planning: A configuration space approach. IEEE Tr. Computers C-32(2):108-120.
49. Lozano-Pérez, T., Mason, M. T., and Taylor, R. H. 1984. Automatic synthesis of fine-motion strategies for robots. Int. J. of Robotics Research 3:3-24.
50. Lozano-Pérez, T., and Wesley, M. A. 1979. An algorithm for planning collision-free paths among polyhedral obstacles. Comm. ACM 22(10):560-570.
51. Nilsson, N. J. 1969. A mobile automaton: An application of artificial intelligence techniques. Paper presented at Proc. 1st Int. Joint Conf. on Artificial Intelligence, Washington, DC, 509-520.
52. Quinlan, S. 1994. Efficient distance computation between non-convex objects. Paper presented at Proc. IEEE Int. Conf. on Robotics and Automation, San Diego, CA 3324-3329.
53. Reif, J. H. 1979. Complexity of the mover's problem and generalizations. Paper presented at Proc. FOCS, 421-427.
54. 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.
55. Singh, A. P., Latombe, J. C. and Brutlag, D. L. 1999. A motion planning approach to flexible ligand binding. Paper presented at Proc. ISMB'99.
56. Svestka, P., and Overmars, M. 1995. Coordinated motion planning for multiple car-like robots using probabilistic roadmaps. Paper presented at Proc. IEEE Int. Conf. on Robotics and Automation, Nagoya, Japan 1631-1636.
57. Takeda, H., Facchinetti, C., and Latombe, J. C. 1994. Planning the motions of a mobile robot in a sensory uncertainty field. IEEE Tr. on Pattern Analysis and Machine Intelligence 16(10):1002-1017.
58. Taylor, R. H. 1976. Synthesis of manipulator control programs from task-level specifications. Ph.D. dissertation, Department of Computer Science, Stanford University, Stanford, CA.
59. Tombropoulos, R. Z., Adler, J. R., and Latombe, J. C. 1999. CARABEAMER: A treatment planner for a robotic radiosurgical system with general kinematics. Medical Image Analysis 3(3):237-264.
60. Udupa, S. 1977. Collision detection and avoidance in computer controlled manipulators. Ph.D. dissertation, Department of Electrical Engineering, California Institute of Technology, Pasadena, CA.
61. Wilmarth, S. A., Amato, N. M., and Stiller, P. F. 1999. Motion planning for a rigid body using random networks on the medial axis of the free space. Paper presented at Proc. 15th Annual ACM Symp. on Computational Geometry (SoCG'99).
62. Wilson, A., Larsen, E., Lin, M. C., and Manocha, D. 1999. IMMPACT: Partitioning and handling massive models for interactive collision detection. Paper presented at Proc. Eurographics'99.
63. Wilson, R. H. and Latombe, J. C. 1995. Geometric reasoning about mechanical assembly. Artificial Intelligence 71:371-396.
64. Yim, M. 1993. A reconfigurable modular robot with multiple modes of locomotion. Paper presented at Proc. JSME Conf. on Advanced Mechatronics. Also see http://www.parc.xerox.com/spl/members/ yim/modrobots.html.