{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T07:25:58Z","timestamp":1766647558440,"version":"3.40.4"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"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 Robot. Autom. Lett."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/lra.2025.3562369","type":"journal-article","created":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T17:38:37Z","timestamp":1744997917000},"page":"5815-5822","source":"Crossref","is-referenced-by-count":7,"title":["Tree-Based Grafting Approach for Bidirectional Motion Planning With Local Subsets Optimization"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0119-706X","authenticated-orcid":false,"given":"Liding","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computation, Information and Technology (CIT), Technical University of Munich, Munich, Germany"}]},{"given":"Yao","family":"Ling","sequence":"additional","affiliation":[{"name":"School of Computation, Information and Technology (CIT), Technical University of Munich, Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0896-2517","authenticated-orcid":false,"given":"Zhenshan","family":"Bing","sequence":"additional","affiliation":[{"name":"School of Computation, Information and Technology (CIT), Technical University of Munich, Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5051-3005","authenticated-orcid":false,"given":"Fan","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computation, Information and Technology (CIT), Technical University of Munich, Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2980-135X","authenticated-orcid":false,"given":"Sami","family":"Haddadin","sequence":"additional","affiliation":[{"name":"School of Computation, Information and Technology (CIT), Technical University of Munich, Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4840-076X","authenticated-orcid":false,"given":"Alois","family":"Knoll","sequence":"additional","affiliation":[{"name":"School of Computation, Information and Technology (CIT), Technical University of Munich, Munich, Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-061920-093753"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.birob.2024.100207"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-061623-094742"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2022.3181947"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"article-title":"Rapidly-exploring random trees: A new tool for path planning","year":"1998","author":"LaValle","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IROS58592.2024.10802280"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830331"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919890396"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/02783649211069572"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197338"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IROS58592.2024.10802466"},{"article-title":"Nearest-neighbourless asymptotically optimal motion planning with fully connected informed trees (FCIT*)","year":"2024","author":"Wilson","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2022.3147408"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48891.2023.10161028"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918802957"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2015.2448276"},{"key":"ref26","article-title":"Planner developer tools (PDT): Reproducible experiments and statistical analysis for developing and testing motion planners","volume-title":"Proc. Workshop Evaluating Motion Plan. Perform., IEEE\/RSJ Int. Conf. Intell. Robots Syst.","author":"Gammell","year":"2022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793898"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7083369\/10969146\/10970041.pdf?arnumber=10970041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T11:19:49Z","timestamp":1746184789000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10970041\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":28,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/lra.2025.3562369","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}