Reinforcement learning based local path planning for mobile robot
Mehmet Gok, Mehmet Tekerek, Hamza Aydemir

TL;DR
This paper explores the use of deep Q-Learning and Deep DQN architectures for local path planning in mobile robots, aiming to improve obstacle avoidance and navigation in dynamic environments.
Contribution
It evaluates deep reinforcement learning algorithms specifically for local path planning, addressing challenges in online and offline robot navigation.
Findings
Deep Q-Learning methods effectively avoid obstacles in dynamic environments.
Deep DQN architectures outperform traditional path planning algorithms.
Reinforcement learning enables adaptive and real-time navigation for mobile robots.
Abstract
Different methods are used for a mobile robot to go to a specific target location. These methods work in different ways for online and offline scenarios. In the offline scenario, an environment map is created once, and fixed path planning is made on this map to reach the target. Path planning algorithms such as A* and RRT (Rapidly-Exploring Random Tree) are the examples of offline methods. The most obvious situation here is the need to re-plan the path for changing conditions of the loaded map. On the other hand, in the online scenario, the robot moves dynamically to a given target without using a map by using the perceived data coming from the sensors. Approaches such as SFM (Social Force Model) are used in online systems. However, these methods suffer from the requirement of a lot of dynamic sensing data. Thus, it can be said that the need for re-planning and mapping in offline…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms
MethodsConvolution · Dense Connections · Focus · Deep Q-Network · Q-Learning
