{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:51:52Z","timestamp":1778496712691,"version":"3.51.4"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-0953503"],"award-info":[{"award-number":["IIS-0953503"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1100579"],"award-info":[{"award-number":["CMMI-1100579"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1302393"],"award-info":[{"award-number":["IIS-1302393"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1526862"],"award-info":[{"award-number":["IIS-1526862"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1527436"],"award-info":[{"award-number":["IIS-1527436"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/tase.2017.2701648","type":"journal-article","created":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T18:09:50Z","timestamp":1496081390000},"page":"1666-1681","source":"Crossref","is-referenced-by-count":25,"title":["Concise Planning and Filtering: Hardness and Algorithms"],"prefix":"10.1109","volume":"14","author":[{"given":"Jason M.","family":"O'Kane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9310-7231","authenticated-orcid":false,"given":"Dylan A.","family":"Shell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2174494"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2007.898962"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00312-7_20"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/027836499501400506"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01891840"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1990.126172"},{"key":"ref13","first-page":"211","article-title":"Solving POMDPs by searching in policy space","author":"hansen","year":"1998","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00106-0"},{"key":"ref15","author":"hopcroft","year":"2006","journal-title":"Introduction to Automata Theory Languages and Computation"},{"key":"ref16","author":"hopcroft","year":"2006","journal-title":"Introduction to Automata Theory Languages and Computation"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0222067"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00075-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6386165"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1997.625782"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225286"},{"key":"ref3","first-page":"1343","article-title":"An algorithm better than AO*?","author":"bonet","year":"2005","journal-title":"Proc Nat Conf Artif Intell (AAAI)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9076-0_10"},{"key":"ref29","first-page":"421","article-title":"Sensor-based manipulation planning as a game with nature","author":"taylor","year":"1988","journal-title":"Proc Int Symp Robot Res"},{"key":"ref5","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/070\/590"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364909354133"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.30"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/56.800"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276759"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref22","first-page":"123","article-title":"Optimal gap navigation for a disc robot","author":"lopez-padilla","year":"2012","journal-title":"Proc Workshop Algorithmic Found Robot"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1561\/2300000004"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631153"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5979836"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.1496","article-title":"Finding approximate POMDP solutions through belief compression","volume":"23","author":"roy","year":"2005","journal-title":"J Artif Intell Res"},{"key":"ref25","first-page":"4803","article-title":"Finding concise plans: Hardness and algorithms","author":"o\u2019kane","year":"2014","journal-title":"Proc Int Conf Intell Robots"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/8856\/8057874\/7935348-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/8057874\/07935348.pdf?arnumber=7935348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:51:22Z","timestamp":1649443882000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7935348\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":33,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tase.2017.2701648","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}