Cited by 57Reinforcement Learning in RoboticsRobotic Path Planning AlgorithmsRobotics and Sensor-Based Localization

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

Open access
Zhu, Yuanyang, Wang, Zhi, Chen, Chunlin, Dong, Daoyi·2022·IEEE/ASME Transactions on Mechatronics

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 article, 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.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tmech.2021.3072675

Cites

48 of 48 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Zhu, Y., Wang, Z., Chen, C., & Dong, D.
Affiliations
  • Nanjing University (CN)
  • UNSW Canberra (AU)
Venue
IEEE/ASME Transactions on Mechatronics
Published
2022-04
Volume
27
Issue
2
Pages
846-857
ISSN
  • 1083-4435 (ISSN-L)
  • 1941-014X
OpenAlex
W3154227779
Cited by
57
References
48
Citations by year
2026: 8 · 2025: 12 · 2024: 20 · 2023: 12 · 2022: 3 · 2021: 2
FWCI
3.27
Type
journal article
Language
en
Open access
Locations
  • IEEE/ASME Transactions on Mechatronics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Natural Science Foundation of China (71732003, 62073160, 62006111)
  • National Key Research and Development Program of China (2018AAA0101100)
  • Synergistic Innovation Center of Jiangsu Modern Agricultural Equipment and Technology (4091600002)
  • Australian Research Councils’s Discovery Projects (DP190101566)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotic Path Planning Algorithms
  • Physical Sciences › Engineering › Aerospace Engineering › Robotics and Sensor-Based Localization
Keywords
robot navigation, wall following, sample complexity reduction, autonomous robots

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review