{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:15:40Z","timestamp":1725477340005},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/icinfa.2013.6720470","type":"proceedings-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T17:34:30Z","timestamp":1391189670000},"page":"1159-1164","source":"Crossref","is-referenced-by-count":0,"title":["A new path planning algorithm with uncertainty information of robot's initial position"],"prefix":"10.1109","author":[{"given":"Pengfei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwei","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiqing","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yen-Lun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19457-3_10"},{"key":"14","article-title":"Solving large pomdps using real time dynamic programming [c]","author":"geffner","year":"1998","journal-title":"Proc AAAI Fall Symp on POMDPs"},{"journal-title":"The Optimal Control of Partially Observable Markov Processes [ R]","year":"1971","author":"sondik","key":"11"},{"key":"12","first-page":"65","article-title":"Sarsop: Efficient point-based POMDP planning by approximating optimally reachable belief spaces [ C]","author":"kurniawati","year":"2008","journal-title":"Robotics Science and Systems"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3437-9"},{"journal-title":"Search Techniques for Planning in Large Dynamic Deterministic and Stochastic Environments","year":"2003","author":"likhachev","key":"7"},{"key":"6","article-title":"Ara*: Anytime a* with provable bounds on sub-optimality","author":"likhachev","year":"2003","journal-title":"Advances in neural information processing systems"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/70.370502"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00735431"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198509721.001.0001"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.2307\/1402616"}],"event":{"name":"2013 IEEE International Conference on Information and Automation (ICIA)","start":{"date-parts":[[2013,8,26]]},"location":"Yinchuan, China","end":{"date-parts":[[2013,8,28]]}},"container-title":["2013 IEEE International Conference on Information and Automation (ICIA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6709836\/6720259\/06720470.pdf?arnumber=6720470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:49:14Z","timestamp":1490230154000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6720470\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icinfa.2013.6720470","relation":{},"subject":[],"published":{"date-parts":[[2013,8]]}}}