{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:19:19Z","timestamp":1765610359495,"version":"3.37.3"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,29]]},"DOI":"10.1109\/icra48891.2023.10160294","type":"proceedings-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T17:20:56Z","timestamp":1688491256000},"page":"3750-3756","source":"Crossref","is-referenced-by-count":6,"title":["A Reachability Tree-Based Algorithm for Robot Task and Motion Planning"],"prefix":"10.1109","author":[{"given":"Kanghyun","family":"Kim","sequence":"first","affiliation":[{"name":"School of Electrical Engineering,Daejeon,Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daehyung","family":"Park","sequence":"additional","affiliation":[{"name":"School of Computing, Korea Advanced Institute of Science and Technology (KAIST),Daejeon,Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min Jun","family":"Kim","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering,Daejeon,Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1177\/0278364918761570"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ICRA.2011.5980391"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1177\/0278364904045471"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/ICRA.2017.7989462"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/IROS.2014.6943079"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ICRA.2014.6906922"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TRO.2021.3071617"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1146\/annurev-control-091420-084139"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/ICRA.2013.6630814"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1177\/0278364908098447"},{"key":"ref19","article-title":"Scaling Multimodal Planning: Using Experience and Informing Discrete Search","author":"kingston","year":"2022","journal-title":"IEEE Trans Robot"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1177\/0278364910386985"},{"key":"ref24","article-title":"Learning to Search in Task and Motion Planning with Streams","author":"khodeir","year":"2021","journal-title":"ArXiv Preprint"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/LRA.2018.2856701"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/ROBOT.2000.844730"},{"year":"2020","author":"alkhazraji","journal-title":"Pyperplan","key":"ref25"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/ICRA40945.2020.9197545"},{"key":"ref22","article-title":"Extended tree search for robot task and motion planning","author":"ren","year":"2021","journal-title":"ArXiv Preprint"},{"year":"1998","author":"mcdermott","journal-title":"PDDL-the Planning Domain Definition Language","key":"ref21"},{"year":"2016","author":"coumans","journal-title":"Pybullet a python module for physics simulation for games robotics and machine learning","key":"ref27"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1177\/0278364909352098"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1609\/icaps.v30i1.6739"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1177\/0278364918802962"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1017\/CBO9780511546877"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/ICRA46639.2022.9812268"},{"key":"ref6","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998","journal-title":"A Research Report"},{"year":"2004","author":"ghallab","journal-title":"Automated Planning Theory and Practice","key":"ref5"}],"event":{"name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2023,5,29]]},"location":"London, United Kingdom","end":{"date-parts":[[2023,6,2]]}},"container-title":["2023 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10160211\/10160212\/10160294.pdf?arnumber=10160294","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T17:33:59Z","timestamp":1690220039000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10160294\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,29]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/icra48891.2023.10160294","relation":{},"subject":[],"published":{"date-parts":[[2023,5,29]]}}}