| An algorithm for planning collision-free paths among polyhedral obstacles |
| Full text |
Pdf
(829 KB)
|
Source
|
Communications of the ACM
archive
Volume 22 , Issue 10 (October 1979)
table of contents
Pages: 560 - 570
Year of Publication: 1979
ISSN:0001-0782
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 33, Downloads (12 Months): 131, Citation Count: 89
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Adamowicz, M., and Albano, A. Nesting two-dimensional shapes in rectangular modules. Comptr. Aided Design 8, 1 (Jan. 1976), 27-33.
|
 |
2
|
|
| |
3
|
Braid, I.C. Designing with Volumes. Cantab Press, Cambridge, England, 1973.
|
| |
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.
|
| |
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.
|
| |
6
|
|
| |
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. )
|
| |
8
|
Nilsson, N.J. A mobile automaton: An application of artificial intelligence techniques. Proc. Int. Joint Conf. Artif. Intell., 1969, pp. 509-520.
|
 |
9
|
|
| |
10
|
Will, P.M., and Grossman, D.D. An experimental system for computer controlled mechanical assembly. IEEE Trans. Comptrs. (1975), 879-888.
|
CITED BY 89
|
|
L. J. Guibas , M. Sharir , S. Sifrony, On the general motion planning problem with two degrees of freedom, Proceedings of the fourth annual symposium on Computational geometry, p.289-298, June 06-08, 1988, Urbana-Champaign, Illinois, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Y. Goto , K. Matsuzaki , I. Kweon , T. Obatake, CMU sidewalk navigation system: a blackboard-based outdoor navigation system using sensor fusion with colored-range images, Proceedings of 1986 ACM Fall joint computer conference, p.105-113, November 1986, Dallas, Texas, United States
|
|
|
|
|
|
David Kirkpatrick , Jack Snoeyink , Bettina Speckmann, Kinetic collision detection for simple polygons, Proceedings of the sixteenth annual symposium on Computational geometry, p.322-330, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
|
|
|
|
|
|
|
|
|
Helmut Alt , Rudolf Fleischer , Michael Kaufmann , Kurt Mehlhorn , Stefan Näher , Stefan Schirra , Christian Uhrig, Approximate motion planning and the complexity of the boundary of the union of simple geometric figures, Proceedings of the sixth annual symposium on Computational geometry, p.281-289, June 07-09, 1990, Berkley, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
K. Clarkson , S. Kapoor , P. Vaidya, Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time, Proceedings of the third annual symposium on Computational geometry, p.251-257, June 08-10, 1987, Waterloo, Ontario, Canada
|
|
|
|
|
|
|
|
|
Jim Wang , Verlynda S. Dobbs , Henry W. Davis, Using focusing search algorithms and a strong heuristic to solve the findpath problem in robotics, Proceedings of the 1990 ACM annual conference on Cooperation, p.63-69, February 20-22, 1990, Washington, D.C., United States
|
|
|
|
|
|
D. T. Lee , T. H. Chen , C. D. Yang, Shortest rectilinear paths among weighted obstacles, Proceedings of the sixth annual symposium on Computational geometry, p.301-310, June 07-09, 1990, Berkley, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
R. Wolfe , W. Fitzgerald , F. Gracer, Interactive graphics for volume modeling, Proceedings of the 18th conference on Design automation, p.463-470, June 29-July 01, 1981, Nashville, Tennessee, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
P. J. de Rezende , D. T. Lee , Y. F. Wu, Rectilinear shortest paths with rectangular barriers, Proceedings of the first annual symposium on Computational geometry, p.204-213, June 05-07, 1985, Baltimore, Maryland, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Daniel M. Tracy , W. Randolph Franklin , Barbara Cutler , Franklin T. Luk , Marcus Andrade, Path planning on a compressed terrain, Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, November 05-07, 2008, Irvine, California
|
|
|
|
|
|
|
|
|
|
|
|
Lou Tychonievich , David Zaret , John Mantegna , Robert Evans , Eric Muehle , Scott Martin, A maneuvering-board approach to path planning with moving obstacles, Proceedings of the 11th international joint conference on Artificial intelligence, p.1017-1021, August 20-25, 1989, Detroit, Michigan
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Alex Nash , Kenny Daniel , Sven Koenig , Ariel Feiner, Theta*: any-angle path planning on grids, Proceedings of the 22nd national conference on Artificial intelligence, p.1177-1183, July 22-26, 2007, Vancouver, British Columbia, Canada
|
|
|
|
|