Rule-Based Reinforcement Learning for Efficient Robot Navigation with Space Reduction
Yuanyang Zhu, Zhi Wang, Chunlin Chen, and Daoyi Dong

TL;DR
This paper introduces a rule-based reinforcement learning algorithm for robot navigation that reduces exploration space and accelerates learning, combining classical rules with RL to improve efficiency in complex environments.
Contribution
The paper proposes a novel rule-based RL method that reduces sample complexity and exploration space, with theoretical guarantees and practical validation on real robots.
Findings
Reduced exploration space improves learning efficiency.
Theoretical guarantee that optimal paths are within the reduced space.
Experimental results show enhanced navigation performance.
Abstract
For real-world deployments, it is critical to allow robots to navigate in complex environments autonomously. Traditional methods usually maintain an internal map of the environment, and then design several simple rules, in conjunction with a localization and planning approach, to navigate through the internal map. These approaches often involve a variety of assumptions and prior knowledge. In contrast, recent reinforcement learning (RL) methods can provide a model-free, self-learning mechanism as the robot interacts with an initially unknown environment, but are expensive to deploy in real-world scenarios due to inefficient exploration. In this paper, we focus on efficient navigation with the RL technique and combine the advantages of these two kinds of methods into a rule-based RL (RuRL) algorithm for reducing the sample complexity and cost of time. First, we use the rule of…
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
MethodsSelf-Learning
