The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Solving the find-path problem by good representation of free space
Abstract
Free space is represented as a union of (possibly overlapping) generalized cones. An algorithm is presented which efficiently finds good collision-free paths for convex polygonal bodies through space littered with obstacle polygons. The paths are good in the sense that the distance of closest approach to an obstacle over the path is usually far from minimal over the class of topologically equivalent collision-free paths. The algorithm is based on characterizing the volume swept by a body as it is translated and rotated as a generalized cone, and determining under what conditions one generalized cone is a subset of another.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Obstacle avoidance and navigation in the real world by a seeing robot rover
Moravec, H. (2018) · KiltHub Repository · doi:10.1184/r1/6557033 · Cited by 842
Automatic Planning of Manipulator Transfer Movements
Lozano-Perez, T. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308589 · Cited by 692
Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.
Bledsoe, W. W. (1971) · ACM SIGART Bulletin · doi:10.1145/1056578.1056583 · Cited by 356
Cited by
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894
“free path planning algorithms (Lozano-Perez 1980; Moravec 1980; Chatila 1981; Brooks 1983).”
MethodReal-time obstacle avoidance for manipulators and mobile robots
Khatib, O. (2005) · Proceedings. 1985 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1985.1087247 · Cited by 1,757
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · Autonomous Robot Vehicles · doi:10.1007/978-1-4613-8997-2_29 · Cited by 1,569
Dynamic sensor-based control of robots with visual feedback
Weiss, L., Sanderson, A., & Neuman, C. (1987) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1987.1087115 · Cited by 830
Gross motion planning—a survey
Hwang, Y. K., & Ahuja, N. (1992) · ACM Computing Surveys · doi:10.1145/136035.136037 · Cited by 826
Metadata
- Authors
- Brooks, R. A.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1983-03
- Volume
- SMC-13
- Issue
- 2
- Pages
- 190-197
- ISSN
- 0018-9472 (ISSN-L)
- 2168-2909
- OpenAlex
- W1602132814
- Cited by
- 601
- References
- 3
- FWCI
- 37.26
- 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
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.