{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:47:20Z","timestamp":1769921240642,"version":"3.49.0"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3055455","type":"journal-article","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T21:10:51Z","timestamp":1611868251000},"page":"21721-21734","source":"Crossref","is-referenced-by-count":9,"title":["Combining a Monte Carlo Tree Search and a Feasibility Database to Plan and Execute Rearranging Tasks"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7413-0463","authenticated-orcid":false,"given":"Pedro Miguel Uriguen","family":"Eljuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6518-577X","authenticated-orcid":false,"given":"Gustavo Alfonso Garcia","family":"Ricardez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nishanth","family":"Koganti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7457-2878","authenticated-orcid":false,"given":"Jun","family":"Takamatsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9767-6039","authenticated-orcid":false,"given":"Tsukasa","family":"Ogasawara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904045471"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SSRR.2009.5424160"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917739114"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2018.2815081"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793736"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2980984"},{"key":"ref17","first-page":"9433","article-title":"Multi-object rearrangement with Monte Carlo tree search: A case study on planar nonprehensile sorting","author":"song","year":"2020","journal-title":"Proc IEEE Int Conf Intell Robots Syst (IROS)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793616"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.23504"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005708001094"},{"key":"ref3","first-page":"72","article-title":"Efficient selectivity and backup operators in Monte Carlo tree search","author":"coulom","year":"2006","journal-title":"Proc Int Conf Comput Games"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6906894"},{"key":"ref5","first-page":"895","article-title":"A robot task planner that merges symbolic and geometric reasoning","author":"cambon","year":"2004","journal-title":"Proc 16th Eur Conf Artif Intell"},{"key":"ref8","first-page":"1470","article-title":"Hierarchical planning in the now","author":"kaelbling","year":"2010","journal-title":"Proc 24th AAAI Conf Artif Intell Workshops"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.045"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1302400"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/HRI.2013.6483517"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2016.XII.002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2016.2620723"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/01691864.2019.1698460"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SII.2017.8279367"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09337898.pdf?arnumber=9337898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:29Z","timestamp":1639770989000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9337898\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3055455","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}