Dynamic Decision Frequency with Continuous Options
Abstract
In classic reinforcement learning algorithms, agents make decisions at discrete and fixed time intervals. The duration between decisions becomes a crucial hyperparameter, as setting it too short may increase the problem's difficulty by requiring the agent to make numerous decisions to achieve its goal while setting it too long can result in the agent losing control over the system. However, physical systems do not necessarily require a constant control frequency, and for learning agents, it is often preferable to operate with a low frequency when possible and a high frequency when necessary. We propose a framework called Continuous-Time Continuous-Options (CTCO), where the agent chooses options as sub-policies of variable durations. These options are time-continuous and can interact with the system at any desired frequency providing a smooth change of actions. We demonstrate the effectiveness of CTCO by comparing its performance to classical RL and temporal-abstraction RL methods on simulated continuous control tasks with various action-cycle times. We show that our algorithm's performance is not affected by the choice of environment interaction frequency. Furthermore, we demonstrate the efficacy of CTCO in facilitating exploration in a real-world visual reaching task for a 7 DOF robotic arm with sparse rewards.
Cite
@article{arxiv.2212.04407,
title = {Dynamic Decision Frequency with Continuous Options},
author = {Amirmohammad Karimi and Jun Jin and Jun Luo and A. Rupam Mahmood and Martin Jagersand and Samuele Tosatto},
journal= {arXiv preprint arXiv:2212.04407},
year = {2023}
}
Comments
Appears in the Proceedings of the 2023 International Conference on Intelligent Robots and Systems (IROS). Source code at https://github.com/amir-karimi96/continuous-time-continuous-option-policy-gradient.git