The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Mobile robot path planning using membrane evolutionary artificial potential field
Abstract
Abstract In this paper, a membrane evolutionary artificial potential field (memEAPF) approach for solving the mobile robot path planning problem is proposed, which combines membrane computing with a genetic algorithm (membrane-inspired evolutionary algorithm with one-level membrane structure) and the artificial potential field method to find the parameters to generate a feasible and safe path. The memEAPF proposal consists of delimited compartments where multisets of parameters evolve according to rules of biochemical inspiration to minimize the path length. The proposed approach is compared with artificial potential field based path planning methods concerning to their planning performance on a set of twelve benchmark test environments, and it exhibits a better performance regarding path length. Experiments to demonstrate the statistical significance of the improvements achieved by the proposed approach in static and dynamic environments are shown. Moreover, the implementation results using parallel architectures proved the effectiveness and practicality of the proposal to obtain solutions in considerably less time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Păun, G. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1693 · Cited by 2,279
Introduction to autonomous mobile robots
(2011) · Choice Reviews Online · doi:10.5860/choice.49-1492 · Cited by 2,169
García, S., Molina, D., Lozano, M., & Herrera, F. (2009) · Journal of Heuristics · doi:10.1007/s10732-008-9080-4 · Cited by 1,719
Potential field methods and their inherent limitations for mobile robot navigation
Koren, Y., & Borenstein, J. (2002) · Proceedings. 1991 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1991.131810 · Cited by 1,570
The complexity of robot motion planning
Canny, J. (1988) · Medical Entomology and Zoology · Cited by 1,375
Roberge, V., Tarbouchi, M., & Labonte, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2198665 · Cited by 1,059
New potential functions for mobile robot path planning
Ge, S. S., & Cui, Y. (2000) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.880813 · Cited by 868
(2012) · Cited by 466
Metadata
- Authors
- Orozco-Rosas, U., Montiel, O., & Sepúlveda, R.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 77
- Pages
- 236-251
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2911283711
- Cited by
- 426
- References
- 34
- FWCI
- 22.46
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Mobile robot path planning using membrane evolutionary artificial potential field. https://app.cochat.ai/papers/10.1016/j.asoc.2019.01.036
- The paper
- Orozco-Rosas, U., Montiel, O., & Sepúlveda, R. (2019). Mobile robot path planning using membrane evolutionary artificial potential field. Applied Soft Computing. https://doi.org/10.1016/j.asoc.2019.01.036
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.
