Robot Motion Planning: A Distributed Representation Approach

The International Journal of Robotics Research

Volumn 10, Issue 6, 1991, Pages 628-649

  Barraquand, Jérôme ^a   Latombe, Jean Claude ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL STATISTICS - MONTE CARLO METHODS; MECHANISMS - DEGREES OF FREEDOM; ROBOTS - COMPUTER SIMULATION; ROBOTS - MOBILE;

DISTRIBUTED REPRESENTATIONS; ROBOT PATH PLANNER;

CONTROL, MECHANICAL VARIABLES;

EID: 0026369737     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/027836499101000604     Document Type: Article

References (45)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. 1983. Data Structures and Algorithms. Reading, MA: Addison-Wesley.
2. Alami, R., Siméon, T., and Laumond, J.P. 1989. A geometrical approach to planning manipulation tasks—the case of discrete placements and grasps. In Miura, H., and Arimoto, S. (eds.): Robotics Research 5. Cambridge, MA: MIT Press, pp. 453-463.
3. Anderson, R.F., and Orey, S. 1976. Small random perturbations of dynamical systems with reflecting boundary. Nagoya Math. J. 60: 189-216.
4. Barnard, S.T. 1988. Stochastic stereo matching over scale. Int. J. Computer Vision. 2(4).
5. Barraquand, J. 1988. Markovian random fields in computer vision: Applications to seismic data understanding. Ph.D. dissertation. Dept. of Computer Vision, INRIA, Sophia- Antipolis, France. In French.
6. Barraquand, J., Langlois, B., and Latombe, J.C. 1989. Robot motion planning with many degrees of freedom and dynamic constraints. In Miura, H., and Arimoto, S. (eds.): Robotics Research 5. Cambridge, MA: MIT Press, pp. 435-444.
7. Barraquand, J., and Latombe, J.C. 1989 a. On nonholonomic mobile robots and optimal maneuvering. Revue d'Intelligence Artificielle 3(2):77-103. (Also In Proc. of the 4th IEEE Int. Symp. on Intelligent Control, Albany, NY: pp. 340-347.)
8. Barraquand, J., and Latombe, J.C. 1989 b. Robot Motion Planning: A Distributed Representation Approach. Report no. STAN-CS-89-1257. Dept. of Computer Science, Stanford University.
9. Barraquand, J., and Latombe, J.C. 1990. Controllability of mobile robots with kinematic constraints. Rep. no. STAN-CS-90-1317. Dept. of Computer Science, Stanford University.
10. Brooks, R.A., and Lozano-Pérez, T. 1983 (Karlsruhe). A subdivision algorithm in configuration space for findpath with rotation. Proc. of the 8th Int. Joint Conf. on Artificial Intelligence, pp. 799-806.
11. Canny, J.F. 1988. The Complexity of Robot Motion Planning. Cambridge, MA: MIT Press.
12. Cerny, V. 1985. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J. Optimization Theory Applications. 45(1):41-51.
13. Donald, B.R. 1984. Motion planning with six degrees of freedom. Tech. rep. 791. Artificial Intelligence Laboratory, MIT.
14. Erdmann, M., and Lozano-Pérez, T. 1986. On multiple moving objects. AI memo no. 883. Artificial Intelligence Laboratory, MIT.
15. Faverjon, B. 1984 (Atlanta). Obstacle avoidance using an octree in the configuration space of a manipulator. Proc. of the IEEE Int. Conf. on Robotics and Automation, pp. 504-512.
16. Faverjon, B. 1986 (San Francisco). Object level programming of industrial robots. Proc. of the IEEE Int. Conf. on Robotics and Automation, pp. 1406-1412.
17. Faverjon, B., and Tournassoud, P. 1987 (Raleigh, NC). A local based approach for path planning of manipulators with a high number of degrees of freedom. Proc. of the IEEE Int. Conf. on Automation and Robotics, pp. 1152-1159.
18. Geman, D., and Geman, S. 1984. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Analysis Machine Intelligence PAMI-6: 721-741.
19. Geman, S., and Hwang, C.R. 1986. Diffusions for global optimization. SIAM J. Control Optimization 24(5).
20. Gouzènes, L. 1984. Strategies for solving collision-free trajectories problems for mobile and manipulator robots. Int. J. Robot. Res. 3(4):51-65.
21. Kant, K., and Zucker, S.W. 1986. Toward efficient trajectory planning: Path velocity decomposition. Int. J. Robot. Res. 5: 72-89.
22. Khatib, O. 1986. Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robot. Res. 5(1):90-98.
23. Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P. 1983. Optimization by simulated annealing. Science 220: 671-680.
24. Koditschek, D.E. 1987 (Raleigh, NC). Exact robot navigation by means of potential functions: Some topological considerations. Proc. of the IEEE Int. Conf. on Robotics and Automation, pp. 1-6.
25. Latombe, J.C. 1990. Robot Motion Planning. Boston: Kluwer Academic Publishers.
26. Laugier, C., and Germain, F. 1985 (Tokyo). An adaptative collision-free trajectory planner. Int. Conf. on Advanced Robotics.
27. Lee, D.T., and Drysdale, R.L. 1981. Generalization of Voronoi diagrams in the plane. SIAM J. Computing 10: 73-87.
28. Lozano-Pérez, T. 1983. Spatial planning: A configuration space approach. IEEE Trans. Computers C-32(2):108-120.
29. Lozano-Pérez, T. 1987. A simple motion-planning algorithm for general robot manipulators. IEEE J. Robot. Automat. RA-3(3):224-238.
30. Lumelsky, V. 1987 (Los Angeles). Algorithmic issues of sensor-based robot motion planning. Proc. of the 26th IEEE Conf. on Decision and Control, pp. 1796-1801.
31. Métivier, C., and Urbschat, R. 1990. Run-time statistical analysis of a robot motion planning algorithm. Internal technical note. Robotics Laboratory, Dept. of Computer Science, Stanford University.
32. Nilsson, N.J. 1980. Principles of Artificial Intelligence. Los Altos, California: Morgan Kaufmann.
33. O'Donnell, P.A., and Lozano-Pérez, T. 1989 (Scottsdale, AZ). Deadlock-free and collision-free coordination of two robot manipulators. Proc. of the IEEE Int. Conf. on Robotics and Automation, pp. 484-489.
34. Ó'Dúnlaing, C., Sharir, M., and Yap, C.K. 1983 (Boston). Retraction: A new approach to motion planning. Proc. of the 15th ACM Symp. on the Theory of Computing, pp. 207-220.
35. Papoulis, A. 1965. Probability, Random Variables, and Stochastic Processes. New York: McGraw-Hill.
36. Reif, J.H. 1979. Complexity of the mover's problem and generalizations. Proc. of the 20th Symp. on the Foundations of Computer Science, pp. 421-427.
37. Rimon, E., and Koditschek, D.E. 1989 (Scottsdale, AZ). The construction of analytic diffeomorphisms for exact robot navigation on star worlds. Proc. of the IEEE Int. Conf. on Robotics and Automation, pp. 21-26.
38. Schwartz, J.T., and Sharir, M. 1983 a. On the piano movers' problem: I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers. Comm. Pure Applied Math. 36: 345-398.
39. Schwartz, J.T., and Sharir, M. 1983 b. On the piano movers' problem: II. General techniques for computing topological properties of real algebraic manifolds. Adv. Applied Math. 4: 298-351.
40. Schwartz, J.T., and Sharir, M. 1983 c. On the piano movers' problem: III. Coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal barriers. Int. J. Robot. Res. 2(3):46-75.
41. Schwartz, J.T., and Sharir, M. 1988. A survey of motion planning and related geometric algorithms. Artificial Intelligence 37(1-3):157-169.
42. Schwartz, J.T., Sharir, M., and Hopcroft, J. 1987. Planning, Geometry, and Complexity of Robot Motion. Nor-wood, NJ: Ablex.
43. Sechen, C. 1988. VLSI Placement and Global Routing Using Simulated Annealing Boston, MA: Kluwer Academic Publishers.
44. Serra, J. 1982. Image Analysis and Mathematical Morphology. New York: Academic Press.
45. Zhu, D., and Latombe, J.C. 1989. New heuristic algorithms for efficient hierarchical path planning. Rep. no. STAN-CS-89-1279. Dept. of Computer Science, Stanford University.