{"id":"https://openalex.org/W4401416536","doi":"https://doi.org/10.1109/icra57147.2024.10610843","title":"Conflict Area Prediction for Boosting Search-Based Multi-Agent Pathfinding Algorithms","display_name":"Conflict Area Prediction for Boosting Search-Based Multi-Agent Pathfinding Algorithms","publication_year":2024,"publication_date":"2024-05-13","ids":{"openalex":"https://openalex.org/W4401416536","doi":"https://doi.org/10.1109/icra57147.2024.10610843"},"language":"en","primary_location":{"id":"doi:10.1109/icra57147.2024.10610843","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra57147.2024.10610843","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 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/A5080440421","display_name":"Jaesung Ryu","orcid":null},"institutions":[{"id":"https://openalex.org/I67900169","display_name":"Chung-Ang University","ror":"https://ror.org/01r024a98","country_code":"KR","type":"education","lineage":["https://openalex.org/I67900169"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Jaesung Ryu","raw_affiliation_strings":["Chung-Ang University,Department of Artificial Intelligence,Seoul,Republic of Korea,06974"],"affiliations":[{"raw_affiliation_string":"Chung-Ang University,Department of Artificial Intelligence,Seoul,Republic of Korea,06974","institution_ids":["https://openalex.org/I67900169"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107935989","display_name":"Youngjoon Kwon","orcid":null},"institutions":[{"id":"https://openalex.org/I67900169","display_name":"Chung-Ang University","ror":"https://ror.org/01r024a98","country_code":"KR","type":"education","lineage":["https://openalex.org/I67900169"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Youngjoon Kwon","raw_affiliation_strings":["Chung-Ang University,Department of Artificial Intelligence,Seoul,Republic of Korea,06974"],"affiliations":[{"raw_affiliation_string":"Chung-Ang University,Department of Artificial Intelligence,Seoul,Republic of Korea,06974","institution_ids":["https://openalex.org/I67900169"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101434962","display_name":"Sang\u2010Ho Yoon","orcid":"https://orcid.org/0000-0001-5557-6582"},"institutions":[{"id":"https://openalex.org/I67900169","display_name":"Chung-Ang University","ror":"https://ror.org/01r024a98","country_code":"KR","type":"education","lineage":["https://openalex.org/I67900169"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sangho Yoon","raw_affiliation_strings":["Chung-Ang University,Department of Artificial Intelligence,Seoul,Republic of Korea,06974"],"affiliations":[{"raw_affiliation_string":"Chung-Ang University,Department of Artificial Intelligence,Seoul,Republic of Korea,06974","institution_ids":["https://openalex.org/I67900169"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100604922","display_name":"Kyungjae Lee","orcid":"https://orcid.org/0000-0003-0147-2715"},"institutions":[{"id":"https://openalex.org/I67900169","display_name":"Chung-Ang University","ror":"https://ror.org/01r024a98","country_code":"KR","type":"education","lineage":["https://openalex.org/I67900169"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kyungjae Lee","raw_affiliation_strings":["Chung-Ang University,Department of Artificial Intelligence,Seoul,Republic of Korea,06974"],"affiliations":[{"raw_affiliation_string":"Chung-Ang University,Department of Artificial Intelligence,Seoul,Republic of Korea,06974","institution_ids":["https://openalex.org/I67900169"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5080440421"],"corresponding_institution_ids":["https://openalex.org/I67900169"],"apc_list":null,"apc_paid":null,"fwci":0.5248,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64779874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"14548","last_page":"14554"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9932000041007996,"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.9932000041007996,"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/T10142","display_name":"Formal Methods in Verification","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.8188697695732117},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.7953290939331055},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7090613842010498},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5089077949523926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3985651135444641},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3528868556022644},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19167613983154297},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.05474919080734253}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.8188697695732117},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.7953290939331055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7090613842010498},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5089077949523926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3985651135444641},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3528868556022644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19167613983154297},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.05474919080734253},{"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/icra57147.2024.10610843","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra57147.2024.10610843","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Robotics and Automation (ICRA)","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":24,"referenced_works":["https://openalex.org/W126122642","https://openalex.org/W592773644","https://openalex.org/W1549280300","https://openalex.org/W1551562380","https://openalex.org/W1969483458","https://openalex.org/W1973396716","https://openalex.org/W1989407213","https://openalex.org/W2056549180","https://openalex.org/W2070224057","https://openalex.org/W2124015815","https://openalex.org/W2137514195","https://openalex.org/W2191404279","https://openalex.org/W2406007181","https://openalex.org/W2892258706","https://openalex.org/W2914296650","https://openalex.org/W2948511273","https://openalex.org/W2964997335","https://openalex.org/W3088197938","https://openalex.org/W3103635569","https://openalex.org/W3206082228","https://openalex.org/W4383112356","https://openalex.org/W6629161821","https://openalex.org/W6632662516","https://openalex.org/W6763368627"],"related_works":["https://openalex.org/W2355768292","https://openalex.org/W2961085424","https://openalex.org/W4306674287","https://openalex.org/W3082059448","https://openalex.org/W4313640622","https://openalex.org/W3046775127","https://openalex.org/W3107602296","https://openalex.org/W4394896187","https://openalex.org/W3170094116","https://openalex.org/W4386462264"],"abstract_inverted_index":{"We":[0,17],"address":[1],"the":[2,32,86],"challenge":[3],"of":[4,88],"efficiently":[5],"controlling":[6],"multi-agent":[7],"systems,":[8],"crucial":[9],"in":[10,91],"fields":[11],"like":[12],"logistics":[13],"and":[14],"traffic":[15],"management.":[16],"propose":[18],"a":[19,63],"novel":[20],"approach":[21],"that":[22],"combines":[23],"learning-based":[24,55],"techniques":[25],"with":[26],"search-based":[27],"methods,":[28],"focusing":[29],"on":[30],"enhancing":[31],"conflict-based":[33],"search":[34],"(CBS).":[35],"The":[36],"CBS":[37],"ensures":[38],"optimality":[39],"but":[40],"suffers":[41],"from":[42],"increasing":[43],"complexity":[44],"as":[45],"agents":[46],"or":[47],"maps":[48],"grow.":[49],"To":[50],"tackle":[51],"this,":[52],"we":[53,69],"leverage":[54],"approaches":[56],"to":[57,79,96],"enhance":[58],"computational":[59,93],"efficiency.":[60],"By":[61],"training":[62],"conflict":[64,72],"area":[65],"prediction":[66],"(CAP)":[67],"network,":[68],"anticipate":[70],"potential":[71],"areas,":[73],"allowing":[74],"for":[75],"low-level":[76],"path":[77],"planners":[78],"explore":[80],"conflict-free":[81],"paths.":[82],"Our":[83],"experiments":[84],"demonstrate":[85],"effectiveness":[87],"our":[89],"method":[90],"reducing":[92],"demands":[94],"compared":[95],"existing":[97],"approaches.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}