Collision-free intelligent path planning in uncertain terrains for wheeled mobile robots based on dynamic learning Cuckoo Search Algorithm

Intelligent path planning is crucial for mobile robots to reach their destination safely and efficiently. This work presents three variants of a Dynamic Learning Cuckoo Search (DLCS) algorithm to automatically generate obstacle-free optimal paths for mobile robots operating in uncertain terrains. Unlike conventional Cuckoo Search–based approaches, the proposed DLCS integrates a dynamic learning strategy and a multi-objective fitness function that improves obstacle avoidance, path continuity and overall path optimality. The proposed DLCS framework enhances path planning efficiency by reducing path length and travel time while maintaining collision-free navigation. Simulation results indicate that the DLCS-II variant achieves faster convergence and consistently shorter paths compared to existing state-of-the-art methods. To assess the reliability of the proposed approach, real-world experiments were conducted using a Khepera-IV mobile robot. The experimental results demonstrate good consistency with simulation outcomes, with path length deviations below 6% and travel time deviations below 2.5 s during robot motion.

Authors

Institutions

Publication Details

Journal
Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science
Published
2026-04-01
DOI
https://doi.org/10.1177/09544062261434346
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Collision-free intelligent path planning in uncertain terrains for wheeled mobile robots based on dynamic learning Cuckoo Search Algorithm

Prases Kumar Mohanty, Shubhajit Das, G Krishna Teja
Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science
Robotic Path Planning Algorithms
article

Collision-free intelligent path planning in uncertain terrains for wheeled mobile robots based on dynamic learning Cuckoo Search Algorithm

Prases Kumar Mohanty, Shubhajit Das, G Krishna Teja
article en

Abstract

Intelligent path planning is crucial for mobile robots to reach their destination safely and efficiently. This work presents three variants of a Dynamic Learning Cuckoo Search (DLCS) algorithm to automatically generate obstacle-free optimal paths for mobile robots operating in uncertain terrains. Unlike conventional Cuckoo Search–based approaches, the proposed DLCS integrates a dynamic learning strategy and a multi-objective fitness function that improves obstacle avoidance, path continuity and overall path optimality. The proposed DLCS framework enhances path planning efficiency by reducing path length and travel time while maintaining collision-free navigation. Simulation results indicate that the DLCS-II variant achieves faster convergence and consistently shorter paths compared to existing state-of-the-art methods. To assess the reliability of the proposed approach, real-world experiments were conducted using a Khepera-IV mobile robot. The experimental results demonstrate good consistency with simulation outcomes, with path length deviations below 6% and travel time deviations below 2.5 s during robot motion.

Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science
Assam University (IN), National Institute of Technology Arunachal Pradesh (IN)
Openalex Percentile: Top 31%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.