{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:00:13Z","timestamp":1767772813041,"version":"3.28.0"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/icra40945.2020.9197014","type":"proceedings-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T17:25:46Z","timestamp":1600190746000},"page":"4266-4272","source":"Crossref","is-referenced-by-count":6,"title":["Posterior Sampling for Anytime Motion Planning on Graphs with Expensive-to-Evaluate Edges"],"prefix":"10.1109","author":[{"given":"Brian","family":"Hou","sequence":"first","affiliation":[]},{"given":"Sanjiban","family":"Choudhury","sequence":"additional","affiliation":[]},{"given":"Gilwoo","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Aditya","family":"Mandalika","sequence":"additional","affiliation":[]},{"given":"Siddhartha S.","family":"Srinivasa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793889"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1032192861"},{"key":"ref32","first-page":"1563","article-title":"Near-optimal regret bounds for reinforcement learning","volume":"11","author":"jaksch","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487754"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553441"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50052-9"},{"key":"ref36","article-title":"Efficient Bayes-adaptive reinforcement learning using sample-based search","author":"guez","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0650"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v28i1.13931","article-title":"Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges","author":"mandalika","year":"2018","journal-title":"International Conference on Automated Planning and Scheduling"},{"key":"ref11","article-title":"A 2 level fuzzy PRM for manipulation planning","author":"nielsen","year":"2000","journal-title":"IEEE\/RSJ International Conference on Intelligent Robots and Systems"},{"key":"ref12","article-title":"Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles","author":"mandalika","year":"2019","journal-title":"International Conference on Automated Planning and Scheduling"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2019.XV.050"},{"key":"ref14","article-title":"Near-optimal edge evaluation in explicit generalized binomial graphs","author":"choudhury","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/679"},{"key":"ref16","article-title":"Matrix completion as a post-processing technique for probabilistic roadmaps","author":"esposito","year":"2016","journal-title":"Workshop on the Algorithmic Foundations of Robotics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570590"},{"key":"ref18","article-title":"Faster sample-based motion planning using instance-based learning","author":"pan","year":"2012","journal-title":"Workshop on the Algorithmic Foundations of Robotics"},{"key":"ref19","article-title":"Learning high-dimensional mixture models for fast collision detection in rapidly-exploring random trees","author":"huh","year":"2016","journal-title":"IEEE International Conference on Robotics and Automation"},{"key":"ref28","first-page":"2413","article-title":"Reinforcement learning in finite MDPs: PAC analysis","volume":"10","author":"strehl","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"ref4","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","author":"likhachev","year":"2004","journal-title":"Advances in neural information processing systems"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v27i1.13860","article-title":"Heuristic Search on Graphs with Existence Priors for Expensive-to-Evaluate Edges","author":"narayanan","year":"2017","journal-title":"International Conference on Automated Planning and Scheduling"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v26i1.13788","article-title":"A unifying formalism for shortest path problems with expensive edge evaluations via lazy best-first search over paths with edge selectors","author":"dellin","year":"2016","journal-title":"International Conference on Automated Planning and Scheduling"},{"key":"ref6","first-page":"97","article-title":"Approximation to Bayes risk in repeated play","volume":"3","author":"hannan","year":"1957","journal-title":"Contributions to the Theory of Games"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1561\/2200000049"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref7","article-title":"(More) efficient reinforcement learning via posterior sampling","author":"osband","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139603"},{"key":"ref9","article-title":"Planning single-arm manipulations with n-arm robots","author":"cohen","year":"2015","journal-title":"Eigth Annual Symposium on Combinatorial Search"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487117"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1109\/IROS.2006.282100","article-title":"Anytime RRTs","author":"ferguson","year":"2006","journal-title":"IEEE\/RSJ International Conference on Intelligent Robots and Systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2010.5650614"},{"key":"ref24","article-title":"Batch Informed Trees: Sampling-based optimal planning via heuristically guided search of random geometric graphs","author":"gammell","year":"2015","journal-title":"IEEE International Conference on Robotics and Automation"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1109\/IROS.2014.6942976","article-title":"Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic","author":"gammell","year":"2014","journal-title":"IEEE\/RSJ International Conference on Intelligent Robots and Systems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759551"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v25i1.7819","article-title":"ANA*: Anytime nonparametric A*","author":"van den berg","year":"2011","journal-title":"AAAI Conference on Artificial Intelligence"}],"event":{"name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2020,5,31]]},"location":"Paris, France","end":{"date-parts":[[2020,8,31]]}},"container-title":["2020 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9187508\/9196508\/09197014.pdf?arnumber=9197014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T09:02:33Z","timestamp":1668762153000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9197014\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/icra40945.2020.9197014","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}