{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:47:13Z","timestamp":1725734833728},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1109\/icra.2011.5980124","type":"proceedings-article","created":{"date-parts":[[2011,8,16]],"date-time":"2011-08-16T15:26:17Z","timestamp":1313508377000},"page":"3727-3732","source":"Crossref","is-referenced-by-count":12,"title":["Risky planning: Path planning over costmaps with a probabilistically bounded speed-accuracy tradeoff"],"prefix":"10.1109","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":"15","article-title":"Selecting landmarks in shortest path computations","author":"goldberg","year":"2009","journal-title":"Patent Application Publication"},{"key":"13","article-title":"Lpi: Approximating shortest paths using landmarks","author":"grant","year":"2008","journal-title":"ECAI 2008 - Workshop on AI and Games"},{"key":"14","article-title":"An hierarchical terrain representation for approximately shortest paths","author":"mould","year":"2004","journal-title":"8th Pacific Rim International Conference on Artificial Intelligence"},{"key":"11","first-page":"23","article-title":"The bandwidth heuristic search","author":"harris","year":"1973","journal-title":"International Joint Conference on Artificial Intelligence"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69507-3_6"},{"key":"3","article-title":"Ara*: Anytime a* search with provable bounds on sub-Optimality","author":"likhachev","year":"2003","journal-title":"Conference on Neural Information Processing Systems (NIPS)"},{"key":"2","article-title":"Computing the shortest path: A* search meets graph theory","author":"goldberg","year":"2005","journal-title":"17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 06)"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509501"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351061"},{"journal-title":"Heuristics Intelligent Search Strategies for Computer Problem Solving","year":"1984","author":"pearl","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1982.4767270"},{"key":"4","article-title":"Anytime dynamic a*: An anytime, replanning algorithm","author":"likhachev","year":"2005","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"9","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"},{"key":"8","first-page":"476","article-title":"D*lite","author":"koenig","year":"2002","journal-title":"Eighteenth national conference on Artificial intelligence"}],"event":{"name":"2011 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2011,5,9]]},"location":"Shanghai, China","end":{"date-parts":[[2011,5,13]]}},"container-title":["2011 IEEE International Conference on Robotics and Automation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5967842\/5979525\/05980124.pdf?arnumber=5980124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T06:48:24Z","timestamp":1490078904000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5980124\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icra.2011.5980124","relation":{},"subject":[],"published":{"date-parts":[[2011,5]]}}}