Omar Abdul Razzaq Abdul Wahhab; .Ahmed S. Al-Araji1
Volume 21, Issue 2 , June 2021, , Page 44-58
Abstract
The goal of navigating a mobile robot is to find the optimal path to direct itsmovement, so path planning is the best solution to find the optimal path. Therefore, thetwo most important problems of path planning must be solved; the first is that the pathmust avoid collision with obstacles, and second ...
Read More ...
The goal of navigating a mobile robot is to find the optimal path to direct itsmovement, so path planning is the best solution to find the optimal path. Therefore, thetwo most important problems of path planning must be solved; the first is that the pathmust avoid collision with obstacles, and second it must reduce the length of the path to aminimum. This paper will discuss finding the shortest path with the optimum cost functionby using the Chaotic Particle Swarm Optimization (CPSO), and A*, compare the resultsbetween them and the proposed hybrid algorithm that combines A* and Chaotic ParticleSwarm Optimization (ACPSO) algorithms to enhance A* algorithm to find the optimalpath and velocities of the wheeled mobile robot. These algorithms are simulated byMATLAB in a fixed obstacles environment to show the effectiveness of the proposedalgorithm in terms of minimum number of an evaluation function and the shortest pathlength as well as to obtain the optimal or near optimal wheel velocities.
