{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:51:20Z","timestamp":1773154280774,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/icra.2016.7487554","type":"proceedings-article","created":{"date-parts":[[2016,6,9]],"date-time":"2016-06-09T21:33:24Z","timestamp":1465508004000},"page":"3690-3697","source":"Crossref","is-referenced-by-count":22,"title":["Optimal temporal logic planning in probabilistic semantic maps"],"prefix":"10.1109","author":[{"given":"Jie","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolay","family":"Atanasov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ufuk","family":"Topcu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George J.","family":"Pappas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","first-page":"634","article-title":"A* search with inconsistent heuristics","author":"zhang","year":"2009","journal-title":"International Joint Conference on Artificial Intelligence"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426174"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.178"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509969"},{"key":"ref11","first-page":"5025","article-title":"Revising motion planning under linear temporal logic specifications in partially known workspaces","author":"guo","year":"2013","journal-title":"IEEE International Conference on Robotics and Automation"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914562980"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2012.6315419"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2007.914952"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2030225"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011254632723"},{"key":"ref18","first-page":"1587","article-title":"Optimal policy generation for partially satisfiable co-safe LTL specifications","author":"lacerda","year":"2015","journal-title":"International Joint Conference on Artificial Intelligence"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509686"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2005.1545046"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509503"},{"key":"ref27","first-page":"7","author":"pin","year":"2010","journal-title":"Mathematical foundations of automata theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995462"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980550"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90110-9"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1613\/jair.1696","article-title":"Macro-FF: Improving AI planning with automatically learned macro-operators","volume":"24","author":"botea","year":"2005","journal-title":"Journal of Artificial Intelligence Research"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(71)90010-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298143"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364912455256"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2014.X.039"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2014.X.043"},{"key":"ref20","author":"lavalle","year":"1998","journal-title":"Rapidly-Exploring Random Trees A New Tool for Path Planning"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225208"},{"key":"ref21","first-page":"767","article-title":"ARA*: Anytime A* with Provable Bounds on Sub-Optimality","author":"likhachev","year":"2004","journal-title":"Advances in neural information processing systems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1641882"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631229"},{"key":"ref26","author":"pearl","year":"1984","journal-title":"Heuristics Intelligent Search Strategies for Computer Problem Solving"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2008.08.001"}],"event":{"name":"2016 IEEE International Conference on Robotics and Automation (ICRA)","location":"Stockholm, Sweden","start":{"date-parts":[[2016,5,16]]},"end":{"date-parts":[[2016,5,21]]}},"container-title":["2016 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7478842\/7487087\/07487554.pdf?arnumber=7487554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T13:23:02Z","timestamp":1568035382000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7487554\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/icra.2016.7487554","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}