Skip to main content
Journal ArticleOPEN ACCESS

An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles

Communications of the ACM (1979) 22(10) 560-570
DOI: 10.1145/359156.359164
1.6kCitations
Citations of this article
443Readers
Mendeley users who have this article in their library.

Author supplied keywords

References Powered by Scopus

A Formal Basis for the Heuristic Determination of Minimum Cost Paths

IEEE Transactions on Systems Science and Cybernetics
9230Citations
2537Readers
Get full text

Interference detection among solids and surfaces

Communications of the ACM
176Citations
28Readers
Get full text
View more at Scopus

Cited by Powered by Scopus

Planning algorithms

Planning Algorithms
5842Citations
3585Readers
Get full text

Probabilistic roadmaps for path planning in high-dimensional configuration spaces

IEEE Transactions on Robotics and Automation
4983Citations
1583Readers
Get full text

Sampling-based algorithms for optimal motion planning

International Journal of Robotics Research
3930Citations
1185Readers
Get full text
View more at Scopus

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Lozano-Pérez, T., & Wesley, M. A. (1979). An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles. Communications of the ACM, 22(10), 560–570. https://doi.org/10.1145/359156.359164

Readers over time

‘09‘10‘11‘12‘13‘14‘15‘16‘17‘18‘19‘20‘21‘22‘23‘24‘25015304560

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 224

71%

Researcher 58

18%

Professor / Associate Prof. 27

9%

Lecturer / Post doc 8

3%

Readers' Discipline

Tooltip

Engineering 180

57%

Computer Science 117

37%

Social Sciences 9

3%

Mathematics 8

3%

Article Metrics

Tooltip
Mentions
References: 6

Save time finding and organizing research with Mendeley

Sign up for free
0