{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:31:35Z","timestamp":1769157095864,"version":"3.49.0"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"publisher","award":["NNX16AB09G"],"award-info":[{"award-number":["NNX16AB09G"]}],"id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1109\/lra.2020.3021382","type":"journal-article","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T20:16:09Z","timestamp":1599077769000},"page":"6884-6891","source":"Crossref","is-referenced-by-count":3,"title":["Path Planning Under Malicious Injections and Removals of Perceived Obstacles: A Probabilistic Programming Approach"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9660-4869","authenticated-orcid":false,"given":"Jacopo","family":"Banfi","sequence":"first","affiliation":[]},{"given":"Yizhou","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6409-9888","authenticated-orcid":false,"given":"G. Edward","family":"Suh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5819-7588","authenticated-orcid":false,"given":"Andrew C.","family":"Myers","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0775-4297","authenticated-orcid":false,"given":"Mark","family":"Campbell","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1641882"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2013.2254033"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2018.2801279"},{"key":"ref13","first-page":"973","article-title":"Pyro: Deep universal probabilistic programming","volume":"20","author":"bingham","year":"2019","journal-title":"J Mach Learn Res"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2541940.2541958"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2630058"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717754"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00378-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1"},{"key":"ref4","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998","journal-title":"Technical Report 98 4 Dept of Computer Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731118"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913501564"},{"key":"ref5","first-page":"32","article-title":"Practical search techniques in path planning for autonomous driving","author":"dolgov","year":"0","journal-title":"Proceedings of the STAIRS"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980508"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2017.XIII.068"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/0471221279"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3264888.3264889"},{"key":"ref9","author":"thrun","year":"2005","journal-title":"Probabilistic Robotics"},{"key":"ref20","author":"owen","year":"2013","journal-title":"Monte Carlo Theory Methods and Examples"},{"key":"ref21","author":"garey","year":"0","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9133350\/09184965.pdf?arnumber=9184965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:33:43Z","timestamp":1651080823000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9184965\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":21,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2020.3021382","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10]]}}}