{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T19:19:38Z","timestamp":1769195978952,"version":"3.49.0"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ONR Awards","award":["N00014-18-1-2375"],"award-info":[{"award-number":["N00014-18-1-2375"]}]},{"name":"ONR Awards","award":["N00014-18-1-2828"],"award-info":[{"award-number":["N00014-18-1-2828"]}]},{"name":"ARL","award":["DCIST CRA W911NF-17-2-0181"],"award-info":[{"award-number":["DCIST CRA W911NF-17-2-0181"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/lra.2021.3099995","type":"journal-article","created":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T21:29:15Z","timestamp":1627334955000},"page":"7651-7658","source":"Crossref","is-referenced-by-count":15,"title":["Information-Theoretic Abstractions for Planning in Agents With Computational Constraints"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2544-6709","authenticated-orcid":false,"given":"Daniel T.","family":"Larsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7745-9405","authenticated-orcid":false,"given":"Dipankar","family":"Maity","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7563-4129","authenticated-orcid":false,"given":"Panagiotis","family":"Tsiotras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717915"},{"key":"ref11","article-title":"Hierarchical motion planning for autonomous aerial and terrestrial vehicles","author":"cowlagi","year":"2011"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2012.2192268"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2171613"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139779"},{"key":"ref15","first-page":"83","article-title":"Reduced complexity multi-scale path-planning on probabilitic maps","author":"hauer","year":"2016","journal-title":"Proc IEEE Conf Robot Automat"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-6670(17)32056-6"},{"key":"ref17","first-page":"601","article-title":"Information theory of decisions and actions","author":"tishby","year":"2010","journal-title":"Perception-Action Cycle"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22887-2_28"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3389\/frobt.2015.00027"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JRA.1986.1087051"},{"key":"ref3","first-page":"49","article-title":"An analysis of time-dependent planning","author":"dean","year":"1988","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref6","first-page":"332","article-title":"Local multiresolution path planning","author":"behnke","year":"2003","journal-title":"Proc Robot Soccer World Cup VII"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-011-9631-z"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2007.7068634"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1109\/TAC.2012.2191836","article-title":"A beamlet-based graph structure for path planning using multiscale information","volume":"57","author":"lu","year":"2012","journal-title":"IEEE Trans Autom Control"},{"key":"ref2","author":"sutton","year":"2016","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2008.4586659"},{"key":"ref1","volume":"2","author":"bertsekas","year":"2012","journal-title":"Dynamic Programming and Optimal Control"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8263809"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60990-0_17"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24647-0_3"},{"key":"ref24","first-page":"368","article-title":"The information bottleneck method","author":"tishby","year":"1999","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref23","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1109\/LRA.2021.3099995","article-title":"Information-theoretic abstractions for planning in agents with computational constraints","author":"larsson","year":"2021"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2020.3003219"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9475905\/09496173.pdf?arnumber=9496173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T15:02:46Z","timestamp":1672930966000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9496173\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":26,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3099995","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}