{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:07:20Z","timestamp":1768421240303,"version":"3.49.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/tro.2012.2227216","type":"journal-article","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T19:05:03Z","timestamp":1354215903000},"page":"445-457","source":"Crossref","is-referenced-by-count":26,"title":["Risky Planning on Probabilistic Costmaps for Path Planning in Outdoor Environments"],"prefix":"10.1109","volume":"29","author":[{"given":"Liz","family":"Murphy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Newman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095072"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980124"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2006.18.8.1790"},{"key":"ref32","author":"karumanchi","year":"2010","journal-title":"Off-road Mobility Analysis from Proprioceptive Feedback"},{"key":"ref31","article-title":"Intelligent maps for autonomous kilometer-scale site survey","author":"thompson","year":"2008","journal-title":"Proc Int Symp Artif Intell Robot Autom Space"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152754"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2096"},{"key":"ref36","first-page":"23","article-title":"The bandwidth heuristic search","author":"harris","year":"1973","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(70)90007-X"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008916000526"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"ref12","first-page":"476","article-title":"D<formula formulatype=\"inline\"><tex Notation=\"TeX\">$^*$<\/tex><\/formula> lite","author":"koenig","year":"2002","journal-title":"Proc 18th Nat Conf Artif Intell"},{"key":"ref13","year":"0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref15","article-title":"Computing the shortest path: A<formula formulatype=\"inline\"><tex Notation=\"TeX\">$^*$<\/tex><\/formula> search meets graph theory","author":"goldberg","year":"2005","journal-title":"presented at the 16th Annu ACM-SIAM Symp Discrete Algorithm"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69507-3_6"},{"key":"ref17","article-title":"LPI: Approximating shortest paths using landmarks","author":"grant","year":"2008","journal-title":"presented at the Workshop AI Games"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28633-2_13"},{"key":"ref19","article-title":"ARA <formula formulatype=\"inline\"><tex Notation=\"TeX\">$^*$<\/tex><\/formula>: Anytime A<formula formulatype=\"inline\"><tex Notation=\"TeX\">$^*$<\/tex> <\/formula> search with provable bounds on sub-optimality","author":"likhachev","year":"2003","journal-title":"presented at the Conf Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2008.4651026"},{"key":"ref4","first-page":"542","article-title":"Point-based POMDP algorithms: Improved analysis and implementation","author":"smith","year":"2005","journal-title":"Proc Conf Uncert Artif Intell"},{"key":"ref27","author":"rasmussen","year":"2006","journal-title":"Gaussian Processes for Machine Learning"},{"key":"ref3","first-page":"1025","article-title":"Point-based value iteration: An anytime algorithm for POMDPs","author":"pineau","year":"2003","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2007.4399557"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2008.IV.009"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509363"},{"key":"ref8","first-page":"2840","article-title":"PAO <formula formulatype=\"inline\"><tex Notation=\"TeX\">$^*$<\/tex><\/formula> for planning with hidden state","author":"ferguson","year":"2004","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref7","article-title":"Mobile robot planning in dynamic environments and on growable costmaps","author":"philippsen","year":"2008","journal-title":"presented at the IEEE Int Conf Robot Autom Workshop Path Plann Costmaps"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00023-X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.10.014"},{"key":"ref1","author":"sondik","year":"1971","journal-title":"The optimal control of partially observable Markov processes"},{"key":"ref20","first-page":"262","article-title":"Anytime dynamic A<formula formulatype=\"inline\"><tex Notation=\"TeX\">$^*$<\/tex><\/formula>: An anytime, replanning algorithm","author":"likhachev","year":"2005","journal-title":"Proc Int Conf Autom Plann Sched"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/358523.358553"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1642057"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282100"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.462"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1982.4767270"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3830"},{"key":"ref44","author":"kaufman","year":"1990","journal-title":"Finding Groups in Data An Introduction to Cluster Analysis"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509501"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1108\/01443579110139778"},{"key":"ref25","author":"pearl","year":"1984","journal-title":"Heuristics Intelligent Search Strategies for Computer Problem Solving"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8860\/6491466\/06365349.pdf?arnumber=6365349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:38:09Z","timestamp":1642005489000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6365349\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":45,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tro.2012.2227216","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]}}}