{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T05:48:54Z","timestamp":1774331334775,"version":"3.50.1"},"reference-count":82,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["CNS-2002405"],"award-info":[{"award-number":["CNS-2002405"]}]},{"name":"NSF","award":["CNS-2013824"],"award-info":[{"award-number":["CNS-2013824"]}]},{"name":"NSF","award":["CNS-2313104"],"award-info":[{"award-number":["CNS-2313104"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tro.2024.3392079","type":"journal-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T17:47:43Z","timestamp":1713808063000},"page":"2749-2768","source":"Crossref","is-referenced-by-count":9,"title":["Neurosymbolic Motion and Task Planning for Linear Temporal Logic Tasks"],"prefix":"10.1109","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9216-0866","authenticated-orcid":false,"given":"Xiaowu","family":"Sun","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of California, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8224-8477","authenticated-orcid":false,"given":"Yasser","family":"Shoukry","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of California, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-2(5:5)2006"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011254632723"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2011.942116"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-060117-104838"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2011.942115"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917739114"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6696359"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509503"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2005.1582935"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377825"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363946"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8263808"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0224-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50763-7"},{"key":"ref15","first-page":"2924","article-title":"On the number of linear regions of deep neural networks","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Montufar","year":"2014"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3057050"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683009"},{"key":"ref18","first-page":"7995","article-title":"Temporal-logic-based reward shaping for continuing learning tasks","volume-title":"Proc. 33rd AAAI Conf. Artif. Intell.","author":"Jiang","year":"2020"},{"key":"ref19","first-page":"2067","article-title":"Trial without error: Towards safe reinforcement learning via human intervention","volume-title":"Proc. 17th Int. Conf. Auton. Agents MultiAgent Syst.","author":"Saunders","year":"2018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-021-06019-1"},{"key":"ref21","first-page":"1","article-title":"Robust regression for safe exploration in control","volume-title":"Proc. Mach. Learn. Res.","author":"Liu","year":"2020"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2021.3050444"},{"key":"ref23","first-page":"22","article-title":"Constrained policy optimization","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Achiam","year":"2017"},{"key":"ref24","first-page":"4312","article-title":"Safe exploration in finite Markov decision processes with Gaussian processes","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Turchetta","year":"2016"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC45102.2020.9294262"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77935-5_9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/2400000035"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311802"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81685-8_13"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3501710.3519533"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06773-0_11"},{"key":"ref32","first-page":"11423","article-title":"Efficient and accurate estimation of Lipschitz constants for deep neural networks","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Fazlyab","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311806"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-97301-2_7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2876389"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2021.XVII.077"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3447928.3456646"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3447928.3456644"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013387"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9303785"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2020.3009082"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460471"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3074895"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.15607\/rss.2021.xvii.026"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619829"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.109597"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9028919"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968254"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11797"},{"key":"ref50","article-title":"Safe model-based reinforcement learning with stability guarantees","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Berkenkamp","year":"2017"},{"key":"ref51","first-page":"8092","article-title":"A Lyapunov-based approach to safe reinforcement learning","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Chow","year":"2018"},{"key":"ref52","article-title":"Lyapunov-based safe policy optimization for continuous control","volume-title":"Proc. RL4RealLife Workshop 36th Int. Conf. Mach. Learn.","author":"Chow","year":"2019"},{"key":"ref53","first-page":"2107","article-title":"Using reward machines for high-level task specification and decomposition in reinforcement learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Icarte","year":"2018"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22337-2_29"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v32i1.19849"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CDC51059.2022.9993010"},{"key":"ref57","first-page":"10026","article-title":"Compositional reinforcement learning from logical specifications","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Jothimurugan","year":"2021"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6750"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/557"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3004555"},{"key":"ref61","first-page":"6172","article-title":"Neurosymbolic reinforcement learning with formally verified exploration","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Anderson","year":"2020"},{"key":"ref62","first-page":"15752","article-title":"Imitation-projected programmatic reinforcement learning","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Verma","year":"2019"},{"key":"ref63","first-page":"2499","article-title":"Verifiable reinforcement learning via policy extraction","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Bastani","year":"2018"},{"key":"ref64","first-page":"5247","article-title":"Extracting automata from recurrent neural networks using queries and counterexamples","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Weiss","year":"2018"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/570"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3206.001.0001"},{"key":"ref67","first-page":"49","article-title":"Guided cost learning: Deep inverse optimal control via policy optimization","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Finn","year":"2016"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33019785"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683375"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53288-8_4"},{"key":"ref71","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44829-2_5"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-34892-6_1"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1137\/120871456"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/3178126.3178143"},{"key":"ref76","article-title":"Keras","author":"Chollet","year":"2015"},{"key":"ref77","volume-title":"Wheeled Mobile Robotics","author":"Klanar","year":"2017"},{"key":"ref78","first-page":"5331","article-title":"Efficient off-policy meta-reinforcement learning via probabilistic context variables","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Rakelly","year":"2019"},{"key":"ref79","article-title":"Auto-encoding variational Bayes","volume-title":"Proc. 31st Int. Conf. Mach. Learn.","author":"Kingma","year":"2014"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298143"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2021.3061983"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6697051"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8860\/10365208\/10506629-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8860\/10365208\/10506629.pdf?arnumber=10506629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T04:59:00Z","timestamp":1715317140000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10506629\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":82,"URL":"https:\/\/doi.org\/10.1109\/tro.2024.3392079","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}