Reinforcement based mobile robot navigation in dynamic environment

• Published in: Robotics and computer-integrated manufacturing Vol. 27; no. 1; pp. 135 - 149
• Main Authors: Kareem Jaradat, Mohammad Abdel, Al-Rousan, Mohammad, Quadan, Lara
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.02.2011
• Subjects: Algorithms; Automation; Dynamics; Industrial robots; Manufacturing engineering; Mobile target; Navigation; Path planning; Potential filed force; Q-learning; Robot navigation; Robotics; Robots; Unsupervised learning; Mobile target; Q-learning; Path planning; Robot navigation; Potential filed force; Unsupervised learning
• ISSN: 0736-5845; 1879-2537
• DOI: 10.1016/j.rcim.2010.06.019

In this paper, a new approach is developed for solving the problem of mobile robot path planning in an unknown dynamic environment based on Q-learning. Q-learning algorithms have been used widely for solving real world problems, especially in robotics since it has been proved to give reliable and efficient solutions due to its simple and well developed theory. However, most of the researchers who tried to use Q-learning for solving the mobile robot navigation problem dealt with static environments; they avoided using it for dynamic environments because it is a more complex problem that has infinite number of states. This great number of states makes the training for the intelligent agent very difficult. In this paper, the Q-learning algorithm was applied for solving the mobile robot navigation in dynamic environment problem by limiting the number of states based on a new definition for the states space. This has the effect of reducing the size of the Q-table and hence, increasing the speed of the navigation algorithm. The conducted experimental simulation scenarios indicate the strength of the new proposed approach for mobile robot navigation in dynamic environment. The results show that the new approach has a high Hit rate and that the robot succeeded to reach its target in a collision free path in most cases which is the most desirable feature in any navigation algorithm.