{"id":"https://openalex.org/W7167606403","doi":"https://doi.org/10.1109/access.2026.3710692","title":"DDL-BIT*: An Improved Batch Informed Trees Algorithm Using Dual-Density Lock for Motion Planning","display_name":"DDL-BIT*: An Improved Batch Informed Trees Algorithm Using Dual-Density Lock for Motion Planning","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7167606403","doi":"https://doi.org/10.1109/access.2026.3710692"},"language":"en","primary_location":{"id":"doi:10.1109/access.2026.3710692","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3710692","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3710692","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028976561","display_name":"Chaoyang Song","orcid":"https://orcid.org/0000-0002-0166-8112"},"institutions":[{"id":"https://openalex.org/I4210104472","display_name":"Zhejiang Technical Institute of Economics","ror":"https://ror.org/01e4rvb54","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210104472"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chaoyang Song","raw_affiliation_strings":["Zhejiang Technical Institute of Economics, Hangzhou, Zhejiang, China"],"raw_orcid":"https://orcid.org/0009-0008-5389-8551","affiliations":[{"raw_affiliation_string":"Zhejiang Technical Institute of Economics, Hangzhou, Zhejiang, China","institution_ids":["https://openalex.org/I4210104472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140211284","display_name":"Yishuai Tong","orcid":null},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yishuai Tong","raw_affiliation_strings":["School of Automation, Hangzhou Dianzi University, Hangzhou, Zhejiang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Automation, Hangzhou Dianzi University, Hangzhou, Zhejiang, China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040009280","display_name":"Zhen Li","orcid":"https://orcid.org/0000-0002-0131-9334"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhen Li","raw_affiliation_strings":["School of Automation, Hangzhou Dianzi University, Hangzhou, Zhejiang, China"],"raw_orcid":"https://orcid.org/0000-0002-0131-9334","affiliations":[{"raw_affiliation_string":"School of Automation, Hangzhou Dianzi University, Hangzhou, Zhejiang, China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030431653","display_name":"Wenying Fang","orcid":"https://orcid.org/0000-0002-2074-7895"},"institutions":[{"id":"https://openalex.org/I4210104472","display_name":"Zhejiang Technical Institute of Economics","ror":"https://ror.org/01e4rvb54","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210104472"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenying Fang","raw_affiliation_strings":["Zhejiang Technical Institute of Economics, Hangzhou, Zhejiang, China"],"raw_orcid":"https://orcid.org/0000-0002-2074-7895","affiliations":[{"raw_affiliation_string":"Zhejiang Technical Institute of Economics, Hangzhou, Zhejiang, China","institution_ids":["https://openalex.org/I4210104472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008824186","display_name":"Yu Zhao","orcid":"https://orcid.org/0000-0003-1874-908X"},"institutions":[{"id":"https://openalex.org/I51622183","display_name":"Shaanxi University of Science and Technology","ror":"https://ror.org/034t3zs45","country_code":"CN","type":"education","lineage":["https://openalex.org/I51622183"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yajuan Zhao","raw_affiliation_strings":["School of Materials Science and Engineering, Shaanxi University of Science and Technology, Xi&#x2019;an, Shaanxi, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Materials Science and Engineering, Shaanxi University of Science and Technology, Xi&#x2019;an, Shaanxi, China","institution_ids":["https://openalex.org/I51622183"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.87349956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"102542","last_page":"102557"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.30489999055862427,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.30489999055862427,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.10599999874830246,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.06790000200271606,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lock","display_name":"Lock (firearm)","score":0.5934000015258789},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5302000045776367},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4293999969959259},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4133000075817108},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.34950000047683716},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.31220000982284546},{"id":"https://openalex.org/keywords/operation-planning","display_name":"Operation planning","score":0.26489999890327454}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7527999877929688},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.5934000015258789},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5302000045776367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.484499990940094},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.45649999380111694},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4293999969959259},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.42879998683929443},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4133000075817108},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.34950000047683716},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2653000056743622},{"id":"https://openalex.org/C3017985614","wikidata":"https://www.wikidata.org/wiki/Q149377","display_name":"Operation planning","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C2777909354","wikidata":"https://www.wikidata.org/wiki/Q1386523","display_name":"Production planning","level":3,"score":0.26350000500679016},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C145565327","wikidata":"https://www.wikidata.org/wiki/Q852514","display_name":"Motion control","level":3,"score":0.25529998540878296},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2540000081062317},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.25290000438690186},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2026.3710692","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3710692","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:4c3b7430c46f4a1a88518428681a075c","is_oa":false,"landing_page_url":"https://doaj.org/article/4c3b7430c46f4a1a88518428681a075c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 14, Pp 102542-102557 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3710692","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3710692","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5863819940","display_name":null,"funder_award_id":"2024JC-YBMS-349","funder_id":"https://openalex.org/F4320324173","funder_display_name":"Natural Science Foundation of Shaanxi Province"},{"id":"https://openalex.org/G6560264890","display_name":null,"funder_award_id":"2024JC-YBMS-394","funder_id":"https://openalex.org/F4320324173","funder_display_name":"Natural Science Foundation of Shaanxi Province"},{"id":"https://openalex.org/G8449982780","display_name":null,"funder_award_id":"2025-GX-144","funder_id":"https://openalex.org/F4320330355","funder_display_name":"Key Research and Development Plan of Tianjin"}],"funders":[{"id":"https://openalex.org/F4320324173","display_name":"Natural Science Foundation of Shaanxi Province","ror":null},{"id":"https://openalex.org/F4320330355","display_name":"Key Research and Development Plan of Tianjin","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Recently,":[0],"sampling-based":[1],"algorithms":[2],"have":[3],"demonstrated":[4],"significant":[5],"advantages":[6],"in":[7,38,74,244],"complex":[8,220],"motion":[9],"planning":[10],"tasks.":[11],"The":[12,123],"Batch":[13,87],"Informed":[14,88,213],"Trees":[15,89],"(BIT*)":[16],"algorithm":[17],"is":[18,150],"a":[19,49,112,119,226],"powerful":[20],"heuristic":[21],"planner":[22,102],"that":[23,52,136,209],"provides":[24],"asymptotic":[25],"optimality.":[26],"However,":[27],"standard":[28,217,241],"BIT*":[29],"often":[30],"suffers":[31],"from":[32,48],"inefficient":[33],"search":[34,173],"and":[35,71,107,118,216,230,269],"stagnant":[36],"convergence":[37],"environments":[39],"with":[40,132],"intricate":[41],"boundary":[42,167],"constraints.":[43],"This":[44],"inefficiency":[45],"fundamentally":[46],"stems":[47],"sampling":[50,196],"mechanism":[51],"lacks":[53],"topological":[54,141,182],"awareness.":[55],"By":[56,92,169],"failing":[57],"to":[58,97,156,184,197,240,262],"exploit":[59],"local":[60,99],"obstacle":[61],"geometry,":[62],"it":[63],"generates":[64],"excessive":[65],"invalid":[66],"samples":[67],"within":[68],"obstructed":[69],"regions":[70],"redundant":[72,195],"nodes":[73],"unconstrained":[75],"free":[76],"space.":[77],"To":[78],"address":[79],"these":[80],"limitations,":[81],"we":[82],"propose":[83],"the":[84,94,98,153,172,175,190,199,232,251,255,263],"Dual-Density":[85,191],"Lock":[86,192],"(DDL-BIT*)":[90],"algorithm.":[91],"adapting":[93],"sample":[95],"distribution":[96],"environment,":[100],"this":[101],"achieves":[103,225],"faster":[104],"initial":[105,186,233],"pathfinding":[106],"accelerated":[108],"convergence.":[109],"DDL-BIT*":[110,210,224],"employs":[111],"framework":[113],"guided":[114],"by":[115,236,259],"active":[116],"perception":[117],"dual-channel":[120],"feedback":[121],"mechanism.":[122],"proposed":[124,252],"DDL":[125],"paradigm":[126],"replaces":[127],"traditional":[128],"blind":[129],"volumetric":[130],"exploration":[131],"an":[133,145],"adaptive":[134],"strategy":[135],"concentrates":[137],"computational":[138],"resources":[139],"on":[140],"bottlenecks.":[142],"In":[143,219],"addition,":[144],"online":[146],"spatial":[147],"deduplication":[148],"filter":[149],"integrated":[151],"into":[152],"hashing":[154],"grid":[155],"guarantee":[157],"expected":[158],"<inline-formula>":[159,246],"<tex-math":[160,247],"notation=\"LaTeX\">$\\mathcal":[161],"{O}(1)$":[162],"</tex-math></inline-formula>":[163,249],"query":[164],"efficiency":[165,268],"for":[166],"updating.":[168],"distinctly":[170],"partitioning":[171],"process,":[174],"Active":[176],"Boundary":[177],"Perception":[178],"(ABP)":[179],"module":[180],"leverages":[181],"priors":[183],"expedite":[185],"path":[187],"discovery,":[188],"whereas":[189],"(DDL)":[193],"restricts":[194],"optimize":[198],"final":[200],"trajectory.":[201],"Experimental":[202],"evaluations":[203],"across":[204],"diverse":[205],"challenging":[206],"benchmarks":[207],"demonstrate":[208],"outperforms":[211],"RRT*,":[212,214],"SOF-RRT*,":[215],"BIT*.":[218,242],"narrow":[221],"passage":[222],"scenarios,":[223],"100%":[227],"success":[228],"rate":[229],"reduces":[231],"path-finding":[234],"time":[235],"over":[237],"46%":[238],"compared":[239],"Moreover,":[243],"high-dimensional":[245],"notation=\"LaTeX\">$SE(3)$":[248],"environments,":[250],"method":[253],"decreases":[254],"average":[256],"tree":[257],"size":[258],"56.6%":[260],"relative":[261],"baseline,":[264],"significantly":[265],"improving":[266],"memory":[267],"structural":[270],"compactness.":[271]},"counts_by_year":[],"updated_date":"2026-07-17T09:13:05.818461","created_date":"2026-07-08T00:00:00"}