{"id":"https://openalex.org/W4416749244","doi":"https://doi.org/10.1109/iros60139.2025.11246148","title":"Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds","display_name":"Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds","publication_year":2025,"publication_date":"2025-10-19","ids":{"openalex":"https://openalex.org/W4416749244","doi":"https://doi.org/10.1109/iros60139.2025.11246148"},"language":null,"primary_location":{"id":"doi:10.1109/iros60139.2025.11246148","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11246148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049476225","display_name":"Yimin Tang","orcid":"https://orcid.org/0009-0001-2558-3877"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yimin Tang","raw_affiliation_strings":["University of Southern California,Thomas Lord Department of Computer Science"],"affiliations":[{"raw_affiliation_string":"University of Southern California,Thomas Lord Department of Computer Science","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077530748","display_name":"Zhenghong Yu","orcid":"https://orcid.org/0000-0001-9887-845X"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhenghong Yu","raw_affiliation_strings":["University of Wisconsin–Madison"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin–Madison","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101499733","display_name":"Jiaoyang Li","orcid":"https://orcid.org/0000-0002-0032-1758"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiaoyang Li","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026549557","display_name":"Sven Koenig","orcid":"https://orcid.org/0000-0002-5458-094X"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sven Koenig","raw_affiliation_strings":["University of California,Irvine"],"affiliations":[{"raw_affiliation_string":"University of California,Irvine","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5049476225"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36975046,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"14111","last_page":"14117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9527999758720398,"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.9527999758720398,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0032999999821186066,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.002899999963119626,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/bounded-function","display_name":"Bounded function","score":0.7190999984741211},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5945000052452087},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.545799970626831},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5393000245094299},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.46799999475479126},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.41350001096725464},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4081000089645386},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.3928999900817871}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7190999984741211},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5945000052452087},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5577999949455261},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.545799970626831},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5393000245094299},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5300999879837036},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.46799999475479126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4578999876976013},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41350001096725464},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3928999900817871},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3603000044822693},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3587999939918518},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.31299999356269836},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.30959999561309814},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.26089999079704285},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros60139.2025.11246148","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11246148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1488757178","https://openalex.org/W1551562380","https://openalex.org/W1989407213","https://openalex.org/W2042872950","https://openalex.org/W2123030512","https://openalex.org/W2124015815","https://openalex.org/W2166462345","https://openalex.org/W2191404279","https://openalex.org/W2403254675","https://openalex.org/W2406007181","https://openalex.org/W2808540770","https://openalex.org/W2903998385","https://openalex.org/W2914296650","https://openalex.org/W2964945728","https://openalex.org/W2964997335","https://openalex.org/W3175724379","https://openalex.org/W3187649900","https://openalex.org/W4283795314","https://openalex.org/W4382202651","https://openalex.org/W4382866962","https://openalex.org/W4391549658","https://openalex.org/W4399261749"],"related_works":[],"abstract_inverted_index":{"Multi-Agent":[0],"Path":[1],"Finding":[2],"(MAPF)":[3],"involves":[4],"finding":[5,76],"collision-free":[6,115],"paths":[7],"for":[8],"multiple":[9],"agents":[10],"while":[11],"minimizing":[12],"a":[13,47,70,84,105,114,158],"cost":[14],"function\u2014an":[15],"NP-hard":[16],"problem.":[17],"Bounded":[18],"suboptimal":[19,87],"methods":[20],"like":[21],"Enhanced":[22],"Conflict-Based":[23],"Search":[24],"(ECBS)":[25],"and":[26,102,128,145,169],"Explicit":[27],"Estimation":[28],"CBS":[29],"(EECBS)":[30],"balance":[31],"solution":[32],"quality":[33],"with":[34,131,165],"computational":[35],"efficiency":[36],"using":[37],"focal":[38,44,148],"search":[39,45,66,72,107,149],"mechanisms.":[40],"While":[41],"effective,":[42],"traditional":[43],"faces":[46],"limitation:":[48],"the":[49,58,98],"lower":[50],"bound":[51],"(LB)":[52],"value":[53,101],"determining":[54,97],"which":[55],"nodes":[56,144],"enter":[57],"FOCAL":[59],"list":[60],"often":[61],"increases":[62],"slowly":[63],"in":[64,69,124],"early":[65],"stages,":[67],"resulting":[68],"constrained":[71],"space":[73],"that":[74,120],"delays":[75],"valid":[77],"solutions.":[78],"In":[79],"this":[80,93,110],"paper,":[81],"we":[82],"propose":[83],"novel":[85],"bounded":[86],"algorithm,":[88],"double-ECBS":[89],"(DECBS),":[90],"to":[91,112],"address":[92],"issue":[94],"by":[95,109],"first":[96],"maximum":[99],"LB":[100,111],"then":[103],"employing":[104],"best-first":[106],"guided":[108],"find":[113],"path.":[116],"Experimental":[117],"results":[118],"demonstrate":[119],"DECBS":[121,135,156],"outperforms":[122],"ECBS":[123,164],"most":[125],"test":[126],"cases":[127],"is":[129,154],"compatible":[130],"existing":[132],"optimization":[133],"techniques.":[134],"can":[136],"reduce":[137],"nearly":[138],"30%":[139],"high-level":[140],"Constraint":[141],"Tree":[142],"(CT)":[143],"50%":[146],"low-level":[147],"nodes.":[150],"When":[151],"agent":[152],"density":[153],"high,":[155],"achieves":[157],"23.5%":[159],"average":[160],"runtime":[161],"improvement":[162],"over":[163],"identical":[166],"suboptimality":[167],"bounds":[168],"optimizations.":[170]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-28T00:00:00"}