mlsanityData to 7 Oct 2026

Rule-Based Reinforcement Learning for Efficient Robot Navigation with Space Reduction

arXiv 2104.07282 ↗First posted 15 Apr 2021cs.RO cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

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 wall-following to generate a closed-loop trajectory. Second, we employ a reduction rule to shrink the trajectory, which in turn effectively reduces the redundant exploration space. Besides, we give the detailed theoretical guarantee that the optimal navigation path is still in the reduced space. Third, in the reduced space, we utilize the Pledge rule to guide the exploration strategy for accelerating the RL process at the early stage. Experiments conducted on real robot navigation problems in hex-grid environments demonstrate that RuRL can achieve improved navigation performance.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 12 of its 51 references that are in the map. First posted on arXiv 15 Apr 2021.

Builds on

12 of 51 references.

References · 12

  1. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  2. 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 514
  3. 2018Is Q-learning Provably Efficient?cited by 485
  4. 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
  5. 2017Count-Based Exploration with Neural Density Modelscited by 255
  6. 2019Vision-and-Dialog Navigationcited by 246
  7. 2014Generalization and Exploration via Randomized Value Functionscited by 112
  8. 2017PRM-RL: Long-range Robotic Navigation Tasks by Combining Reinforcement Learning and Sampling-based Planningcited by 64
  9. 2019COBRA: Data-Efficient Model-Based RL through Unsupervised Object Discovery and Curiosity-Driven Explorationcited by 55
  10. 2018HexaConvcited by 27
  11. 2020Lifelong Incremental Reinforcement Learning with Online Bayesian Inferencecited by 23
  12. 2018Curiosity Driven Exploration of Learned Disentangled Goal Spacescited by 16

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 3; 2025: 2; 2026: 2.

9 papers.