Mobile robot path planning using q-learning with guided Distance

In path planning for mobile robot, classical Q-learning algorithm requires high iteration counts and longer time taken to achieve conver-gence. This is due to the beginning stage of classical Q-learning for path planning consists of mostly exploration, involving random di-rection decision making. This paper proposed the addition of distance aspect into direction decision making in Q-learning. This feature is used to reduce the time taken for the Q-learning to fully converge. In the meanwhile, random direction decision making is added and activated when mobile robot gets trapped in local optima. This strategy enables the mobile robot to escape from local optimal trap. The results show that the time taken for the improved Q-learning with distance guiding to converge is longer than the classical Q-learning. However, the total number of steps used is lower than the classical Q-learning