Deep Recurrent Q-learning for Energy-constrained Coverage with a Mobile Robot
Not on the map. Why?
Abstract (arXiv)
In this paper, we study the problem of coverage of an environment with an energy-constrained robot in the presence of multiple charging stations. As the robot's on-board power supply is limited, it might not have enough energy to cover all the points in the environment with a single charge. Instead, it will need to stop at one or more charging stations to recharge its battery intermittently. The robot cannot violate the energy constraint, i.e., visit a location with negative available energy. To solve this problem, we propose a deep Q-learning framework that produces a policy to maximize the coverage and minimize the budget violations. Our proposed framework also leverages the memory of a recurrent neural network (RNN) to better suit this multi-objective optimization problem. We have tested the presented framework within a 16 x 16 grid environment having charging stations and various obstacle configurations. Results show that our proposed method finds feasible solutions and outperforms a comparable existing technique.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 8 of its 47 references that are in the map. First posted on arXiv 1 Oct 2022.
Builds on
8 of 47 references.
References · 8
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2015Prioritized Experience Replaycited by 1,070
- 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 457
- 2020Revisiting Fundamentals of Experience Replaycited by 171
- 2020UAV Coverage Path Planning under Varying Power Constraints using Deep Reinforcement Learningcited by 15
- 2017A Survey of Shortest-Path Algorithmscited by 10
- 2021Reinforcement Learning-Based Coverage Path Planning with Implicit Cellular Decompositioncited by 6
- 2013Algorithms for Routing an Unmanned Aerial Vehicle in the presence of Refueling Depotscited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.