{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T06:08:31Z","timestamp":1784095711972,"version":"3.55.0"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2024JC-YBMS-394"],"award-info":[{"award-number":["2024JC-YBMS-394"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100019336","name":"Key Research and Development Plan and Transformation Projects of Qinghai","doi-asserted-by":"publisher","award":["2025-GX-144"],"award-info":[{"award-number":["2025-GX-144"]}],"id":[{"id":"10.13039\/501100019336","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3710692","type":"journal-article","created":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T19:45:28Z","timestamp":1783453528000},"page":"102542-102557","source":"Crossref","is-referenced-by-count":0,"title":["DDL-BIT*: An Improved Batch Informed Trees Algorithm Using Dual-Density Lock for Motion Planning"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5389-8551","authenticated-orcid":false,"given":"Chaoyang","family":"Song","sequence":"first","affiliation":[{"name":"Zhejiang Technical Institute of Economics, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yishuai","family":"Tong","sequence":"additional","affiliation":[{"name":"School of Automation, Hangzhou Dianzi University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0131-9334","authenticated-orcid":false,"given":"Zhen","family":"Li","sequence":"additional","affiliation":[{"name":"School of Automation, Hangzhou Dianzi University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2074-7895","authenticated-orcid":false,"given":"Wenying","family":"Fang","sequence":"additional","affiliation":[{"name":"Zhejiang Technical Institute of Economics, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yajuan","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Materials Science and Engineering, Shaanxi University of Science and Technology, Xi’an, Shaanxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"LaValle","year":"1998"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-061623-094742"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.birob.2024.100207"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2478\/cait-2024-0026"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919890396"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/02783649211069572"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2025.3590084"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/electronics14142888"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-024-09642-x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3561348"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3571453"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11804-024-00433-2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122510"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3537697"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1308756"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-025-92675-5"},{"key":"ref20","first-page":"23","article-title":"Continuous arvand: Motion planning with Monte Carlo random walks","volume-title":"Proc. 3rd ICAPS Workshop Planning Robot. (PlanRob)","author":"Chen"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICIT63637.2025.10965231"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2025.3575307"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2025.3562482"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1996.503582"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.772447"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570709"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106875"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2025.3528675"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3526195"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3622542"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CISAT62382.2024.10695426"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s12555-022-0834-9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2024.3524912"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915614386"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2025.3535185"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2602363"},{"key":"ref37","article-title":"HySST: A stable sparse rapidly-exploring random trees optimal motion planning algorithm for hybrid dynamical systems","author":"Wang","year":"2023","journal-title":"arXiv:2305.18649"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2025.3574520"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/IROS58592.2024.10802528"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2025.3531504"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3311262"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793618"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CASE49997.2022.9926609"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/MRAI65197.2025.11135811"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2025.3544491"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA57147.2024.10611398"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICUAS65942.2025.11007837"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA57147.2024.10611099"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2025.3551464"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2936689"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2008.4650993"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2487881"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11598880.pdf?arnumber=11598880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T05:55:21Z","timestamp":1784094921000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11598880\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3710692","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}