The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimal path planning for a mobile robot using cuckoo search algorithm
Abstract
The shortest/optimal path planning is essential for efficient operation of autonomous vehicles. In this article, a new nature-inspired meta-heuristic algorithm has been applied for mobile robot path planning in an unknown or partially known environment populated by a variety of static obstacles. This meta-heuristic algorithm is based on the levy flight behaviour and brood parasitic behaviour of cuckoos. A new objective function has been formulated between the robots and the target and obstacles, which satisfied the conditions of obstacle avoidance and target-seeking behaviour of robots present in the terrain. Depending upon the objective function value of each nest (cuckoo) in the swarm, the robot avoids obstacles and proceeds towards the target. The smooth optimal trajectory is framed with this algorithm when the robot reaches its goal. Some simulation and experimental results are presented at the end of the paper to show the effectiveness of the proposed navigational controller.
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
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894 · cited 1×
“…as visibility graph (Mitchell, 1988), voronoi diagrams (Takahashi & Schilling, 1989), grids (Weigl, Siemiaatkkowska, Sikorski, & Borkowski, 1993), cell decomposition (Lingelbach, 2004) and artificial potential field (Andrews & Hogan, 1983; Khatib, 1985) are not suitable for online implementations.”
Background
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
Self-citationVision-based navigation and guidance for agricultural autonomous vehicles and robots: A review
Bai, Y., Zhang, B., Xu, N., Zhou, J., Shi, J., & Diao, Z. (2023) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2022.107584 · Cited by 353
Metadata
- Authors
- Mohanty, P. K., & Parhi, D. R.
- Venue
- Journal of Experimental & Theoretical Artificial Intelligence
- Publisher
- Informa UK Limited
- Published
- 2014-11-06
- Volume
- 28
- Issue
- 1-2
- Pages
- 35-52
- ISSN
- 0952-813X (ISSN-L)
- 1362-3079
- OpenAlex
- W1975602954
- Cited by
- 159
- References
- 1
- FWCI
- 3.56
- 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: Optimal path planning for a mobile robot using cuckoo search algorithm. https://app.cochat.ai/papers/10.1080/0952813x.2014.971442
- The paper
- Mohanty, P. K., & Parhi, D. R. (2016). Optimal path planning for a mobile robot using cuckoo search algorithm. Journal of Experimental & Theoretical Artificial Intelligence. https://doi.org/10.1080/0952813x.2014.971442
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.