Gross Motion Planning—A Survey

ACM Computing Surveys (CSUR)

Volumn 24, Issue 3, 1992, Pages 219-291

  Hwang, Yong K ^a   Ahuja, Narendra ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

collision detection; computational geometry; implementation; motion planning; obstacle avoidance; path planning; spatial representation

Indexed keywords

ARTIFICIAL INTELLIGENCE; HEURISTIC PROGRAMMING; MOTION CONTROL; OBSTACLE DETECTORS; PROXIMITY SENSORS; SPATIAL VARIABLES CONTROL;

COLLISION DETECTION; GROSS MOTION PLANNING; OBSTACLE AVOIDANCE; PATH PLANNING; SPATIAL REPRESENTATION;

ROBOTICS;

EID: 0026913154     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/136035.136037     Document Type: Article

References (181)

1. AHUJA, N., AND SCHACHTER, B. 1983. Pattern Models. Wiley, New York.
2. ALAMI, R., SIMÉON, T., AND LAUMOND, J. P. 1989. A geometric approach to planning manipulation tasks. The case of discrete placements and grasps. In Proceedings of the 5th International Symposium of Robotics Research (Tokyo, Aug. 28-31), MIT Press, Cambridge, Mass. pp. 453-463.
3. ALT, H., FLEISCHER, R., KAUFMANN, M., MEHLHORN, K., NÄHER, S., SCHIRRA, S., AND UHRIG, C. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. In Proceedings of the 5th Annual ACM Symposium on Computational Geometry (Berkeley, Calif., June 6-8). ACM, New York, pp. 281-289.
4. ASANO, T., ASANO, T., GUIBAS, L., HERSHBERGER, J., AND IMAI, H. 1985. Visibility-polygon search and Euclidean shortest path. In The 26th Symposium on Foundations of Computer Science (Portland, Oreg., Oct. 21-23) pp. 155-164.
5. ATALLAH, M. J., AND CHEN, D. Z. 1989. Optimal parallel algorithms for visibility of a simple polygon from a point. In Proceedings of the 5th Annual ACM Symposium on Computational Geometry (Berkeley, Calif., June 6-8). ACM, New York, pp. 114-123
6. ATALLAH, M. J., COLE, R., AND GOODRICH, M. T. 1989. Cascading divide-and-conquer: A technique for designing parallel algorithms. SIAM J. Comput. 18, 3 (June), 499-532.
7. ATHENS, M., AND FALBS, P. L. 1966 Optimal Control. McGraw-Hill, New York.
8. AURENHAMMER, F. 1991. Voronoi diagrams-A survey of fundamental geometric data structure. ACM Comput. Surv. 23, 3 (Sept.), 345-405.
9. AVNAIM, F., BOISSONNAT, J. D., AND FAVERJON, B. 1988 A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE. New York, pp. 1656-1661.
10. BARR, A., AND FEIGENBAUM, E. A. 1981. The Handbook of Artificial Intelligence. William Kaufmann, Los Altos, Calif.
11. BARRAQUAND, J., AND LATOMBE, J. C 1990 A Monte-Carlo algorithm for path planning with many degrees of freedom. In Proceedings of the IEEE International Conference on Robotics and Automation (Cincinnati, May 13-18). IEEE. New York, pp. 1712-1717.
12. BOBROW, J. E., DUBOWSKY, S., AND GIBSON, J. S. 1985. Time-optimal control of robotic manipulators along specified paths. Int. J. Robotics Res. 4, 3 (Fall), 3-17.
13. BOISSIERE, P. T., AND HARRIGAN, R. W. 1988. Telerobotic operation of conventional robot manipulators. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 576-583.
14. BRANICKY, M., AND NEWMAN, W. 1990. Rapid computation of configuration obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation (Cincinnati, May 13-18). pp. 304-310
15. BROOKS, R. A. 1983. Solving the Findpath problem by good representation of free space. IEEE Trans. Syst., Man, and Cybernetics SMC-13, 3 (Mar./Apr.), 190-197.
16. BROOKS, R. A., AND LOZANO-PÉREZ, T. 1983. A subdivision algorithm in configuration space for Findpath with rotation. In The International Joint Conference on Artificial Intelligence (Karlsruhe, Germany, Aug 8-12). William Kaufmann, Inc., Los Altos, Calif, pp. 799-806.
17. BRYSON, A. E., JR., AND HO, Y. C. 1975. Applied Optimal Control. Hemisphere Publishing, Washington, D.C.
18. BUCKLEY, S. J. 1989. Fast motion planning for multiple moving robots. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). pp. 322-326.
19. CANNY, J. F. 1988. The Complexity of Robot Motion Planning. The MIT Press, Cambridge, Mass.
20. CANNY, J. F 1987. A new algebraic method for robot motion planning and real geometry In Proceedings of the 28th Annual Symposium on Foundations of Computer Science (Los Angeles, Oct 12-14). IEEE, Washington, D.C., pp 39-48.
21. CANNY, J. F., AND DONALD, B. 1987. Simplified Voronoi diagram. In Proceedings of the 3rd Annual ACM Symposium on Computational Geometry (Waterloo, Ontario, June 8-10). ACM Press, New York, pp 153-161
22. CANNY, J. F., AND LIN, M. C. 1900. An opportunistic global path planner. In Proceedings of the IEEE International Conference on Robotics and Automation (Cincinnati, May 13-18). IEEE, New York, pp. 1554-1561.
23. CANNY, J. F., AND REIF, J. 1987. New lower bound techniques for robot motion planning problems. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science (Los Angeles, Oct. 12-14). IEEE. New York, pp. 49-60.
24. CANNY, J. F., DONALD, B., REIF, J., AND XAVIER, P. 1988. On the complexity of kinodynamic planning. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science (White Plains, New York, Oct. 24-26). IEEE, New York, pp. 306-315.
25. CANNY, J. F., REGE, A., AND REIF, J. 1990. An exact algorithm for kinodynamic planning in the plane. In Proceedings of the 6th Annual ACM Symposium on Computational Geometry (Berkeley, Calif, June 6-8). ACM, New York, pp. 271-280.
26. CHATILA, R. 1982. Path planning and environment learning in a mobile robot system. In Proceedings of the European Conference on Artificial Intelligence (Orsay, France, July 12-14). pp. 211-215.
27. CHATILA. R., AND LAUMOND, J. P. 1985. Position referencing and consistent world modeling for mobile robots. In Proceedings of the IEEE International Conference on Robotics and Automation (St Louis). IEEE, New York, pp. 138-145.
28. CHATTERGY, R. 1985. Some heuristics for the navigation of a robot. Int. J. Robotics Res. 4, 1 (Spring), 59-66.
29. CHEN, J., AND HAN, Y. 1990. Shortest paths on a polyhedron. In Proceedings of the 6th Annual ACM Symposium on Computational Geometry (Berkeley, Calif., June 6-8). ACM, New York, pp. 360-369.
30. CHEN, P. C., AND HWANG, Y. K. 1992. SANDROS: A motion planner with performance proportional to task difficulty. In Proceedings of the IEEE International Conference on Robotics and Automation (Nice, France, May 12-14). IEEE, New York, pp. 2346-2353.
31. CHEN, P. C., AND HWANG, Y. K. 1991. Practical path planning among movable obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation (Sacramento, Apr. 7-12). ACM, New York, pp. 444-449.
32. CHEN, Y. C., AND VIDYASAGAR, M. 1988. Optimal trajectory planning for planner n-link revolute manipulators in the presence of obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 202-208.
33. CHEUNG, E., AND LUMELSKY, V. 1988. Motion planning for robot arm manipulators with proximity sensing. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 740-745.
34. CHEW, L. P. 1985. Planning the shortest path for a disc in O(n2 log n) time. In Proceedings of the 1st Annual ACM Symposium on Computational Geometry (Baltimore, June 5-7). ACM, New York, pp. 214-220.
35. CHIEN, Y. P., KOIVO, A. J., AND LEE, B. H. 1988. On-line generation of collision free trajectories for multiple robots. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 209-211.
36. CHUANG, J., AND AHUJA, N. 1991a. Path planning using the Newtonian potential. In Proceedings of the IEEE International Conference on Robotics and Automation (Sacramento, Apr. 7-12). IEEE, New York, pp. 558-563.
37. CHUANG, J., AND AHUJA, N. 1991b. Skeletonization using a generalized potential field model. In The 8th Israeli Symposium on Artificial Intelligence and Computer Vision (Dec. 30-31).
38. CLARKSON, K. L., KAPOOR, S., AND VAIDYA, P. M. 1987. Rectilinear shortest paths through polygonal obstacles in O(n (log n)2) time. In Proceedings of the 3rd Annual ACM Symposium on Computational Geometry (Waterloo, Ontario, June 8-10). ACM, New York, pp. 251-257.
39. COLLINS, G. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In The 2nd GI Conference on Automata Theory and Formal Languages, vol. 33. Springer-Verlag, New York, pp. 134-183.
40. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. McGraw-Hill, New York, pp. 916-963.
41. DE REZENDE, P. J., LEE, D. T., AND WU, Y. F. 1985. Rectilinear shortest paths with rectangular barriers. In Proceedings of the 1st Annual ACM Symposium on Computational Geometry (Baltimore, June 5-7). ACM, New York, pp. 204-213.
42. DIJKSTRA, E. W. 1959. A note on two problems in connection with graphs. Numerische Mathematik 1. 269-271. In English.
43. DONALD, B. 1984. Motion planning with six degrees of freedom, Tech. Rep. AI-TR-791, Artificial Intelligence Lab., Massachusetts Inst. of Technology, Cambridge, Mass.
44. DONALD, B., AND JENNINGS, J. 1991. Sensor interpretation and task-directed planning using perceptual equivalence class. In Proceedings of the IEEE International Conference on Robotics and Automation (Sacramento, Apr. 7-12). IEEE, New York, pp. 190-197.
45. DONALD, B., AND XAVIER, P. 1989. A provably good approximation algorithm for optimal time trajectory planning. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). IEEE, New York, pp. 958-963.
46. DRYSDALE, R. L. 1979. Generalized Voronoi diagrams and geometric searching. Tech. Rep. STAN-CS-79-705, Stanford Univ., Stanford, Calif.
47. DUBINS, L. E. 1957. On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents. Amer. J. Math. 79, 497-516.
48. ELGINDY, H., AND GOODRICH, M. T. 1988. A linear algorithm for computing the visibility polygon from a point. J. Alg. 2, 186-197.
49. ELTIMSAHY, A. H., AND YANG, W. S. 1988. Near Minimum-time control of robotic manipulator with obstacles in the workspace. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 358-363.
50. ERDMANN, M., AND LOZANO-PÉREZ, T. 1986. On multiple moving objects. In Proceedings of the IEEE International Conference on Robotics and Automation (San Francisco, Apr. 7-10). IEEE, New York, pp. 1419-1424.
51. FAVERJON, B. 1989. Hierarchical object models for efficient anti-collision algorithm. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). IEEE, New York, pp. 333-340.
52. FAVERJON, B. 1986. Object level programming of industrial robots. In The IEEE International Conference on Robotics and Automation (San Francisco, Apr. 7-10). IEEE, New York, pp 1406-1412.
53. FAVERJON, B., AND TOURNASSOUD, P. 1987. A local approach for path planning of manipulators with a high number of degrees of freedom. In Proceedings of the IEEE International Conference on Robotics and Automation (Raleigh, N. Carol., Mar. 31-Apr. 3). IEEE, New York, pp. 1152-1159.
54. FORTUNE, S., AND WILFONG, G. 1988. Planning constrained motion. In The Symposium on the Theory of Computer Science (Chicago). pp. 445-459.
55. FORTUNE, S., WILFONG, G., AND YAP, C. 1986. Coordinated motion of two robot arms. In Proceedings of the IEEE International Conference on Robotics and Automation (San Francisco, Apr. 7-10). IEEE, New York, pp. 1215-1223.
56. FREUND, E., AND HOYER, H. 1988. Real-time pathfinding in multirobot systems including obstacle avoidance. Int. J. Robotics Res. 7, 1 (Feb.), 42-70.
57. FUJIMURA, K., AND SAMET, H. 1989. Time minimal paths among moving obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). IEEE, New York, pp. 1110-1115.
58. FUJIMURA, K., AND SAMET, H. 1988. Path planning among moving obstacles using spatial indexing. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 1662-1667.
59. GAW, D., AND MEYSTEL, A. 1986. Minimum-time navigation of an unmanned mobile robot in a 2-1/2D world with obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation (San Francisco, Apr. 7-10). IEEE, New York, pp. 1670-1677.
60. GE, Q., AND MCCARTHY, J. M. 1989. Equations for boundaries of joint obstacles for planar robots. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). IEEE, New York, pp. 164-169.
61. GEWALI, L., MENG, A., MITCHELL, J. S. B., AND NTAFOS, S. 1988. Path planning in 0/1/8 weighted regions with applications. In Proceedings of the 4th Annual ACM Symposium on Computational Geometry (Urbana, Ill., June 6-8). ACM, New York, pp. 266-278.
62. GILBERT, E. G., AND FOO, C. P. 1990. Computing the distance between general convex objects in three-dimensional space. IEEE Trans. Robotics Auto. 6, 1 (Feb.), 53-61
63. GILBERT, E. G., AND JOHNSON, D. W. 1985. Distance functions and their applications to robot path planning in the presence of obstacles. IEEE J. Robotics Auto. RA-1, 1, 21-30.
64. GILBERT, E. G., JOHNSON, D. W., AND KEERTHI, S. S. 1988. A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE J. Robotics Auto. RA-4, 2 (Apr.), 193-203.
65. GOODRICH, M. T., SHAUCK, S. B., AND GUHA, S. 1990. Parallel method for visibility and shortest path problems in a simple polygons. In Proceedings of the 6th Annual ACM Symposium on Computational Geometry (Berkeley, Calif., June 6-8). ACM, New York, pp. 73-82.
66. GUIBAS, L. J., SHARIR, M., AND SIFRONY, S. 1988. On the general motion planning problem with two degrees of freedom. In Proceedings of the 4th Annual ACM Symposium on Computational Geometry (Urbana, Ill., June 6-8). ACM, New York, pp. 289-298.
67. HERMAN, M. 1986. Fast, three-dimensional, collision-free motion planning. In Proceedings of the IEEE International Conference on Robotics and Automation (San Francisco, Apr. 7-10). IEEE, New York, pp. 1056-1063.
68. HOGAN, N. 1985. Impedance control: An approach to manipulation: Part III-Application. ASME J. Dynamic Syst. Meas. Control. 107 (Mar.), 17-24.
69. HOPCROFT, J., AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages and Computations. Addison-Wesley, Reading, Mass.
70. HOPCROFT, J., AND WILFONG, G. T. 1986. Reducing multiple object motion planning to graph searching. SIAM J. Comput. 15, 3 (Aug.), 768-785.
71. HOPCROFT, J., JOSEPH D., AND WHITESIDE, S. 1985. On the movement of robot arms in 2-dimensional bounded regions. SIAM J. Comput. 14, 2 (May), 315-333.
72. HOPCROFT, J., JOSEPH, D., AND WHITESIDE, S. 1984a. Movement problems for 2-dimensional linkages. SIAM J. Comput. 13, 3 (Aug.), 610-629.
73. HOPCROFT, J., SCHWARTZ, J. T., AND SHARIR, M. 1984b. On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the “Warehouseman's Problem.” Int J. Robotics Res. 3, 4 (Winter), 76-88.
74. HUANG, Y. F., AND LEE, C. S. G. 1991. A framework of knowledge-based assembly planning. In Proceedings of the IEEE International Conference on Robotics and Automation (Sacramento, Apr. 7-12). IEEE, New York, pp. 599-604.
75. HUTCHINSON, S. A., AND KAK, A. C. 1990. Spar: A planner that satisfies operational and geometric goals in uncertain environments. AI Mag. 11, 1 (Spring), 31-61.
76. HWANG, Y. K 1990. Boundary equations of configuration obstacles for manipulators. In Proceedings of the IEEE International Conference on Robotics and Automation (Cincinnati, May 13-18). IEEE, New York, pp. 298-303.
77. HWANG, Y. K., AND AHUJA, N. 1992. Potential field approach to path planning. IEEE Trans. Robotics Auto. 8, 1 (Feb.), 23-32.
78. HWANG, Y. K., AND AHUJA, N. 1989. Robot path planning using a potential field representation. In The IEEE Computer Society Conference on Computer Vision and Pattern Recognition (San Diego, June 4-8). IEEE, New York, pp. 569-575.
79. HWANG, Y. H., CHANG, R. C., AND TU, H. Y. 1989. Finding all shortest path edge sequences on a convex polyhedron. In Lecture Notes in Computer Science, Algorithms and Data Structures Workshop, vol. 332, Springer-Verlag, New York.
80. HWANG, Y. K., CHEN, P. C., AND XAVIER, P. G. 1992. Test suites for motion planning. Internal Rep., Sandia National Laboratories, Albuquerque, New Mex.
81. JACOBS, P., AND CANNY, J. 1989. Planning smooth paths for mobile robots. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). IEEE, New York, pp. 2-7.
82. JONES, S. T. 1980. Solving problems involving variable terrain. Part 1: A general algorithm. Byte 5, 2.
83. JUN, S., AND SHIN, K. G. 1988. A probabilistic approach to collision-free robot path planning. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 220-227.
84. KAMBHAMPATI, S., AND DAVIS, L. S. 1986. Multiresolution path planning for mobile robots. IEEE J. Robotics Auto. RA-2, 3 (June), 135-145.
85. KANT, K., AND ZUCKER, S. W. 1988. Planning collision-free trajectories in time-varying environments: A two-level hierarchy. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 1644-1649.
86. KANT, K., AND ZUCKER, S. W. 1986. Toward efficient trajectory planning: The path-velocity decomposition. Int. J. Robotics Res. 5, 1 (Spring), 72-89.
87. KE, Y. 1989. An efficient algorithm for link distance problems. In Proceedings of the 5th Annual ACM Symposium on Computational Geometry (Saarbruchen, West Germany, June 5-7). ACM, New York, pp. 69-78.
88. KE, Y., AND O'ROURKE, J. 1988. Lower bounds on moving a ladder in two and three dimensions. In Discrete and Computational Geometry, vol. 3. Springer-Verlag, New York, pp. 197-217.
89. KE, Y., AND O'ROURKE, J. 1987. Moving a ladder in three dimensions: Upper and lower bounds. In Proceedings of the 3rd Annual ACM Symposium on Computational Geometry (Waterloo, Ontario, June 8-10). ACM, New York, pp. 136-145.
90. KEDEM, K., AND SHARIR, M. 1988. An automatic motion planning system for a convex polygonal mobile robot in 2-D polygonal space. In Proceedings of the 4th Annual ACM Symposium on Computational Geometry (Urbana, Ill., June 6-8). ACM, New York, pp. 329-340.
91. KEDEM, K., AND SHARIR, M. 1985. An efficient algorithm for planning collision-free motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles. In Proceedings of the 1st Annual ACM Symposium on Computational Geometry (Baltimore, June 5-7). ACM, New York, pp. 75-80.
92. KEHTARNAVAZ, N., AND LI, S. 1988. A collision-free navigation scheme in the presence of moving obstacles. In The International Conference on Computer Vision. IEEE Computer Society, Los Angeles, pp. 808-813.
93. KEIL, J. M., AND SACK, J. R. 1985. Minimum decomposition of polygonal objects. In Computational Geometry. Elsevier Science Publishers, North Holland, Amsterdam, pp. 197-216.
94. KHATIB, O. 1985. Real-time obstacle avoidance for manipulators and mobile robots. In Proceedings of the IEEE International Conference on Robotics and Atomation (St. Louis, Missouri). IEEE, New York, pp. 500-505.
95. KHATIB, O., AND MAMPEY, L. M. 1978. Fonction decision-commande d'un robot manipulateur. Rep. 2/7156. DERA/CERT, Toulouse, France.
96. KHERADPIR, S., AND THORP, J. S. 1987. Real-time control of robot manipulators in the presence of obstacles. IEEE Int. J. Robotics Auto. RA-4, 6 (Dec.), 687-698.
97. KHOSLA, P., AND VOLPE, R. 1988. Superquadric artificial potentials for obstacle avoidance and approach. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 1778-1784.
98. KEIRSEY, D. M., AND MITCHELL, J. S. B. 1984. Planning strategic paths through variable terrain data. In Proceedings of SPIE Applications of Artificial Intelligence vol. 485, SPIE, Bellingham, Washington, pp. 172-179.
99. KIRKPATRICK, D. G. 1979. Efficient computation of continuous skeletons. In The 20th Symposium on the Foundations of Computer Science (San Juan, Puerto Rico, Oct. 29-31). pp. 18-27.
100. KOCH, E., YEN, C., HILLEL, G., MEYSTEL, A., AND ISIK, C. 1985. Simulation of path planning for a system with vision and map updating In Proceedings of the IEEE International Conference on Robotics and Automation (St. Louis, Missouri). IEEE, New York, pp. 146-160.
101. KODITSCHEK, D. E. 1989. Robot planning and control via potential functions. In Robotics Review, vol. 1, O. Khatib, J. Graig, and T. Lozano-Pérez, Eds. MIT Press, Cambridge, Mass.
102. KODITSCHEK, D. E. 1987. Exact robot navigation by means of potential functions: Some topological considerations. In Proceedings of the IEEE International Conference on Robotics and Automation (Raleigh, N. Carol, Mar. 31-Apr. 3). IEEE, New York, pp. 1-6.
103. KONDO, K. 1991. Motion planning with six degrees of freedom by multistrategic, bidirectional heuristic free space enumeration. IEEE Trans. Robotics Auto. 7, 3 (June), 267-277.
104. KROGH, B. H., AND THORPE, C. E. 1986. Integrated path planning and dynamic steering control for autonomous vehicles. In Proceedings of the IEEE International Conference on Robotics and Automation (San Francisco, Apr. 7-10) IEEE, New York, pp. 1664-1669.
105. KUAN, D. T., ZAMISKA, J. C., AND BROOKS, R. A. 1985. Natural decomposition of free space for path planning. In Proceedings of the IEEE International Conference on Robotics and Automation (St. Louis, Missouri). IEEE, New York, pp. 168-173.
106. LATOMBE, J. C. 1991. Robot Motion Planning Kluwer Academic Publishers, Boston/Dordrecht/London.
107. LEE, D. T. 1978. Proximity and reachability in the plane. Ph.D. dissertation, Univ. of Illinois, Urbana-Champaign, Ill.
108. LEE, D. T., AND DRYSDALE, R. L., Generalization of Voronoi diagram in the plane. SIAM J. Comput. 10, 73-83.
109. LEE, S., AND SHIN, Y. G. 1990. Disassembly planning based on subassembly extraction. In Proceedings of the IEEE International Conference on Robotics and Automation (Cincinnati, May 13-18). IEEE, New York, pp. 1606-1613.
110. LEE, D. T., CHEN, T. H., AND YANG, C. D. 1990. Shortest rectilinear paths among weighted obstacles. In Proceedings of the 6th Annual ACM Symposium on Computational Geometry (Berkeley, Calif., June 6-8). ACM, New York, pp. 301-310.
111. LENGYEL, J., REICHERT, M., DONALD, B. R., AND GREENBERG, D. P. 1990. Real-time robot motion planning using rasterizing computer graphics hardware. Comput. Graph. 24, 4 (Aug.), 327-335
112. LIN, M. C., AND CANNY, J. F. 1991. A fast algorithm for incremental distance calculation. In Proceedings of the IEEE International Conference on Robotics and Automation (Sacramento, Apr. 7-12). IEEE, New York, pp. 1008-1014.
113. LIU, Y. H., KURODA, S., NANIWA, T., NOBORIO, H., AND ARIMOTO, S 1989. A practical algorithm for planning collision-free coordinated motion of multiple mobile robots. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19) IEEE, New York, pp. 1427-1432.
114. LOZANO-PÉREZ, T. 1987. A simple motion-planning algorithm for general robot manipulators. IEEE J. Robotics Auto. RA-3, 3 (June), 224-238
115. LOZANO-PÉREZ, T., AND O'DONNELL, P. A. 1991. Parallel robot motion planning. In Proceedings of the IEEE International Conference on Robotics and Automation (Sacramento, Apr. 7-12). IEEE, New York, pp. 1000-1007.
116. LOZANO-PÉREZ, T., AND WESLEY, M. A. 1979 An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22, 10 (Oct.), 560-570.
117. LOZANO-PÉREZ, T., JONES, J. L., MAZER, E., O'DONNELL, P. A. 1989. Task-level planning of pick-and-place robot motions. IEEE Comput. 22, 3 (Mar.), 21-29.
118. LOZANO-PÉREZ, T., JONES, J. L., MAZER, E., O'DONNELL, P. A., GRIMSON, E. L., TOURNASSOUD, P., AND LANUSSE, A. 1987 Handey: A robot system that recognizes, plans, and manipulates. In Proceedings of the IEEE International Conference on Robotics and Automation (Raleigh, N Carol, Mar 31-Apr. 3). IEEE, New York, pp. 843-849.
119. LUMELSKY, V. J. 1987. Effect of kinematics on motion planning for planar robot arms moving amidst unknown obstacles. IEEE J. Robotics Auto. RA-3, 3 (June), 207-223.
120. LUMELSKY, V. 1986. Continuous motion planning in unknown environment for a 3D cartesian robot arm. In Proceedings of the IEEE International Conference on Robotics and Automation (San Francisco, Apr. 7-10) IEEE, New York, pp. 1050-1055
121. LUMELSKY, V., AND SKEWIS, T 1988. A paradigm for incorporating vision in the robot navigation function. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp 734-739.
122. LUMELSKY, V., AND SUN, K. 1987. Gross motion planning for a simple 3D articulated robot arm moving amidst unknown arbitrarily shaped obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation (Raleigh, N. Carol., Mar. 31-Apr. 3). IEEE, New York, pp. 1929-1934.
123. MACIEJEWSKI, A. A., AND KLEIN, C. A. 1985 Obstacle avoidance for kinematically redundant manipulators in dynamically varying environments. Int. J Robotics Res. 4, 3 (Fall), 109-117.
124. MADDILA, S. R. 1986 Decomposition algorithm for moving a ladder among rectangular obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation (San Francisco, Apr. 7-10). IEEE, New York, pp. 1413-1418.
125. MCCARTHY, J. M., GE, Q., AND BODDULURI, R. M. C. 1989. The analysis of cooperating planar robot arms in the image space of the workpiece. Int. J. Robotics Res
126. MITCHELL, J. S. B., AND PAPADIMITRIOU, C. H. 1987. The weighted region problem. In Proceedings of the 3rd Annual ACM Symposium on Computational Geometry (Waterloo, Ontario, June 8-10). ACM, New York, pp. 30-38.
127. MITCHELL, J. S. B., MOUNT, D. M., AND PAPADIMITRIOU, C. H. 1987. The discrete geodesic problem. SIAM J. Comput. 16, 4 (Aug.), 647-668.
128. MITCHELL, J. S. B., ROTE, G., AND WOEGINGER, G. 1990. Minimum-link paths among obstacles in the plane. In Proceedings of the 6th Annual ACM Symposium on Computational Geometry (Berkeley, Calif., June 6-8). ACM, New York, pp. 63-72.
129. MIYAZAKI, F., AND ARIMOTO, S. 1984. Sensory feedback based on the artificial potential for robots. In Proceedings of the 9th Triannual World Congress of International Factory Automation (Budapest, July 2-6). Pergamon Press, New York, pp. 2381-2386.
130. MONTGOMERY, M., GAW, D., AND MEYSTEL, A. 1987. Navigation algorithm for a nested hierarchical system of robot path planning among polyhedral obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation (Raleigh, N. Carol., Mar. 31-Apr. 3). IEEE, New York, pp. 1612-1622.
131. MOUNT, D. M. 1985. On finding shortest paths on convex polyhedra. Tech. Rep. 1495, Dept. of Computer Science, Univ. of Maryland, Baltimore.
132. NEWMAN, W. 1989. Automatic obstacle avoidance at high speeds via reflex control. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz.). IEEE, New York. pp. 1104-1109.
133. NEWMAN, W., AND HOGAN, N. 1987. High speed robot control and obstacle avoidance using dynamic potential function. In Proceedings of the IEEE International Conference on Robotics and Automation (Raleigh, N. Carol., Mar. 31-Apr. 3). IEEE, New York, pp. 14-24.
134. NGUYEN, V. D. 1984. The Findpath problem in the plane. AI Memo 760, Artificial Intelligence Lab., Massachusetts Inst. of Technology, Cambridge, Mass.
135. NOBORIO, H., NANIWA, T., AND ARIMOTO, S. 1989. A feasible motion planning algorithm for a mobile robot on a quadtree representation. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). IEEE, New York, pp. 327-332.
136. O'DONNELL, P. A., AND LOZANO-PÉREZ, T. 1989. Deadlock-free and collision-free coordination of two robot manipulators. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). IEEE, New York, pp. 484-489.
137. O'DÚNLAING, C. 1987. Motion planning with inertial constraints. Algorithmica 2, 4, 431-475.
138. O'DÚNLAING, C.B. AND YAP, C. K. 1985. A retraction method for planning the motion of a disc. J. Algor. 6, 1(Mar.), 104-111.
139. OOMMEN, B. J., IYENGAR, S. S., RAO, N. S. V., AND KASHYAP, R. L. 1987. Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case. IEEE Int. J. Robotics Auto. RA-3, 6 (Dec.), 672-680.
140. O'ROURKE, J., SURI, S., AND BOOTH, H. 1984. Shortest paths on polyhedral surfaces. Tech. Rep. The Johns Hopkins Univ., Baltimore.
141. PADEN, B., MEES, A., AND FISHER, M. 1989. Path planning using a Jacobian-based freespace generation algorithm. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz. May 14-19). IEEE, New York, pp. 1732-1737.
142. PAPADIMITRIOU, C. H. 1985. An algorithm for shortest-path motion in three dimensions. Inf. Process. Lett. 20, 5 (June), 259-263.
143. PAVLOV, V. V., AND VORONIN, A. N. 1984. The method of potential functions for coding constraints of the external space in an intelligent mobile robot. Soviet Auto. Cont. 6.
144. PREPARATA, F. P., AND SHAMOS, M. I. 1985. Computational Geometry, An Introduction. Springer-Verlag, New York.
145. QUEK, F. K. H., FRANKLIN, R. F., AND PONT, F. 1985. A decision system for autonomous robot navigation over rough terrain. In Proceedings of SPIE Applications of Artificial Intelligence (Boston).
146. RAO, N., IYENGAR, S., AND DESAUSSURE, G., The visit problem: Visibility graph-based solution. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 1650-1655.
147. REIF, J. H. 1979. Complexity of the mover's problem and generalizations, extended abstract. In Proceedings of the IEEE Symposium on Foundations of Computer Science (San Juan, Puerto Rico, Oct. 29-31), IEEE, New York, pp. 421-427.
148. REIF, J. H., AND SHARIR, M. 1985. Motion planning in the presence of moving obstacles In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science (Portland, Oreg., Oct. 21-23). IEEE, New York, pp. 144-154.
149. REIF, J. H., AND STORER, J. A. 1988. 3-dimensional shortest paths in the presence of polyhedral obstacles. In Proceedings of the IEEE Symposium on Foundations of Computer Science. (White Plains, New York, Oct. 24-26), IEEE, New York, pp 85-92.
150. REIF, J. H., AND STORER, J. A. 1985. Shortest paths in Euclidean space with polyhedral obstacles. Tech. Rep. CS-85-121, Computer Science Dept., Brandeis Univ., Waltham, Mass.
151. RICHBOURG, R. F., ROWE, N. C., ZYDA, M. J., AND MCGHEE, R. B. 1987. Solving the global, two-dimensional routing problem using Snell's Law and A search. In Proceedings of the IEEE International Conference on Robotics and Automation (Raleigh, N. Carol., Mar. 31-Apr. 3). IEEE, New York, pp. 1631-1636.
152. RIMON, E., AND KODITSCHEK, D. E 1989. The construction of analytic diffeomorphism for exact robot navigation on star worlds. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). IEEE, New York, pp. 21-26.
153. RIMON, E., AND KODITSCHEK, D. E. 1988. Exact robot navigation using cost functions: The case of distinct spherical boundaries in En. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 1791-1796.
154. RUEB, K. D., AND WONG, A. K. C. 1987. Structuring free space as a hypergraph for roving robot path planning and navigation. IEEE Trans. Patt. Anal. Machine Intell. PAMI-9, 2 (Feb.), 263-273.
155. SCHWARTZ, J. T., AND SHARIR, M. 1983a. On the piano movers' problem: I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers. Commun. Pure Appl. Math. 36, 3(May), 345-398.
156. SCHWARTZ, J. T., AND SHARIR, M. 1983b. On the piano movers' problem: III. Coordinating the motion of several independent bodies amidst polygonal barriers. Int. J. Robotics Res 2, 3 (Fall), 46-75.
157. SCHWARTZ, J. T., AND SHARIR, M. 1981. On the piano movers' problem: II: Techniques for computing topological properties of real algebraic manifolds. Report No. 39, Courant Inst. of Mathematical Sciences. New York Univ.
158. SCHWARTZ, J. T., AND YAP, C. K. 1987. Advances in Robotics, Vol. I, Algorithmic and Geometric Aspects of Robotics. Erlbaum, Hillsdale, New Jersey.
159. SHAMOS, M. I., AND HOEY, D. 1975. Closest point problems. In Proceedings of the 16th IEEE Symposium on Foundations of Computer Science (Berkeley, Calif., Oct. 13-15), IEEE, New York, pp. 151-162.
160. SHARIR, M. 1987. Efficient algorithms for planning purely translational collision-free motion in two and three dimensions. In Proceedings of the IEEE International Conference on Robotics and Automation (Raleigh, N. Carol., Mar. 31-Apr. 3). IEEE, New York, pp. 1326-1331.
161. SHARIR, M., AND SCHORR, A. 1986. On shortest paths in polyhedral spaces. SIAM J. Comput. 15, 1(Feb.), 193-215.
162. SHARIR, M., AND SCHORR, A. 1984. On shortest paths in polyhedral spaces. In Proceedings of the 16th Symposium on the Theory of Computing. American Computing Machinery, pp. 144-153.
163. SHARIR, M., AND SIFRONY, S. 1988. Coordinated motion planning for two independent robots. In Proceedings of the 4th Annual ACM Symposium on Computational Geometry (Urbana, Ill., June 6-8). ACM, New York, pp. 319-328.
164. SHILLER, Z., AND DUBOWSKY, S. 1988. Global time optimal motions of robotic manipulators in the presence of obstacles In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 370-375
165. SHIN, K. G., AND MCKAY, N. D. 1984. Open-loop minimum-time control of mechanical manipulators and its application. In Proceedings of the American Control Conference (San Diego, June 6-8). IEEE, New York, pp. 1231-1236
166. SINGH, S., AND WAGH, M. D. 1987. Robot path planning using intersecting convex shapes. IEEE J. Robotics Auto. RA-3, 2 (Apr.), 101-108.
167. STRIP, D. R., AND MACIEJEWSKI, A. A. 1990. Archimedes An experiment in automating mechanical assembly. In The 11th International Conference on Assembly Automation (Dearborn, Mich.), pp. MS90-839.
168. SURI, S. 1986. A linear time algorithm for minimum link paths inside a simple polygon. Comput. Vision, Graph. Image Proc. 35, 99-110.
169. TANNENBAUM, A., AND YOMDIN, Y. 1987. Robotic manipulators and the geometry of real semialgebraic sets. IEEE J. Robotics Auto. RA-3, 4 (Aug.), 301-307.
170. TARABANIS, K., TSAI, R. Y., AND ALLEN, P. K. 1991. Automated sensor planning for robotic vision task. In Proceedings of the IEEE International Conference on Robotics and Automation (Sacramento, Apr. 7-12). IEEE, New York, pp. 76-83.
171. TARSKI, A. 1951. A Decision Method for Elementary Algebra and Geometry, 2nd ed. University of California Press. Berkeley, Calif.
172. THORPE, C. E. 1984. Path relaxation: Path planning for a mobile robot. In Proceedings of the AAAI (Austin, Tex., Aug. 6-10). Morgan Kaufmann Publishers, Inc. Los Altos, Calif., pp. 318-321
173. WARREN, C. W 1989. Global path planning using artificial potential fields. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). IEEE, New York, pp. 316-321.
174. WELZL, E 1985. Constructing the visibility graph for n line segments in O(n2) time. Inf. Process Lett. 20, 4(May), 167-171.
175. WILFONG, G. 1989. Shortest path for autonomous vehicles. In Proceedings of the IEEE International Conference on Robotics and Automation (Scottsdale, Ariz., May 14-19). IEEE, New York, pp. 15-20.
176. WILFONG, G. 1988a. Motion planning for an autonomous vehicle. In Proceedings of the IEEE International Conference on Robotics and Automation (Philadelphia, Apr. 24-29). IEEE, New York, pp. 529-533.
177. WILFONG, G 1988b. Motion planning in the presence of movable obstacles. In Proceedings of the 4th Annual ACM Symposium on Computational Geometry (Urbana. Ill., June 6-8). ACM. New York, pp. 279-288.
178. WILSON, R. H. 1992. On geometric assembly planning. Tech. Rep. STAN-CS-92-1416, Dept. of Computer Science, Stanford Univ., Stanford, Calif.
179. YAP, C. K. 1985. An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments. Rep. No. 43, Courant Inst. Robotics Laboratory, New York Univ.
180. YEUNG, D. Y., AND BEKEY, G. A. 1987. A decentralized approach to the motion planning problem for multiple mobile robots. In Proceedings of the IEEE International Conference on Robotics and Automation (Raleigh, N. Carol., Mar. 31-Apr. 3). IEEE, New York, pp. 1779-1784.
181. ZHU, D., AND LATOMBE, J. C. 1990. Constraint reformulation in a hierarchical path planner. In Proceedings of the IEEE International Conference on Robotics and Automation (Cincinnati, May 13-18). IEEE, New York, pp. 1918-1923.