A reinforcement learning with adaptive state space recruitment strategy for real autonomous mobile robots

Author(s):  
T. Kondo ◽  
K. Ito
2013 ◽  
Vol 14 (3) ◽  
pp. 167-178 ◽  
Author(s):  
Xin Ma ◽  
Ya Xu ◽  
Guo-qiang Sun ◽  
Li-xia Deng ◽  
Yi-bin Li

2020 ◽  
Vol 8 (6) ◽  
pp. 4333-4338

This paper presents a thorough comparative analysis of various reinforcement learning algorithms used by autonomous mobile robots for optimal path finding and, we propose a new algorithm called Iterative SARSA for the same. The main objective of the paper is to differentiate between the Q-learning and SARSA, and modify the latter. These algorithms use either the on-policy or off-policy methods of reinforcement learning. For the on-policy method, we have used the SARSA algorithm and for the off-policy method, the Q-learning algorithm has been used. These algorithms also have an impacting effect on finding the shortest path possible for the robot. Based on the results obtained, we have concluded how our algorithm is better than the current standard reinforcement learning algorithms


2001 ◽  
Vol 13 (6) ◽  
pp. 625-636 ◽  
Author(s):  
Takayuki Nakamura ◽  
◽  
Tsukasa Ogasawara

An input generalization problem is one of the most important in applying reinforcement learning to real robot tasks. To cope with this problem, we propose a self-partitioning state space algorithm, which can make nonuniform quantization of state space. To show that our algorithm has generalization capability, we apply our method to two tasks in which a soccer robot shoots a ball into a goal and prevent a ball from entering a goal. To show the validity of this method, the experimental results for computer simulation and a real robot are shown.


Sign in / Sign up

Export Citation Format

Share Document