The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
An algorithm for planning collision-free paths among polyhedral obstacles
Abstract
article Free Access Share on An algorithm for planning collision-free paths among polyhedral obstacles Authors: Tomás Lozano-Pérez Massachusetts Institute of Technology, Cambridge Massachusetts Institute of Technology, CambridgeView Profile , Michael A. Wesley IBM Thomas J. Watson Research Center, Yorktown Heights, NY IBM Thomas J. Watson Research Center, Yorktown Heights, NYView Profile Authors Info & Claims Communications of the ACMVolume 22Issue 10Oct. 1979 pp 560–570https://doi.org/10.1145/359156.359164Published:01 October 1979Publication History 1,578citation4,889DownloadsMetricsTotal Citations1,578Total Downloads4,889Last 12 Months450Last 6 weeks60 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Cited by
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
Compliance and Force Control for Computer Controlled Manipulators
Mason, M. T. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308708 · Cited by 1,542
A review of mobile robots: Concepts, methods, theoretical framework, and applications
Rubio, F., Valero, F., & Llopis-Albert, C. (2019) · International Journal of Advanced Robotic Systems · doi:10.1177/1729881419839596 · Cited by 763
Mitchell, J. S. B., Mount, D. M., & Papadimitriou, C. H. (1987) · SIAM Journal on Computing · doi:10.1137/0216045 · Cited by 720
Metadata
- Authors
- Lozano-Pérez, T., & Wesley, M. A.
- Venue
- Communications of the ACM
- Published
- 1979-10
- Volume
- 22
- Issue
- 10
- Pages
- 560-570
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2163178194
- Cited by
- 2,304
- References
- 1
- FWCI
- 16.58
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An algorithm for planning collision-free paths among polyhedral obstacles. https://app.cochat.ai/papers/10.1145/359156.359164
- The paper
- Lozano-Pérez, T., & Wesley, M. A. (1979). An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM. https://doi.org/10.1145/359156.359164
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
