The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Mobile robot path planning using artificial bee colony and evolutionary programming
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
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
LaValle, S. M. (2006) · Cited by 4,177
A comparative study of Artificial Bee Colony algorithm
Karaboga, D., & Akay, B. (2009) · Applied Mathematics and Computation · doi:10.1016/j.amc.2009.03.090 · Cited by 3,206
Principles of Robot Motion: Theory, Algorithms, and Implementations
Choset, H., & Latombe, J. (2005) · Medical Entomology and Zoology · Cited by 2,149
Adaptive evolutionary planner/navigator for mobile robots
Xiao, J., Michalewicz, Z., Zhang, L., & Trojanowski, K. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585889 · Cited by 408
Intelligence Through Simulated Evolution: Forty Years of Evolutionary Programming
Fogel, L. J. (1999) · Medical Entomology and Zoology · Cited by 262
Classic And Heuristic Approaches In Robot Motion Planning A Chronological Review
Masehian, E., & Sedighizadeh, D. (2007) · doi:10.5281/zenodo.1074971 · Cited by 209
A multi-objective PSO-based algorithm for robot path planning
Masehian, E., & Sedighizadeh, D. (2010) · IEEE International Conference on Industrial Technology (ICIT) · doi:10.1109/icit.2010.5472755 · Cited by 137
Measure theoretic analysis of probabilistic path planning
Ladd, A. M., & Kavraki, L. E. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.824649 · Cited by 128
Multi-objective Mobile Robot Path Planning Based on Improved Genetic Algorithm
Jun, H., & Qingbao, Z. (2010) · International Conference on Intelligent Computation Technology and Automation · doi:10.1109/icicta.2010.300 · Cited by 68
A generic infrastructure for benchmarking motion planners
Cohen, B. J., Sucan, I. A., & Chitta, S. (2012) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2012.6386228 · Cited by 50
Cited by
Tang, J., Liu, G., & Pan, Q. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1004129 · Cited by 996
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
Nazarahari, M., Khanmirza, E., & Doostie, S. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.08.008 · Cited by 454
Path Planning for the Mobile Robot: A Review
Zhang, H.-Y., Lin, W.-M., & Chen, A.-X. (2018) · Symmetry · doi:10.3390/sym10100450 · Cited by 447
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
Metadata
- Authors
- Contreras-Cruz, M. A., Ayala-Ramirez, V., & Hernandez-Belmonte, U. H.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2015-05
- Volume
- 30
- Pages
- 319-328
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2145602088
- Cited by
- 295
- References
- 11
- FWCI
- 20.51
- 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.