Spatial Planning: A Configuration Space Approach

IEEE Transactions on Computers

Volumn C-32, Issue 2, 1983, Pages 108-120

  Lozano Pérez, Tomás ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computational geometry; obstacle avoidance; robotics

Indexed keywords

COMPUTATIONAL GEOMETRY;

COMPUTER GRAPHICS;

EID: 0020706698     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1983.1676196     Document Type: Article

References (51)

1. M. Adamowicz, “The optimum two-dimensional allocation of irregular, multiply-connected shapes with linear, logical and geometric constraints,” Ph.D. dissertation, Dep. Elec. Eng., New York Univ., 1970.
2. M. Adamowicz and A. Albano, “Nesting two-dimensional shapes in rectangular modules,” Computer Aided Design, vol. 8, pp. 27–32, Jan. 1976.
3. A. Albano and G. Sapuppo, “Optimal allocation of two-dimensional irregular shapes using heuristic search methods,” IEEE Trans. Syst., Man., Cybern., vol. SMC-10, pp. 242–248, May 1980.
4. D. Avis and G. T, Toussaint, “An optimal algorithm for determining the visibility of a polygon from an edge,” Sch. Comput. Sci., McGill Univ., Rep. SOCS-80.2, Feb. 1980.
5. R. V. Benson, Euclidean Geometry and Convexity. New York: McGraw-Hill, 1966.
6. J. I. Bentley and T. Ottman, “Algorithms for reporting and counting geometric intersections,” IEEE Trans. Comput., vol. C-28, Sept. 1979.
7. O. Bottema and B. Roth, Theoretical Kinematics. Amsterdam: North-Holland, 1979.
8. J. W. Boyse, Commun. Ass. Comput. Mach., Jan. 1979
9. R. A. Brooks, “Solving the Find-Path problem by representing free space as generalized cones,” M.I.T. Artificial Intell. Lab., Rep. AIM-674, May 1982.
10. R. A. Brooks and T. Lozano-Perez, “A subdivision algorithm in configuration space for Findpath with rotation,” M.I.T. Artificial Intell. Lab., Rep. AIM-684, Dec. 1982.
11. K. Q. Brown, “Fast intersection of half spaces,” Dep. Comput. Sci., Carnegie-Mellon Univ., Rep. CS-78-129, June 1978.
12. C. E. Campbell and J. Y. S. Luh, “A preliminary study on path planning of collision avoidance for mechanical manipulators,” Sch. Elec. Eng., Purdue Univ., Rep. TR-EE 80–48, Dec. 1980.
13. H. Freeman, “On the packing of arbitrary-shaped templates,” in Proc. 2nd USA-Japan Comput. Conf., 1975, pp. 102–107.
14. G. Giralt, R. Sobek, and R. Chatila, “A multilevel planning and navigation system for a mobile robot,” in Proc. 6th Int. Joint Conf: Artificial Intell., Tokyo, Japan, Aug. 1979, pp. 335–338.
15. R. L. Graham, “An efficient algorithm for determining the convex hull of a finite planar set,” Inform. Processing Lett., vol. 1, pp. 132–133, 1972.
16. B. Grunbaum, Convex Polytopes. New York: Wiley-Interscience, 1967.
17. L. J. Guibas and F. F. Yao, “On translating a set of rectangles,” in Proc. 12th Annu. ACM Symp. Theory of Computing, Los Angeles, CA, Apr. 1980, pp. 154–160.
18. W. E. Howden, “The sofa problem,” Comput. J., vol. 11, pp. 299–301, Nov. 1968.
19. R. C. Larson and V. O. K. Li, “Finding minimum rectilinear distance paths in the presence of obstacles,” Networks, vol. 11, pp. 285–304, 1981.
20. R. A. Lewis, “Autonomous manipulation on a robot: Summary of manipulator software functions,” Jet Propulsion Lab., California Inst. Technol., TM 33–679, Mar. 1974.
21. L. Lieberman and M. A. Wesley, “AUTOPASS: An automatic programming system for computer controlled assembly,” IBM J. Res. Develop., vol. 21, July 1977.
22. T. Lozano-Pérez, “The design of a mechanical assembly system,” M.I.T. Artificial Intell. Lab., Rep. TR-397, Dec. 1976.
23. T. Lozano-Pérez, “Automatic planning of manipulator transfer movements,” IEEE Trans. Syst., Man., Cybern., vol. SMC-11, pp. 681–698, Oct. 1981.
24. T. Lozano-Pérez and M. A. Wesley, “An algorithm for planning collision-free paths among polyhedral obstacles,” Commun. Ass. Comput. Mach., vol. ACM 22, pp. 560–570, Oct. 1979.
25. L. Lyusternik, Convex Figures and Polyhedra. Dover, 1963, original copyright, Moscow, 1956.
26. H. P. Moravec, “Visual mapping by a robot rover,” in Proc. 6th Int. Joint Conf: Artificial Intell., Tokyo, Japan, Aug. 1979.
27. D. Mueller and F. Preparata, “Finding the intersection of two convex polyhedra,” Coordinated Sci. Lab., Univ. Illinois, Urbana, Rep. R-793, Oct. 1977.
28. N. Nilsson, “A mobile automaton: An application of artificial intelligence techniques,” in Proc. 2nd Int. Joint Conf. Artificial Intell., 1969, pp. 509–520.
29. R. P. Paul, “Manipulator Cartesian path control,” IEEE Trans. Syst., Man., Cybern., vol. SMC-9, pp. 702–711, Nov. 1979.
30. G. Pfister, “On solving the FINDSPACE problem, or how to find where things aren't,” M.I.T. Artificial Intell. Lab., Working Paper 113, Mar. 1973.
31. D. L. Pieper, “The kinematics of manipulators under computer control,” Stanford Artificial Intell. Lab., AIM-72, Oct. 1968.
32. F. Preparata and S. Hong, “Convex hulls of finite sets of point in two and three dimensions,” Commun. Ass. Comput. Mach., vol. 20, pp. 87–93, Feb. 1977.
33. F. Preparata and D. Mueller, “Finding the intersection of a set of half spaces in time O(n log n),” Coordinated Sci. Lab., Univ. Illinois, Urbana, Rep. R-803, Dec. 1977.
34. J. Reif, “On the movers problem,” in Proc. 20th Annu. IEEE Symp. Foundation of Comput. Sci., 1979, 421–427.
35. B. Schachter, “Decomposition of polygons into convex sets,” IEEE Trans. Comput., vol. C-27, pp. 1078–1082, Nov. 1978.
36. M. I. Shamos, “Geometric complexity,” in Proc. 7th Annu. ACM Symp. Theory of Computing, 1975, pp. 224–233.
37. M. I. Shamos and D. Hoey, “Closest-point problems,” in Proc. 16th Annu. IEEE Symp. Foundation of Comput. Sci., 1975, pp. 151–161.
38. M. I. Shamos and D. Hoey, “Geometric intersection problems,” in Proc. 17th Annu. IEEE Symp. Foundation of Comput. Sci., 1976, 208–215.
39. J. T. Schwartz, “Finding the minimum distance between two convex polygons,” Inform. Processing Lett., vol. 13, pp. 168–170, 1981.
40. J. T. Schwartz and M. Sharir, “On the piano movers' problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers,” Dep. Comput. Sci., Courant Inst. Math. Sci., New York Univ., Rep. 39, 1981.
41. J. T. Schwartz and M. Sharir, “On the piano movers' problem II. General techniques for computing topological properties of real manifolds,” Dep. Comput. Sci., Courant Inst. Math. Sci., New York Univ., Rep. 41,1982.
42. Y. G. Stoyan and L. D. Ponomarenko, “A rational arrangement of geometric bodies in automated design problems,” Eng. Cybern., vol. 16, Jan. 1978.
43. R. Taylor, “A synthesis of manipulator control programs from task-level specifications,” Stanford Artificial Intell. Lab., Rep. AIM-282, July 1976.
44. A. M. Thompson, “The navigation system of the JPL robot,” in Proc. 5th Int. Joint Conf. Artificial Intell., Massachusetts Inst. Technol., 1977.
45. S. Udupa, “Collision detection and avoidance in computer controlled manipulators,” in Proc. 5th Int. Joint Conf. Artificial Intell., Massachusetts Inst. Technol., 1977.
46. S. Udupa, “Collision detection and avoidance in computer controlled manipulators,” Ph.D. dissertation, Dep. Elec. Eng., California Inst. Technol., 1977.
47. J. E. Warnock, “A hidden line algorithm for halftone picture representation,” Dep. Comput. Sci., Univ. Utah, Rep. TR4-5, May 1968.
48. J. Williams, “STICKS-A new approach to LSI design,” S.M. thesis, Dep. Elec. Eng., Massachusetts Inst. Technol., 1977.
49. T. Winograd, Understanding Natural Language. New York: Academic, 1972.
50. T. C. Woo, “Progress in shape modelling,” IEEE Computer, vol. 10, Dec. 1977.
51. F. F. Yao, “On the priority approach to hidden-surface algorithms,” in Proc. 21st Symp. Foundation of Comput. Sci., 1980, pp. 301–307.