The DOI matches its Crossref record.
A subdivision algorithm in configuration space for findpath with rotation
Open accessAbstract
A recursive cellular representation for configuration space is presented along with an algorithm for searching that space for collision-free paths. The details of the algorithm are presented for polygonal obstacles and a moving object with two translational and one rotational degrees of freedom.
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
Cited by
The Quadtree and Related Hierarchical Data Structures
Samet, H. (1984) · ACM Computing Surveys · doi:10.1145/356924.356930 · Cited by 2,205
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
A fast procedure for computing the distance between complex objects in three-dimensional space
Gilbert, E. G., Johnson, D. W., & Keerthi, S. S. (1988) · IEEE Journal on Robotics and Automation · doi:10.1109/56.2083 · Cited by 1,513
Robot Motion Planning: A Distributed Representation Approach
Barraquand, J., & Latombe, J.-C. (1991) · The International Journal of Robotics Research · doi:10.1177/027836499101000604 · Cited by 995
Path planning techniques for unmanned aerial vehicles: A review, solutions, and challenges
Aggarwal, S., & Kumar, N. (2020) · Computer Communications · doi:10.1016/j.comcom.2019.10.014 · Cited by 971
Automatic Synthesis of Fine-Motion Strategies for Robots
Lozano-Pérez, T., Mason, M. T., & Taylor, R. H. (1984) · The International Journal of Robotics Research · doi:10.1177/027836498400300101 · Cited by 898
Numerical potential field techniques for robot path planning
Barraquand, J., Langlois, B., & Latombe, J.-C. (1992) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.148426 · Cited by 889
Gross motion planning—a survey
Hwang, Y. K., & Ahuja, N. (1992) · ACM Computing Surveys · doi:10.1145/136035.136037 · Cited by 826
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
Kant, K., & Zucker, S. W. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500304 · Cited by 753
Erdmann, M., & Lozano-Pérez, T. (1987) · Algorithmica · doi:10.1007/bf01840371 · Cited by 736
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
A simple motion-planning algorithm for general robot manipulators
Lozano-Perez, T. (1987) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1987.1087095 · Cited by 618
Self-citationSolving the Find-Path Problem by Good Representation of Free Space
Brooks, R. A. (1990) · Autonomous Robot Vehicles · doi:10.1007/978-1-4613-8997-2_22 · Cited by 588
Self-citationMultiresolution path planning for mobile robots
Kambhampati, S., & Davis, L. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087051 · Cited by 442
Motion planning in a plane using generalized Voronoi diagrams
Takahashi, O., & Schilling, R. J. (1989) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.88035 · Cited by 417
Optimal kinodynamic motion planning using incremental sampling-based methods
Karaman, S., & Frazzoli, E. (2010) · 49th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717430 · Cited by 416
Optimal path planning of mobile robots: A review
Raja, P. (2012) · International Journal of the Physical Sciences · doi:10.5897/ijps11.1745 · Cited by 404
Collision Detection for Moving Polyhedra
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767773 · Cited by 334
Barraquand, J., & Latombe, J. C. (1993) · Algorithmica · doi:10.1007/bf01891837 · Cited by 293
Motion Planning Networks: Bridging the Gap Between Learning-Based and Classical Motion Planners
Qureshi, A. H., Miao, Y., Simeonov, A., & Yip, M. C. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3006716 · Cited by 287
PQ-RRT*: An improved path planning algorithm for mobile robots
Li, Y., Wei, W., Gao, Y., Wang, D., & Fan, Z. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113425 · Cited by 277
A mobile robot exploration algorithm
Zelinsky, A. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.182671 · Cited by 273
Qureshi, A. H., & Ayaz, Y. (2015) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2015.02.007 · Cited by 262
Moore, A. W., & Atkeson, C. G. (1995) · Machine Learning · doi:10.1023/a:1022656217772 · Cited by 259
Metadata
- Authors
- Brooks, R. A., & Lozano-Perez, T.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1985-03
- Volume
- SMC-15
- Issue
- 2
- Pages
- 224-233
- ISSN
- 0018-9472 (ISSN-L)
- 2168-2909
- OpenAlex
- W2077091230
- Cited by
- 550
- References
- 0
- FWCI
- 30.06
- Type
- journal article
- Language
- en
- Open access
- green
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.