Efficient Exploration in Resource-Restricted Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
In many real-world applications of reinforcement learning (RL), performing actions requires consuming certain types of resources that are non-replenishable in each episode. Typical applications include robotic control with limited energy and video games with consumable items. In tasks with non-replenishable resources, we observe that popular RL methods such as soft actor critic suffer from poor sample efficiency. The major reason is that, they tend to exhaust resources fast and thus the subsequent exploration is severely restricted due to the absence of resources. To address this challenge, we first formalize the aforementioned problem as a resource-restricted reinforcement learning, and then propose a novel resource-aware exploration bonus (RAEB) to make reasonable usage of resources. An appealing feature of RAEB is that, it can significantly reduce unnecessary resource-consuming trials while effectively encouraging the agent to explore unvisited states. Experiments demonstrate that the proposed RAEB significantly outperforms state-of-the-art exploration strategies in resource-restricted reinforcement learning environments, improving the sample efficiency by up to an order of magnitude.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 16 of its 36 references that are in the map. First posted on arXiv 14 Dec 2022.
Builds on
16 of 36 references.
References · 16
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Trust Region Policy Optimizationcited by 2,580
- 2016OpenAI Gymcited by 1,736
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
- 2017Constrained Policy Optimizationcited by 983
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
- 2018Is Q-learning Provably Efficient?cited by 487
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 309
- 2018Large-Scale Study of Curiosity-Driven Learningcited by 280
- 2016ViZDoom: A Doom-based AI Research Platform for Visual Reinforcement Learningcited by 179
- 2015Variational Information Maximisation for Intrinsically Motivated Reinforcement Learningcited by 144
4 more
- 2018Model-Based Active Explorationcited by 105
- 2017Surprise-Based Intrinsic Motivation for Deep Reinforcement Learningcited by 83
- 2018Pommerman: A Multi-Agent Playgroundcited by 30
- 2018Resource Constrained Deep Reinforcement Learningcited by 24
Built on by
Citing papers per year: 2023: 2; 2024: 4; 2025: 2; 2026: 2.
10 papers.
- 2023ChiPFormer: Transferable Chip Placement via Offline Decision Transformercited by 42
- 2025Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear Programmingcited by 16
- 2024Learning to Cut via Hierarchical Sequence/Set Model for Efficient Mixed-Integer Programmingcited by 12
- 2024Scalable and Effective Arithmetic Tree Generation for Adder and Multiplier Designscited by 9
- 2024Learning to Stop Cut Generation for Efficient Mixed-Integer Linear Programmingcited by 8
- 2024Uncertainty-based Offline Variational Bayesian Reinforcement Learning for Robustness under Diverse Data Corruptionscited by 8
- 2023State Sequences Prediction via Fourier Transform for Representation Learningcited by 7
- 2025Rectified Robust Policy Optimization for Model-Uncertain Constrained Reinforcement Learning without Strong Dualitycited by 4
- 2026FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depthcited by 0
- 2026Mask 2D-3D: Adaptive Dual-Masked Autoencoder Network for Image-to-Point Cloud Registrationcited by 0
- 2026Mask 2D-3D: Adaptive Dual-Masked Autoencoder Network for Image-to-Point Cloud Registration16 Sep 2026
- 2026FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth8 May 2026
- 2025Rectified Robust Policy Optimization for Model-Uncertain Constrained Reinforcement Learning without Strong Duality24 Aug 2025
- 2025Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear Programming3 Mar 2025
- 2024Uncertainty-based Offline Variational Bayesian Reinforcement Learning for Robustness under Diverse Data Corruptions1 Nov 2024
- 2024Scalable and Effective Arithmetic Tree Generation for Adder and Multiplier Designs10 May 2024
- 2024Learning to Cut via Hierarchical Sequence/Set Model for Efficient Mixed-Integer Programming19 Apr 2024
- 2024Learning to Stop Cut Generation for Efficient Mixed-Integer Linear Programming31 Jan 2024
- 2023State Sequences Prediction via Fourier Transform for Representation Learning24 Oct 2023
- 2023ChiPFormer: Transferable Chip Placement via Offline Decision Transformer26 Jun 2023