{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:15:12Z","timestamp":1766067312196,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ARL DCIST","award":["W911NF-17-2-0181 P00007"],"award-info":[{"award-number":["W911NF-17-2-0181 P00007"]}]},{"name":"NSF","award":["CNS-1823245"],"award-info":[{"award-number":["CNS-1823245"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1109\/lra.2021.3068935","type":"journal-article","created":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T19:58:14Z","timestamp":1616702294000},"page":"4813-4819","source":"Crossref","is-referenced-by-count":8,"title":["Optimizing Non-Markovian Information Gain Under Physics-Based Communication Constraints"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5877-2028","authenticated-orcid":false,"given":"Matthew A.","family":"Schack","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John G.","family":"Rogers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5856-383X","authenticated-orcid":false,"given":"Qi","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0907-2241","authenticated-orcid":false,"given":"Neil","family":"Dantam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2017.2705119"},{"key":"ref38","first-page":"1238","article-title":"Propagation data and prediction methods for the planning of indoor radio communication systems and radio local area networks in the frequency range 300 MHz to 100 GHz","author":"series","year":"2015","journal-title":"Recommendation ITU-R"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/VTCFall.2018.8690611"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2012.012712.101835"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MRS.2017.8250932"},{"key":"ref30","first-page":"846","article-title":"Communication for teams of networked robots","volume":"30","author":"fink","year":"2011"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6737026"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509574"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2008.4753442"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509677"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2002.803459"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO.2010.5723314"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.281996"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2006.1656533"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.11.012"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6161067"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2011.2157884"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref18","first-page":"767","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","author":"likhachev","year":"2004","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref19","article-title":"Anytime truncated D*: Anytime replanning with truncation","author":"aine","year":"0","journal-title":"Proc Symp Combinatorial Search"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8594422"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2897368"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980179"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1013690"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.21236\/AD1008850"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1177\/0278364909358274"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2851613.2851706"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2019.XV.062"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2969191"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139863"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21439"},{"key":"ref20","first-page":"846","article-title":"Rapidly-exploring random trees: A new tool for path planning","volume":"30","author":"lavalle","year":"1998"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152817"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"article-title":"A software package for sequential quadratic programming","year":"1988","author":"kraft","key":"ref42"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914528132"},{"article-title":"The NLopt nonlinear-optimization package","year":"0","author":"johnson","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980280"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225337"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6160740"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/192115.192124"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7083369\/9399748\/9387108-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9399748\/09387108.pdf?arnumber=9387108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:00Z","timestamp":1652194440000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9387108\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":44,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3068935","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}