The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Motion planning in a plane using generalized Voronoi diagrams
Abstract
An algorithm for planning a collision-free path for a rectangle in a planar workspace populated with polygonal obstacles is presented. Heuristic techniques are used to plan the motion along a nominal path obtained from a generalized Voronoi diagram (GVD). The algorithm was demonstrated to be quite fast with execution times comparable to, or exceeding, those of the freeway method. Unlike the freeway method, the GVD technique can be successfully applied to difficult problems which arise in cluttered workspaces. The planned paths stay well away from the obstacles when possible and are somewhat shorter than the freeway paths due to parabolic arcs around corners. Furthermore, motion along the paths is smooth in the sense that rotations are performed during translation, not just at isolated points in the workspace.>
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
An algorithm for planning collision-free paths among polyhedral obstacles
Lozano-Pérez, T., & Wesley, M. A. (1979) · Communications of the ACM · doi:10.1145/359156.359164 · Cited by 2,304
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
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
Schwartz, J. T., & Sharir, M. (1983) · Advances in Applied Mathematics · doi:10.1016/0196-8858(83)90014-3 · Cited by 801
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
Solving the find-path problem by good representation of free space
Brooks, R. A. (1983) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1983.6313112 · Cited by 601
Solving 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
A subdivision algorithm in configuration space for findpath with rotation
Brooks, R. A., & Lozano-Perez, T. (1985) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1985.6313352 · Cited by 550
Schwartz, J. T., & Sharir, M. (1983) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160360305 · Cited by 454
Multiresolution 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
Cited by
A Survey of Motion Planning and Control Techniques for Self-Driving Urban Vehicles
Paden, B., Cap, M., Yong, S. Z., Yershov, D., & Frazzoli, E. (2016) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2016.2578706 · Cited by 2,585
A review: On path planning strategies for navigation of mobile robot
Patle, B. K., Babu L, G., Pandey, A., Parhi, D. R. K., & Jagadeesh, A. (2019) · Defence Technology · doi:10.1016/j.dt.2019.04.011 · Cited by 914
Katrakazas, C., Quddus, M., Chen, W.-H., & Deka, L. (2015) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2015.09.011 · Cited by 800
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
A sensor-based navigation for a mobile robot using fuzzy logic and reinforcement learning
Beom, H. R., & Cho, H. S. (1995) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.364859 · Cited by 291
Embedded nonlinear model predictive control for obstacle avoidance using PANOC
Sathya, A., Sopasakis, P., Van Parys, R., Themelis, A., Pipeleers, G., & Patrinos, P. (2018) · 2018 European Control Conference (ECC) · doi:10.23919/ecc.2018.8550253 · Cited by 105
Metadata
- Authors
- Takahashi, O., & Schilling, R. J.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 1989-04
- Volume
- 5
- Issue
- 2
- Pages
- 143-150
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W1974909294
- Cited by
- 417
- References
- 14
- FWCI
- 6.00
- 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.