{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T17:05:05Z","timestamp":1779383105647,"version":"3.53.1"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"KIST Institutional Program","award":["2E32283"],"award-info":[{"award-number":["2E32283"]}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Korea Government","award":["2021R1A2C3005914"],"award-info":[{"award-number":["2021R1A2C3005914"]}]},{"DOI":"10.13039\/501100003052","name":"Ministry of Trade, Industry and Energy","doi-asserted-by":"publisher","award":["20018745"],"award-info":[{"award-number":["20018745"]}],"id":[{"id":"10.13039\/501100003052","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Industrial Strategic Technology Development Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1109\/lra.2023.3279612","type":"journal-article","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T17:48:30Z","timestamp":1684950510000},"page":"4147-4154","source":"Crossref","is-referenced-by-count":20,"title":["Motion Planning of Mobile Manipulator for Navigation Including Door Traversal"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3095-5161","authenticated-orcid":false,"given":"Keunwoo","family":"Jang","sequence":"first","affiliation":[{"name":"Artificial Intelligence and Robotics Institute, Korea Institute of Science and Technology, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0222-8688","authenticated-orcid":false,"given":"Sanghyun","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, Kyung Hee University, Suwon, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5062-8264","authenticated-orcid":false,"given":"Jaeheung","family":"Park","sequence":"additional","affiliation":[{"name":"Department of Intelligence and Information, ASRI, RICS, Seoul National University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Automated construction of robotic manipulation programs","author":"diankov","year":"2010"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364909340445"},{"key":"ref15","first-page":"767","article-title":"ARA$\\ast$ : Anytime A$\\ast$ With Provable Bounds on Sub-Optimality","author":"likhachev","year":"0","journal-title":"Proc Int Conf Adv Neural Inf Process Syst"},{"key":"ref14","article-title":"Search-based planning library","year":"0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2015.7363472"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.aax8177"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197524"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11370-022-00431-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2014.7041441"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2795645"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref16","first-page":"262","article-title":"Anytime dynamic A*: An anytime, replanning algorithm","author":"likhachev","year":"0","journal-title":"Proc 15th Int Conf Int Conf Automated Plan Scheduling"},{"key":"ref19","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-60916-4_17"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630792"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11370-021-00366-7"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907099"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793866"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2015.2506154"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631117"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509475"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/10128766\/10132587.pdf?arnumber=10132587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T18:51:07Z","timestamp":1687805467000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10132587\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":21,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/lra.2023.3279612","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7]]}}}