Hierarchical Reinforcement Learning: A Comprehensive Survey


연구 분야: Artificial Intelligence



학회: ACM Computing Surveys (CSUR), Volume 54, Issue 5


초록

Hierarchical Reinforcement Learning (HRL) enables autonomous decomposition of challenging long-horizon decision-making tasks into simpler subtasks. During the past years, the landscape of HRL research has grown profoundly, resulting in copious approaches. A comprehensive overview of this vast landscape is necessary to study HRL in an organized manner. We provide a survey of the diverse HRL approaches concerning the challenges of learning hierarchical policies, subtask discovery, transfer learning, and multi-agent learning using HRL. The survey is presented according to a novel taxonomy of the approaches. Based on the survey, a set of important open problems is proposed to motivate the future research in HRL. Furthermore, we outline a few suitable task domains for evaluating the HRL approaches and a few interesting examples of the practical applications of HRL in the Supplementary Material.


Author Profile
Shubham Pateria

Nanyang Technological University Nanyang Avenue Singapore

Singapore
Author Profile
Budhitama Subagdja

Singapore Management University Singapore

Singapore
Author Profile
Ahhwee Tan

Singapore Management University Singapore

Singapore

📄 논문 정보

발행 연도 2021년
인용수 294
출판 국가 Singapore
사이트 ACM
좋아요 수 0

연관 논문 목록 (373건)