{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T13:23:22Z","timestamp":1769952202744,"version":"3.49.0"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Science Foundation Graduate Research Fellowship Program"},{"DOI":"10.13039\/100014037","name":"National Defense Science and Engineering Graduate","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100014037","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation National Robotics Initiative","award":["1734-400"],"award-info":[{"award-number":["1734-400"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/lra.2019.2929997","type":"journal-article","created":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T23:14:08Z","timestamp":1563837248000},"page":"3782-3789","source":"Crossref","is-referenced-by-count":37,"title":["Information-Guided Robotic Maximum Seek-and-Sample in Partially Observable Continuous Environments"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4037-0519","authenticated-orcid":false,"given":"Genevieve","family":"Flaspohler","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5249-2866","authenticated-orcid":false,"given":"Victoria","family":"Preston","sequence":"additional","affiliation":[]},{"given":"Anna P. M.","family":"Michel","sequence":"additional","affiliation":[]},{"given":"Yogesh","family":"Girdhar","sequence":"additional","affiliation":[]},{"given":"Nicholas","family":"Roy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2066984"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509934"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1039\/b902763g"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CRV.2016.63"},{"key":"ref34","first-page":"8779","article-title":"Continuous state-action-observation POMDPs for trajectory planning with Bayesian optimization","author":"morere","year":"0","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28872-7_35"},{"key":"ref11","first-page":"2164","article-title":"Monte-Carlo planning in large POMDPs","author":"silver","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963408"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2009.5354013"},{"key":"ref14","first-page":"553","article-title":"Sequential Bayesian optimisation for spatial-temporal monitoring","author":"marchant","year":"0","journal-title":"Proc 13th Conf Uncertainty Artif Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2010.VI.037"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_32"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40988-2_13"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1014237"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989758"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-019-09836-5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-1273-0_32"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915596378"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.01.004"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177730491"},{"key":"ref5","first-page":"1843","article-title":"Nonmyopic adaptive informative path planning for multiple robots","author":"singh","year":"0","journal-title":"Proc 21st Int Joint Conf Artif Intell"},{"key":"ref8","first-page":"1860","article-title":"Gaussian process planning with Lipschitz continuous reward functions: Towards unifying Bayesian optimization, active learning, and beyond","author":"ling","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref7","first-page":"235","article-title":"Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies","volume":"9","author":"krause","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6224902"},{"key":"ref9","first-page":"1772","article-title":"DESPOT: Online POMDP planning with regularization","author":"somani","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"3250","DOI":"10.1109\/TIT.2011.2182033","article-title":"Information-theoretic regret bounds for Gaussian process optimization in the bandit setting","volume":"58","author":"krause","year":"2012","journal-title":"IEEE Trans Inf Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21722"},{"key":"ref22","first-page":"3627","article-title":"Max-value entropy search for efficient Bayesian optimization","volume":"70","author":"wang","year":"0","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40988-2_15"},{"key":"ref24","author":"rasmussen","year":"2004","journal-title":"Gaussian Processes for Machine Learning"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00023-X"},{"key":"ref26","first-page":"918","article-title":"Predictive entropy search for efficient global optimization of black-box functions","author":"hern\u00e1ndez-lobato","year":"0","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref25","first-page":"1177","article-title":"Random features for large-scale kernel machines","author":"rahimi","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7083369\/8764082\/8767964-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8764082\/08767964.pdf?arnumber=8767964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:09Z","timestamp":1657746549000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8767964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":34,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2019.2929997","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}