.png){kind=icon}
.png){kind=icon}
Return
Mobile robot path planning using artificial bee colony and evolutionary programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2015.01.067.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, an evolutionary approach to solve the mobile robot path planning problem is proposed. The proposed approach combines the artificial bee colony algorithm as a local search procedure and the evolutionary programming algorithm to refine the feasible path found by a set of local procedures. The proposed method is compared to a classical probabilistic roadmap method (PRM) with respect to their planning performances on a set of benchmark problems and it exhibits a better performance. Criteria used to measure planning effectiveness include the path length, the smoothness of planned paths, the computation time and the success rate in planning. Experiments to demonstrate the statistical significance of the improvements achieved by the proposed method are also shown. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Mobile robot
Path planning
Meta-heuristic techniques
Artificial bee colony
Evolutionary programming
Probabilistic roadmap
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
