{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:22:07Z","timestamp":1730204527145,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"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":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/cdc40024.2019.9030087","type":"proceedings-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T04:43:11Z","timestamp":1584074591000},"page":"5306-5311","source":"Crossref","is-referenced-by-count":3,"title":["Transfer Planning for Temporal Logic Tasks"],"prefix":"10.1109","author":[{"given":"Xusheng","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael M.","family":"Zavlanos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.191"},{"key":"ref11","first-page":"249","article-title":"Umcp: A sound and complete procedure for hierarchical task-network planning","volume":"94","author":"erol","year":"1994","journal-title":"AIPS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00071-5"},{"key":"ref13","first-page":"2112","article-title":"Using reward machines for high-level task specification and decomposition in reinforcement learning","author":"icarte","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618922"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6697051"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421315"},{"key":"ref6","article-title":"Sampling-based optimal control synthesis for multi-robot systems under global temporal tasks","author":"kantaros","year":"2018","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3055004.3055027"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8263808"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907641"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2163434"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911417911"},{"journal-title":"Principles of Model Checking","year":"2008","author":"baier","key":"ref9"}],"event":{"name":"2019 IEEE 58th Conference on Decision and Control (CDC)","start":{"date-parts":[[2019,12,11]]},"location":"Nice, France","end":{"date-parts":[[2019,12,13]]}},"container-title":["2019 IEEE 58th Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8977134\/9028853\/09030087.pdf?arnumber=9030087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:17:48Z","timestamp":1658261868000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9030087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cdc40024.2019.9030087","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}