{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T01:25:06Z","timestamp":1781918706582,"version":"3.54.5"},"reference-count":26,"publisher":"SAGE Publications","issue":"13-14","license":[{"start":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T00:00:00Z","timestamp":1559865600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.sagepub.com\/licence-information-for-chorus"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-14-1-0486"],"award-info":[{"award-number":["N00014-14-1-0486"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF1410433"],"award-info":[{"award-number":["W911NF1410433"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1420316"],"award-info":[{"award-number":["1420316"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1523767"],"award-info":[{"award-number":["1523767"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1723381"],"award-info":[{"award-number":["1723381"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-1656518"],"award-info":[{"award-number":["DGE-1656518"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550- 17-1-0165"],"award-info":[{"award-number":["FA9550- 17-1-0165"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011225","name":"Thomas and Stacey Siebel Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011225","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[2018,12]]},"abstract":"<jats:p>As drones and autonomous cars become more widespread, it is becoming increasingly important that robots can operate safely under realistic conditions. The noisy information fed into real systems means that robots must use estimates of the environment to plan navigation. Efficiently guaranteeing that the resulting motion plans are safe under these circumstances has proved difficult. We examine how to guarantee that a trajectory or policy has at most [Formula: see text] collision probability ([Formula: see text]-safe) with only imperfect observations of the environment. We examine the implications of various mathematical formalisms of safety and arrive at a mathematical notion of safety of a long-term execution, even when conditioned on observational information. We explore the idea of shadows that generalize the notion of a confidence set to estimated shapes and present a theorem that allows us to understand the relationship between shadows and their classical statistical equivalents such as confidence and credible sets. We present efficient algorithms that use shadows to prove that trajectories or policies are safe with much tighter bounds than in previous work. Notably, the complexity of the environment does not affect our method\u2019s ability to evaluate whether a trajectory or policy is safe. We then use these safety-checking methods to design a safe variant of the rapidly exploring random tree (RRT) planning algorithm.<\/jats:p>","DOI":"10.1177\/0278364918778338","type":"journal-article","created":{"date-parts":[[2018,6,8]],"date-time":"2018-06-08T01:18:12Z","timestamp":1528420692000},"page":"1760-1774","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":43,"title":["Provably safe robot navigation with obstacle uncertainty"],"prefix":"10.1177","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8991-8915","authenticated-orcid":false,"given":"Brian","family":"Axelrod","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leslie Pack","family":"Kaelbling","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom\u00e1s","family":"Lozano-P\u00e9rez","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2018,6,7]]},"reference":[{"key":"bibr1-0278364918778338","first-page":"128","author":"Bishop CM","year":"2006","journal-title":"Machine Learning"},{"key":"bibr2-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"bibr3-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980508"},{"key":"bibr4-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631226"},{"key":"bibr5-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509278"},{"key":"bibr6-0278364918778338","volume-title":"Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence","author":"Erez T","year":"2010"},{"key":"bibr7-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487762"},{"key":"bibr8-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.81"},{"key":"bibr9-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.59"},{"key":"bibr10-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7354079"},{"key":"bibr11-0278364918778338","unstructured":"Handlin M (2013) Conic sections beyond \u211d\n                      2\n                      . Available at: https:\/\/www.whitman.edu\/Documents\/Academics\/Mathematics\/Handlin.pdf. (accessed: 16 February 2017)."},{"key":"bibr12-0278364918778338","volume-title":"International Symposium on Robotics Research","author":"Janson L","year":"2015"},{"key":"bibr13-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00023-X"},{"key":"bibr14-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913484072"},{"key":"bibr15-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"bibr16-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"bibr17-0278364918778338","unstructured":"Lavalle SM (1998) Rapidly-exploring random trees: A new tool for path planning. Technical Report 98-11, Computer Science Department, Iowa State University."},{"key":"bibr18-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6697176"},{"key":"bibr19-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2012.6315544"},{"key":"bibr20-0278364918778338","author":"Park C","year":"2016","journal-title":"CoRR"},{"key":"bibr21-0278364918778338","author":"Park JS","year":"2016","journal-title":"CoRR"},{"key":"bibr22-0278364918778338","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2010.VI.037"},{"key":"bibr23-0278364918778338","volume-title":"Gaussian Processes for Machine Learning","author":"Rasmussen CE","year":"2006"},{"key":"bibr24-0278364918778338","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2016.XII.017"},{"key":"bibr25-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28872-7_39"},{"key":"bibr26-0278364918778338","doi-asserted-by":"publisher","DOI":"10.1137\/100783352"}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364918778338","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0278364918778338","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364918778338","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364918778338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:15:44Z","timestamp":1777457744000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0278364918778338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,7]]},"references-count":26,"journal-issue":{"issue":"13-14","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["10.1177\/0278364918778338"],"URL":"https:\/\/doi.org\/10.1177\/0278364918778338","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,7]]}}}