Tomás Lozano-Pérez
- 1 Adamowicz, M., and Albano, A. Nesting two-dimensional shapes in rectangular modules. Comptr. Aided Design 8, 1 (Jan. 1976), 27-33.Google Scholar
Cross Ref
- 2 Boyse, J.W. Interference detection among solids and surfaces. Comm. ACM. 22, 1 (Jan. 1979), 3-9. Google ScholarDigital Library
- 3 Braid, I.C. Designing with Volumes. Cantab Press, Cambridge, England, 1973.Google Scholar
- 4 Hart, P., Nilsson, N.J., and Raphael, B. A formal basis for the heuristic determination of minimum cost paths. 1EEE Trans. Syst. Sci. CybernetiesSSC-4, 2 (July 1968), 100-107.Google ScholarCross Ref
- 5 Ignat'yev, M.B., Kulakov, F.M., and Pokrovskiy, A.M. Robot manipulator control algorithms. Rep. No. JPRS 59717, NTIS, Springfield, Va., Aug. 1973.Google Scholar
- 6 Lozano-P6rez, T. The design of a mechanical assembly system. Rep. No. AI-TR-397, Artif. Intell. Lab., MIT, Cambridge, Mass., Dec. 1976 Google ScholarDigital Library
- 7 Lyusternik, L.A. Convex Figures and Polyhedra. Dover Publications, N.Y., 1963. (Translated from the Russian by T.J. Smith; original copyright Moscow, 1956. )Google Scholar
- 8 Nilsson, N.J. A mobile automaton: An application of artificial intelligence techniques. Proc. Int. Joint Conf. Artif. Intell., 1969, pp. 509-520.Google ScholarCross Ref
- 9 Udupa, S. Collision detection and avoidance in computer controlled manipulators. Ph.D. Th., Calif. Inst. of Technology, Pasadena, Calif., 1977. Google ScholarDigital Library
- 10 Will, P.M., and Grossman, D.D. An experimental system for computer controlled mechanical assembly. IEEE Trans. Comptrs. (1975), 879-888.Google Scholar
Index Terms
- An algorithm for planning collision-free paths among polyhedral obstacles
Recommendations
Planning Collision-Free Paths for Robotic Arm Among Obstacles
A theory for planning collision-free paths of a moving object among obstacles is described. Using the concepts of state space and rotation mapping, the relationship between the positions and the corresponding collision-free orientations of a moving ...
A hierarchical collision-free path planning algorithm for robotics
IROS '95: Proceedings of the International Conference on Intelligent Robots and Systems-Volume 2 - Volume 2A hierarchical path planning algorithm is proposed to plan a collision free path for mobile robots and robot manipulators in an environment with stationary obstacles as well as multi-robot manipulators in a common workspace. The proposed algorithm ...
Shortest paths among obstacles in the plane revisited
SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete AlgorithmsGiven a set of pairwise disjoint polygonal obstacles in the plane, finding an obstacle-avoiding Euclidean shortest path between two points is a classical problem in computational geometry and has been studied extensively. The previous best algorithm was ...
Comments