{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T09:23:40Z","timestamp":1725441820475},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/iros.2011.6095072","type":"proceedings-article","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T21:46:42Z","timestamp":1323208002000},"page":"3868-3873","source":"Crossref","is-referenced-by-count":2,"title":["Choosing landmarks for risky planning"],"prefix":"10.1109","author":[{"given":"Liz","family":"Murphy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Corke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Newman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Anytime dynamic A*: An anytime, replanning algorithm","author":"likhachev","year":"2005","journal-title":"Proc of the International Conference on Automated Planning and Scheduling"},{"key":"ref11","article-title":"Reach for a: Efficient point-to-point shortest path algorithms","author":"goldberg","year":"2005","journal-title":"Microsoft Reasearch Tech Rep MSR-TR-2005–132"},{"key":"ref12","article-title":"LPI: Approximating shortest paths using landmarks","author":"grant","year":"2008","journal-title":"ECAI 2008 - Workshop on AI and Games"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28633-2_13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"journal-title":"Selecting landmarks in shortest path computations Patent Application Publication Microsoft Corporation","year":"2009","author":"goldberg","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/358523.358553"},{"key":"ref19","article-title":"Computing point-to-point shortest paths from external memory","author":"goldberg","year":"2005","journal-title":"Proc Seventh Workshop Algorithm Eng and Experiments (ALENEX)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1982.4767270"},{"key":"ref3","article-title":"Computing the shortest path: A* search meets graph theory","author":"goldberg","year":"2005","journal-title":"Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"ref6","first-page":"476","article-title":"D* Lite","author":"koenig","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref7","article-title":"The field D* algorithm for improved path planning and replanning in uniform and non-uniform cost environments","author":"ferguson","year":"2005","journal-title":"Robotics Institute Pittsburgh PA Tech Rep CMU-RI-TR-05-19"},{"journal-title":"Proc IEEE International Conference on Robotics and Automation","article-title":"Risky planning: Path planning over costmaps with a probabilistically bounded speed-accuracy tradeoff","year":"2011","key":"ref2"},{"key":"ref1","article-title":"Planning paths from overhead imagery","author":"murphy","year":"2010","journal-title":"Proc of the IEEE International Conference on Robotics and Automation"},{"key":"ref9","first-page":"23","article-title":"The bandwidth heuristic search","author":"harris","year":"0"}],"event":{"name":"2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2011)","start":{"date-parts":[[2011,9,25]]},"location":"San Francisco, CA","end":{"date-parts":[[2011,9,30]]}},"container-title":["2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6034548\/6094399\/06095072.pdf?arnumber=6095072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T07:47:46Z","timestamp":1490082466000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6095072\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/iros.2011.6095072","relation":{},"subject":[],"published":{"date-parts":[[2011,9]]}}}