{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:05:59Z","timestamp":1760609159659,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/lra.2019.2920285","type":"journal-article","created":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T19:50:55Z","timestamp":1559332255000},"page":"2815-2822","source":"Crossref","is-referenced-by-count":6,"title":["Learning to Plan Hierarchically From Curriculum"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6035-1724","authenticated-orcid":false,"given":"Philippe","family":"Morere","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6554-0575","authenticated-orcid":false,"given":"Lionel","family":"Ott","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2996-2188","authenticated-orcid":false,"given":"Fabio","family":"Ramos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/377"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00052-1"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/122344.122377"},{"key":"ref30","first-page":"461","article-title":"What can I not do? Towards an architecture for reasoning about and learning affordances","author":"sridharan","year":"0","journal-title":"Proc Int Conf Automated Planning Scheduling"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5328"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992698"},{"article-title":"A survey of reinforcement learning in relational domains","year":"2005","author":"van otterlo","key":"ref35"},{"article-title":"Independently controllable features","year":"2017","author":"thomas","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2017.XIII.039"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77949-0_6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487760"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1986.10478354"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2016.2535907"},{"key":"ref15","article-title":"Distributed assembly with and\/or graphs","author":"knepper","year":"0","journal-title":"Proc Workshop AI Robot Int Conf Intell Robots Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5575"},{"article-title":"Rapidly-exploring random trees: A new tool for path planning","year":"1998","author":"lavalle","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref19","first-page":"361","article-title":"Automatic discovery of subgoals in reinforcement learning using diverse density","author":"mcgovern","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"article-title":"Efficient implementation of the K-SVD algorithm using batch orthogonal matching pursuit","year":"2008","author":"rubinstein","key":"ref28"},{"key":"ref4","first-page":"ii-316","article-title":"PAC-inspired option discovery in lifelong reinforcement learning","author":"brunskill","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"journal-title":"Proc of Encyclopedia of Biometrics","year":"2015","author":"reynolds","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00033-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/70.54734"},{"key":"ref29","first-page":"7156","article-title":"Hierarchical reinforcement learning for zero-shot generalization with subtask dependencies","author":"sohn","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(71)90010-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390187"},{"key":"ref2","first-page":"438","article-title":"Hierarchical reinforcement learning based on subgoal discovery and subpolicy specialization","author":"bakker","year":"0","journal-title":"Proc Int Conf Intell Auton Syst"},{"key":"ref9","first-page":"1515","article-title":"Automatic goal generation for reinforcement learning agents","volume":"80","author":"florensa","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8594313"},{"article-title":"Playing Atari with deep reinforcement learning","year":"2013","author":"mnih","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90035-3"},{"key":"ref21","first-page":"386","article-title":"Bayesian RL for goal-only rewards","volume":"87","author":"morere","year":"0","journal-title":"Proc Conf Robot Learn"},{"key":"ref24","first-page":"968","article-title":"SHOP: Simple hierarchical ordered planner","author":"nau","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref23","first-page":"2022","article-title":"Action categorization for computationally improved task learning and planning","author":"nair","year":"0","journal-title":"Proc Int Conf Auton Agents Multi-Agent Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/11678823_6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143928"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8668830\/08727471.pdf?arnumber=8727471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:13:50Z","timestamp":1657746830000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8727471\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":37,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lra.2019.2920285","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}