{"id":"https://openalex.org/W4413925759","doi":"https://doi.org/10.1109/icra55743.2025.11128758","title":"Multi-Agent Path Finding Using Conflict-Based Search and Structural-Semantic Topometric Maps","display_name":"Multi-Agent Path Finding Using Conflict-Based Search and Structural-Semantic Topometric Maps","publication_year":2025,"publication_date":"2025-05-19","ids":{"openalex":"https://openalex.org/W4413925759","doi":"https://doi.org/10.1109/icra55743.2025.11128758"},"language":"en","primary_location":{"id":"doi:10.1109/icra55743.2025.11128758","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra55743.2025.11128758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Robotics and Automation (ICRA)","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/A5091932341","display_name":"Scott Fredriksson","orcid":"https://orcid.org/0009-0004-0889-8780"},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Scott Fredriksson","raw_affiliation_strings":["Electrical and Space Engineering at Lule&#x00E5; University of Technology,Robotics and AI group,Department of Computer Science,Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical and Space Engineering at Lule&#x00E5; University of Technology,Robotics and AI group,Department of Computer Science,Sweden","institution_ids":["https://openalex.org/I190632392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030986064","display_name":"Yifan Bai","orcid":"https://orcid.org/0009-0008-2749-5062"},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Yifan Bai","raw_affiliation_strings":["Electrical and Space Engineering at Lule&#x00E5; University of Technology,Robotics and AI group,Department of Computer Science,Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical and Space Engineering at Lule&#x00E5; University of Technology,Robotics and AI group,Department of Computer Science,Sweden","institution_ids":["https://openalex.org/I190632392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064098651","display_name":"Akshit Saradagi","orcid":"https://orcid.org/0000-0003-3794-0306"},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Akshit Saradagi","raw_affiliation_strings":["Electrical and Space Engineering at Lule&#x00E5; University of Technology,Robotics and AI group,Department of Computer Science,Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical and Space Engineering at Lule&#x00E5; University of Technology,Robotics and AI group,Department of Computer Science,Sweden","institution_ids":["https://openalex.org/I190632392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064878830","display_name":"George Nikolakopoulos","orcid":"https://orcid.org/0000-0003-0126-1897"},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"George Nikolakopoulos","raw_affiliation_strings":["Electrical and Space Engineering at Lule&#x00E5; University of Technology,Robotics and AI group,Department of Computer Science,Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical and Space Engineering at Lule&#x00E5; University of Technology,Robotics and AI group,Department of Computer Science,Sweden","institution_ids":["https://openalex.org/I190632392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091932341"],"corresponding_institution_ids":["https://openalex.org/I190632392"],"apc_list":null,"apc_paid":null,"fwci":5.3994,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.96063769,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"4229","last_page":"4235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991999864578247,"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.9991999864578247,"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/T11106","display_name":"Data Management and Algorithms","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9747999906539917,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.6998467445373535},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.624751091003418},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5473029017448425},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.3818397521972656},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05486851930618286}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6998467445373535},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.624751091003418},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5473029017448425},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.3818397521972656},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05486851930618286}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra55743.2025.11128758","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra55743.2025.11128758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"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/W1967740178","https://openalex.org/W1989407213","https://openalex.org/W2050781898","https://openalex.org/W2123030512","https://openalex.org/W2265661972","https://openalex.org/W2406007181","https://openalex.org/W2886374915","https://openalex.org/W2903998385","https://openalex.org/W2905054495","https://openalex.org/W2964035402","https://openalex.org/W2964997335","https://openalex.org/W2965125400","https://openalex.org/W3136568468","https://openalex.org/W3187649900","https://openalex.org/W3206082228","https://openalex.org/W4381785675","https://openalex.org/W4386523077","https://openalex.org/W4386953304","https://openalex.org/W4388904787","https://openalex.org/W4401415691"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W3204019825"],"abstract_inverted_index":{"As":[0],"industries":[1],"increasingly":[2],"adopt":[3],"large":[4,95],"robotic":[5],"fleets,":[6],"there":[7],"is":[8,27,44,52,175],"a":[9,28,74,104,160,169],"pressing":[10],"need":[11],"for":[12,21,31,47],"computationally":[13,53],"efficient,":[14],"practical,":[15],"and":[16,40,57,63,80,114,124,182,200,216],"optimal":[17],"conflict-free":[18],"path":[19,33],"planning":[20],"multiple":[22],"robots.":[23],"Conflict-Based":[24],"Search":[25],"(CBS)":[26],"popular":[29],"method":[30,192],"multi-agent":[32],"finding":[34],"(MAPF)":[35],"due":[36],"to":[37,55,69,76,148,164,196,208],"its":[38],"completeness":[39],"optimality;":[41],"however,":[42],"it":[43,51],"often":[45],"impractical":[46],"real-world":[48,178,197],"applications,":[49],"as":[50],"intensive":[54],"solve":[56],"relies":[58],"on":[59],"assumptions":[60],"about":[61],"agents":[62],"operating":[64,135],"environments":[65],"that":[66,159,188],"are":[67,144],"difficult":[68],"realize.":[70],"This":[71,117],"article":[72],"proposes":[73],"solution":[75,100],"overcome":[77],"computational":[78,205],"challenges":[79],"practicality":[81],"issues":[82],"of":[83,91,128,220],"CBS":[84,93,102,133,157,210],"by":[85,132],"utilizing":[86],"structural-semantic":[87,109],"topometric":[88,106,151],"maps.":[89],"Instead":[90],"running":[92],"over":[94,103],"grid-based":[96],"maps,":[97],"the":[98,121,126,140,155,189],"proposed":[99,141,190],"runs":[101],"sparse":[105],"map":[107],"containing":[108],"cells":[110],"representing":[111],"intersections,":[112],"pathways,":[113],"dead":[115],"ends.":[116],"approach":[118,174],"significantly":[119],"accelerates":[120],"MAPF":[122,191],"process":[123],"reduces":[125],"number":[127],"conflict":[129,214],"resolutions":[130],"handled":[131],"while":[134,212],"in":[136,168,204,218],"continuous":[137],"time.":[138],"In":[139],"method,":[142],"robots":[143,199],"assigned":[145],"time":[146,171],"ranges":[147],"move":[149,163],"between":[150],"regions,":[152],"departing":[153],"from":[154],"traditional":[156,209],"assumption":[158],"robot":[161],"can":[162,193],"any":[165],"connected":[166],"cell":[167],"single":[170],"step.":[172],"The":[173,185],"validated":[176],"through":[177],"multi-robot":[179],"path-finding":[180],"experiments":[181],"benchmarking":[183],"simulations.":[184],"results":[186],"demonstrate":[187],"be":[194],"applied":[195],"non-holonomic":[198],"yields":[201],"significant":[202],"improvement":[203],"efficiency":[206],"compared":[207],"methods":[211],"improving":[213],"detection":[215],"resolution":[217],"cases":[219],"corridor":[221],"symmetries.":[222]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}
