{"id":"https://openalex.org/W4405785123","doi":"https://doi.org/10.1109/iros58592.2024.10801914","title":"Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding","display_name":"Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding","publication_year":2024,"publication_date":"2024-10-14","ids":{"openalex":"https://openalex.org/W4405785123","doi":"https://doi.org/10.1109/iros58592.2024.10801914"},"language":"en","primary_location":{"id":"doi:10.1109/iros58592.2024.10801914","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10801914","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 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/A5032464591","display_name":"Huijie Tang","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Huijie Tang","raw_affiliation_strings":["KAIST,Department of Industrial and Systems Engineering,South Korea"],"affiliations":[{"raw_affiliation_string":"KAIST,Department of Industrial and Systems Engineering,South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024477653","display_name":"Federico Berto","orcid":"https://orcid.org/0000-0001-7602-2749"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Federico Berto","raw_affiliation_strings":["KAIST,Department of Industrial and Systems Engineering,South Korea"],"affiliations":[{"raw_affiliation_string":"KAIST,Department of Industrial and Systems Engineering,South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023509025","display_name":"Jinkyoo Park","orcid":"https://orcid.org/0000-0003-2620-1479"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jinkyoo Park","raw_affiliation_strings":["KAIST,Department of Industrial and Systems Engineering,South Korea"],"affiliations":[{"raw_affiliation_string":"KAIST,Department of Industrial and Systems Engineering,South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032464591"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":1.579,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.85270671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"8047","last_page":"8054"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9818000197410583,"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.9818000197410583,"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/T13999","display_name":"Digital Rights Management and Security","score":0.9524000287055969,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9240000247955322,"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/pathfinding","display_name":"Pathfinding","score":0.9180392622947693},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7215335965156555},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11271011829376221},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.054562151432037354}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.9180392622947693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7215335965156555},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11271011829376221},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.054562151432037354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros58592.2024.10801914","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10801914","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1488757178","https://openalex.org/W1989407213","https://openalex.org/W2039107569","https://openalex.org/W2191404279","https://openalex.org/W2296073425","https://openalex.org/W2627004156","https://openalex.org/W2746553466","https://openalex.org/W2892258706","https://openalex.org/W2903998385","https://openalex.org/W2914296650","https://openalex.org/W2914864020","https://openalex.org/W2962821458","https://openalex.org/W2964997335","https://openalex.org/W2965125400","https://openalex.org/W3023923733","https://openalex.org/W3037164939","https://openalex.org/W3038024331","https://openalex.org/W3092786062","https://openalex.org/W3129584569","https://openalex.org/W3175724379","https://openalex.org/W3201099806","https://openalex.org/W3206082228","https://openalex.org/W4221155367","https://openalex.org/W4241811150","https://openalex.org/W4242811155","https://openalex.org/W4296425622","https://openalex.org/W4317384037","https://openalex.org/W4383112356","https://openalex.org/W4385245566","https://openalex.org/W4389689571","https://openalex.org/W4391654576","https://openalex.org/W4393160633","https://openalex.org/W6632662516","https://openalex.org/W6677067356","https://openalex.org/W6685444567","https://openalex.org/W6732454287","https://openalex.org/W6768810269","https://openalex.org/W6857420925","https://openalex.org/W6861836018","https://openalex.org/W7009693805"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4285687848","https://openalex.org/W4289994039","https://openalex.org/W2240526870","https://openalex.org/W3100156731","https://openalex.org/W2623016776","https://openalex.org/W1967962134","https://openalex.org/W3128311703"],"abstract_inverted_index":{"Multi-Agent":[0,5],"Reinforcement":[1],"Learning":[2],"(MARL)":[3],"based":[4],"Path":[6],"Finding":[7],"(MAPF)":[8],"has":[9],"recently":[10],"gained":[11],"attention":[12],"due":[13],"to":[14,23,26,79],"its":[15],"efficiency":[16],"and":[17,46,90,169],"scalability.":[18],"Several":[19],"MARL-MAPF":[20,60],"methods":[21,132,176],"choose":[22],"use":[24],"communication":[25,77],"enrich":[27],"the":[28,55,58,92,110,116,154],"information":[29,82],"one":[30],"agent":[31,85],"can":[32,151],"perceive.":[33],"However,":[34],"existing":[35],"works":[36],"still":[37],"struggle":[38],"in":[39,165],"structured":[40],"environments":[41,89,168],"with":[42,94,119],"high":[43,48],"obstacle":[44],"density":[45],"a":[47,64,75,95,146],"number":[49],"of":[50,57,136,157],"agents.":[51],"To":[52],"further":[53,99],"improve":[54],"performance":[56,108,172],"communication-based":[59],"solvers,":[61],"we":[62,114,128,144],"propose":[63,74,129],"new":[65],"method,":[66],"Ensembling":[67],"Prioritized":[68],"Hybrid":[69],"Policies":[70],"(EPH).":[71],"We":[72,98,161,179],"first":[73],"selective":[76],"block":[78],"gather":[80],"richer":[81],"for":[83,123,133,177],"better":[84],"coordination":[86],"within":[87],"multi-agent":[88,167],"train":[91],"model":[93],"Q-learning-based":[96],"algorithm.":[97],"introduce":[100,145],"three":[101],"advanced":[102],"inference":[103],"strategies":[104],"aimed":[105],"at":[106,183],"bolstering":[107],"during":[109],"execution":[111],"phase.":[112],"First,":[113],"hybridize":[115],"neural":[117,175],"policy":[118],"single-agent":[120],"expert":[121],"guidance":[122],"navigating":[124],"conflict-free":[125],"zones.":[126],"Secondly,":[127],"Q":[130],"value-based":[131],"prioritized":[134],"resolution":[135],"conflicts":[137],"as":[138,140],"well":[139],"deadlock":[141],"situations.":[142],"Finally,":[143],"robust":[147],"ensemble":[148],"method":[149],"that":[150],"efficiently":[152],"collect":[153],"best":[155],"out":[156],"multiple":[158],"possible":[159],"solutions.":[160],"empirically":[162],"evaluate":[163],"EPH":[164],"complex":[166],"demonstrate":[170],"competitive":[171],"against":[173],"state-of-the-art":[174],"MAPF.":[178],"open-source":[180],"our":[181],"code":[182],"https://github.com/ai4co/eph-mapf.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":6}],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}