{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:15:35Z","timestamp":1776888935443,"version":"3.51.2"},"reference-count":25,"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.9196604","type":"proceedings-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T17:25:46Z","timestamp":1600190746000},"page":"5011-5017","source":"Crossref","is-referenced-by-count":10,"title":["Planning, Learning and Reasoning Framework for Robot Truck Unloading"],"prefix":"10.1109","author":[{"given":"Fahad","family":"Islam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirudh","family":"Vemula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Kyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Dornbush","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Salzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Likhachev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2078"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2567"},{"key":"ref12","first-page":"2164","article-title":"Monte-Carlo planning in large POMDPs","author":"silver","year":"2010","journal-title":"NeurIPS"},{"key":"ref13","first-page":"734","article-title":"POMHDP: Search-based belief space planning using multiple heuristics","author":"kim","year":"2019","journal-title":"ICAPS"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6696520"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref16","first-page":"767","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","author":"likhachev","year":"2004","journal-title":"NeurIPS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509685"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225337"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2009-32104"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913484072"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6906922"},{"key":"ref6","first-page":"3338","article-title":"Deep learning for real-time Atari game play using offline Monte-Carlo Tree Search planning","author":"guo","year":"2014","journal-title":"NeurIPS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989327"},{"key":"ref8","first-page":"99","article-title":"Planning and acting in partially observable stochastic domains","volume":"101","author":"kaelbling","year":"1998","journal-title":"AI"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1038\/nature16961","article-title":"Mastering the game of Go with deep neural networks and tree search","volume":"529","author":"silver","year":"2016","journal-title":"Nature"},{"key":"ref2","article-title":"Robots edge closer to unloading trucks in amazon-era milestone","author":"black","year":"0","journal-title":"Bloomberg"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/10187.001.0001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1162\/rest_a_00754"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref21","first-page":"627","article-title":"A reduction of imitation learning and structured prediction to no-regret online learning","author":"ross","year":"2011","journal-title":"AISTATS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225228"},{"key":"ref23","first-page":"716","article-title":"Provable infinite-horizon real-time planning for repetitive tasks","author":"islam","year":"2019","journal-title":"ICAPS"},{"key":"ref25","first-page":"107","article-title":"Path planning in dynamic environments with adaptive dimensionality","author":"vemula","year":"2016","journal-title":"SOCS"}],"event":{"name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","location":"Paris, France","start":{"date-parts":[[2020,5,31]]},"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\/09196604.pdf?arnumber=9196604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T20:16:31Z","timestamp":1656360991000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9196604\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icra40945.2020.9196604","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}