Abstract

With the continuous change of artificial intelligence technology, the study of path planning for mobile robots is no longer limited to traditional path algorithms. Reinforcement learning, as an artificial intelligence algorithm with excellent performance in the field of path planning, has also gradually become the object of research on path planning. In order to find a fast path from the starting point to the end point of a mobile robot in a complex environment, reinforcement learning is used to find a valid path by sensing the environment and continuously receiving rewarding feedback through a method of trial and error learning like humans. Therefore, this paper selects two algorithms to verify their effectiveness on the basis of building a two-dimensional grid map. The final experimental results show that both reinforcement learning algorithms can eventually avoid obstacles and plan a valid path in a complex environment through continuous learning iterations. Q-Learning also reduces the path distance by 10% and the number of convergence iterations by 82% compared to Sarsa.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call