The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Roadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path
Abstract
Path planning still remains one of the core problems in modern robotic applications, such as the design of autonomous vehicles and perceptive systems. The basic path-planning problem is concerned with finding a good-quality path from a source point to a destination point that does not result in collision with any obstacles. In this article, we chose the roadmap approach and utilized the Voronoi diagram to obtain a path that is a close approximation of the shortest path satisfying the required clearance value set by the user. The advantage of the proposed technique versus alternative path-planning methods is in its simplicity, versatility, and efficiency.
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
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
LaValle, S. M. (2006) · Cited by 4,177
RRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
Real-time obstacle avoidance for fast mobile robots
Borenstein, J., & Koren, Y. (1989) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.44033 · Cited by 1,258
Path planning in expansive configuration spaces
Hsu, D., Latombe, J.-C., & Motwani, R. (2002) · Proceedings of International Conference on Robotics and Automation · doi:10.1109/robot.1997.619371 · Cited by 552
Randomized incremental construction of Delaunay and Voronoi diagrams
Guibas, L. J., Knuth, D. E., & Sharir, M. (1992) · Algorithmica · doi:10.1007/bf01758770 · Cited by 479
Coordination and Geometric Optimization via Distributed Dynamical Systems
Cortés, J., & Bullo, F. (2005) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012903428652 · Cited by 452
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
Global path planning using artificial potential fields
Warren, C. W. (2003) · Proceedings, 1989 International Conference on Robotics and Automation · doi:10.1109/robot.1989.100007 · Cited by 370
A randomized roadmap method for path and manipulation planning
Amato, N. M., & Wu, Y. (2002) · Proceedings of IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1996.503582 · Cited by 369
Coordinated path planning for multiple robots
Švestka, P., & Overmars, M. H. (1998) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(97)00033-x · Cited by 270
PATH PLANNING IN EXPANSIVE CONFIGURATION SPACES
HSU, D., LATOMBE, J.-C., & MOTWANI, R. (1999) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195999000285 · Cited by 266
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
Avnaïm, F., Boissonnat, J. D., & Faverjon, B. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51683-2_25 · Cited by 149
A voronoi diagram‐visibility graph‐potential field compound algorithm for robot path planning
Masehian, E., & Amin‐Naseri, M. R. (2004) · Journal of Robotic Systems · doi:10.1002/rob.20014 · Cited by 147
Mazer, E., Ahuactzin, J.-M., & Bessìère, P. (1998) · Journal of Artificial Intelligence Research · doi:10.1613/jair.468 · Cited by 127
The visibility–Voronoi complex and its applications
Ron Wein, C., van den Berg, J., & Halperin, D. (2006) · Computational Geometry · doi:10.1016/j.comgeo.2005.11.007 · Cited by 110
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
Avnaïm, F., Boissonnat, J. D., & Faverjon, B. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1988.12304 · Cited by 101
Delete and insert operations in Voronoi/Delaunay methods and applications
Mostafavi, M. A., Gold, C., & Dakowicz, M. (2003) · Computers & Geosciences · doi:10.1016/s0098-3004(03)00017-7 · Cited by 97
Anytime dynamic path-planning with flexible probabilistic roadmaps
Belghith, K., Kabanza, F., Hartman, L., & Nkambou, R. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2006.1642057 · Cited by 63
Asymptotic Optimality of Multicenter Voronoi Configurations for Random Field Estimation
Graham, R., & Cortés, J. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2007179 · Cited by 44
Interactive manipulation planning for animated characters
Kuffner, J., & Latombe, J.-C. (2002) · Pacific Conference on Computer Graphics and Applications · doi:10.1109/pccga.2000.883973 · Cited by 33
Path planning in dynamic environment using an adaptive mesh
Brož, P., Kolingerová, I., Zítka, P., Apu, R. A., & Gavrilova, M. L. (2007) · Spring Conference on Computer Graphics · doi:10.1145/2614348.2614381 · Cited by 11
Self-citationAsymptotic optimality of multicenter Voronoi configurations for random field estimation
Graham, R., & Cortés, J. (2007) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2007.4434942 · Cited by 5
Cited by
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
Agricultural robots for field operations: Concepts and components
Bechar, A., & Vigneault, C. (2016) · Biosystems Engineering · doi:10.1016/j.biosystemseng.2016.06.014 · Cited by 778
Song, B., Wang, Z., & Zou, L. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106960 · Cited by 441
Mobile robot path planning using membrane evolutionary artificial potential field
Orozco-Rosas, U., Montiel, O., & Sepúlveda, R. (2019) · Applied Soft Computing · doi:10.1016/j.asoc.2019.01.036 · Cited by 426
Path Smoothing Techniques in Robot Navigation: State-of-the-Art, Current and Future Challenges
Ravankar, A., Ravankar, A. A., Kobayashi, Y., Hoshino, Y., & Peng, C.-C. (2018) · Sensors · doi:10.3390/s18093170 · Cited by 314
Metadata
- Authors
- Bhattacharya, P., & Gavrilova, M.
- Venue
- IEEE Robotics & Automation Magazine
- Published
- 2008-06
- Volume
- 15
- Issue
- 2
- Pages
- 58-66
- ISSN
- 1070-9932 (ISSN-L)
- OpenAlex
- W2116772004
- Cited by
- 312
- References
- 24
- FWCI
- 10.50
- 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.