{"id":"https://openalex.org/W7167081551","doi":"https://doi.org/10.48550/arxiv.2607.00156","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","display_name":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","publication_year":2026,"publication_date":"2026-06-30","ids":{"openalex":"https://openalex.org/W7167081551","doi":"https://doi.org/10.48550/arxiv.2607.00156"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.00156","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00156","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.00156","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114352348","display_name":"Willem van Osselaer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van Osselaer, Willem","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139924837","display_name":"Jiarui Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Jiarui","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030500450","display_name":"Meshal Alharbi","orcid":"https://orcid.org/0000-0002-6025-7858"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alharbi, Meshal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139928448","display_name":"Gioele Zardini","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zardini, Gioele","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.4219000041484833,"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.4219000041484833,"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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.13369999825954437,"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.07540000230073929,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8167999982833862},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.7282999753952026},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.703000009059906},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7020999789237976},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6377000212669373},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5853999853134155},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5407999753952026},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.47269999980926514}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8167999982833862},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.7282999753952026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7095000147819519},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.703000009059906},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7020999789237976},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6377000212669373},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5853999853134155},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5407999753952026},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.47269999980926514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45820000767707825},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.40209999680519104},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3587999939918518},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.35089999437332153},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.3391999900341034},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.33469998836517334},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.3287000060081482},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.3133000135421753},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3109000027179718},{"id":"https://openalex.org/C2778775528","wikidata":"https://www.wikidata.org/wiki/Q5135432","display_name":"Closing (real estate)","level":2,"score":0.30660000443458557},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C41661131","wikidata":"https://www.wikidata.org/wiki/Q220764","display_name":"Interrupt","level":3,"score":0.26499998569488525},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.2639999985694885}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.00156","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00156","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.00156","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00156","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Conflict-Based":[0],"Search":[1],"(CBS)":[2],"is":[3,18,29,80,157,162,167],"a":[4,22,44,64,77,87,119],"leading":[5],"exact":[6,69],"algorithm":[7],"for":[8,31,68],"Multi-Agent":[9],"Path":[10],"Finding":[11],"(MAPF),":[12],"but":[13],"its":[14],"high-level":[15],"node-selection":[16],"rule":[17],"usually":[19],"treated":[20],"as":[21,63],"fixed":[23],"implementation":[24],"detail.":[25],"Standard":[26],"best-first":[27,201],"selection":[28,62,117],"strong":[30],"minimizing":[32],"expanded":[33,139],"nodes":[34],"and":[35,51,84,105,133,145,165,203,208],"closing":[36],"the":[37,94,124,135],"optimality":[38],"certificate,":[39],"yet":[40],"it":[41],"can":[42,127],"maintain":[43],"large":[45],"frontier,":[46,97],"interrupt":[47],"parent-child":[48,103],"expansion":[49],"sequences,":[50],"provide":[52],"no":[53],"feasible":[54],"incumbent":[55,107],"until":[56],"termination.":[57],"This":[58],"paper":[59],"studies":[60],"node":[61,116,158],"first-class":[65],"design":[66],"choice":[67],"CBS.":[70],"We":[71,113],"introduce":[72],"Dual-Informed":[73],"Vertical":[74],"Expansion":[75],"(DIVE),":[76],"policy":[78,126],"that":[79,123],"best-bound":[81,96,173],"between":[82],"dives":[83],"depth-oriented":[85],"within":[86],"dive.":[88],"DIVE":[89,166,184],"starts":[90,207],"each":[91],"dive":[92,141,168,187],"from":[93,205],"current":[95],"follows":[98],"promising":[99],"children":[100],"to":[101,109],"exploit":[102],"locality,":[104],"uses":[106,195],"pruning":[108],"limit":[110],"unproductive":[111],"excursions.":[112],"formalize":[114],"CBS":[115],"through":[118],"branch-and-bound":[120],"view,":[121],"prove":[122],"traversal":[125],"be":[128],"changed":[129],"without":[130],"affecting":[131],"exactness,":[132],"analyze":[134],"resulting":[136],"trade-offs":[137],"among":[138],"nodes,":[140],"breaks,":[142,188],"queue":[143,198],"size,":[144],"primal-dual":[146],"bound":[147],"progress.":[148],"The":[149],"analysis":[150],"predicts":[151],"three":[152],"complementary":[153],"extremes.":[154],"Best-first":[155],"search":[156],"efficient,":[159,164],"iterative":[160],"deepening":[161],"memory":[163,199],"efficient":[169],"while":[170],"retaining":[171],"regular":[172],"reanchoring.":[174],"Experiments":[175],"on":[176],"standard":[177],"MAPF":[178],"benchmarks":[179],"support":[180],"this":[181],"trade-off":[182],"map.":[183],"consistently":[185],"reduces":[186],"provides":[189],"early":[190],"incumbents":[191],"with":[192],"certified":[193],"gaps,":[194],"substantially":[196],"less":[197],"than":[200],"search,":[202],"benefits":[204],"warm":[206],"simple":[209],"responsive":[210],"variants":[211],"in":[212],"dense":[213],"or":[214],"memory-limited":[215],"regimes.":[216]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}