{"id":"https://openalex.org/W2896987114","doi":"https://doi.org/10.1109/cig.2018.8490436","title":"Multi-Agent Pathfinding with Real-Time Heuristic Search","display_name":"Multi-Agent Pathfinding with Real-Time Heuristic Search","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2896987114","doi":"https://doi.org/10.1109/cig.2018.8490436","mag":"2896987114"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2018.8490436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2018.8490436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Computational Intelligence and Games (CIG)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/Multi-Agent_Pathfinding_with_Real-Time_Heuristic_Search/24492667","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072346198","display_name":"Devon Sigurdson","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Devon Sigurdson","raw_affiliation_strings":["Computing Science, University of Alberta, Edmonton, Canada"],"affiliations":[{"raw_affiliation_string":"Computing Science, University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076298832","display_name":"Vadim Bulitko","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Vadim Bulitko","raw_affiliation_strings":["Computing Science, University of Alberta, Edmonton, Canada"],"affiliations":[{"raw_affiliation_string":"Computing Science, University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030505534","display_name":"William Yeoh","orcid":"https://orcid.org/0000-0002-2617-870X"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William Yeoh","raw_affiliation_strings":["Computer Science and Engineering, Washington University in St. Louis, St. Louis, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Washington University in St. Louis, St. Louis, USA","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007629410","display_name":"Carlos Hern\u00e1ndez","orcid":"https://orcid.org/0000-0001-7947-3684"},"institutions":[{"id":"https://openalex.org/I13897259","display_name":"Universidad Andr\u00e9s Bello","ror":"https://ror.org/01qq57711","country_code":"CL","type":"education","lineage":["https://openalex.org/I13897259"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Carlos Hernandez","raw_affiliation_strings":["Ciencia de la Ingenieria, Universidad Andres Bello, Santiago, Chile"],"affiliations":[{"raw_affiliation_string":"Ciencia de la Ingenieria, Universidad Andres Bello, Santiago, Chile","institution_ids":["https://openalex.org/I13897259"]}]},{"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/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":false,"raw_author_name":"Sven Koenig","raw_affiliation_strings":["Computer Science, University of Southern California, Los Angeles, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science, University of Southern California, Los Angeles, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5072346198"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":1.1689,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.84188728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9994999766349792,"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/T12290","display_name":"Human Motion and Animation","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/pathfinding","display_name":"Pathfinding","score":0.957594633102417},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7741129398345947},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7178418636322021},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.6482974290847778},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6057655215263367},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.5065819025039673},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.49642497301101685},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37109124660491943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25882184505462646},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.25501304864883423},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.2152128517627716},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2088402807712555},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.07053747773170471},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06436130404472351}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.957594633102417},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7741129398345947},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7178418636322021},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.6482974290847778},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6057655215263367},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.5065819025039673},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.49642497301101685},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37109124660491943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25882184505462646},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25501304864883423},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.2152128517627716},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2088402807712555},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.07053747773170471},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06436130404472351},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cig.2018.8490436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2018.8490436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Computational Intelligence and Games (CIG)","raw_type":"proceedings-article"},{"id":"pmh:oai:figshare.com:article/24492667","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Multi-Agent_Pathfinding_with_Real-Time_Heuristic_Search/24492667","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/24492667","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Multi-Agent_Pathfinding_with_Real-Time_Heuristic_Search/24492667","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309480","display_name":"Nvidia","ror":"https://ror.org/03jdj4y14"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W128516946","https://openalex.org/W1490473644","https://openalex.org/W1516910121","https://openalex.org/W1969483458","https://openalex.org/W2021061679","https://openalex.org/W2040070614","https://openalex.org/W2086251647","https://openalex.org/W2122128939","https://openalex.org/W2129463847","https://openalex.org/W2135125135","https://openalex.org/W2137651302","https://openalex.org/W2141208494","https://openalex.org/W2526667006","https://openalex.org/W2573542018","https://openalex.org/W2574186214","https://openalex.org/W2576466201","https://openalex.org/W2730689032","https://openalex.org/W2740793701","https://openalex.org/W2757125855","https://openalex.org/W2762021923","https://openalex.org/W2914296650","https://openalex.org/W2942668478","https://openalex.org/W3122952953","https://openalex.org/W6680701603","https://openalex.org/W6731901667","https://openalex.org/W6732200730","https://openalex.org/W6732555561","https://openalex.org/W6740368919","https://openalex.org/W6744197619","https://openalex.org/W6758754608"],"related_works":["https://openalex.org/W2400861930","https://openalex.org/W3111117784","https://openalex.org/W2405282859","https://openalex.org/W2101174032","https://openalex.org/W126812865","https://openalex.org/W4383897618","https://openalex.org/W2349967715","https://openalex.org/W1038152302","https://openalex.org/W2896987114","https://openalex.org/W2930900158"],"abstract_inverted_index":{"Multi-agent":[0],"pathfinding,":[1,131],"namely":[2],"finding":[3,90],"collision-free":[4],"paths":[5,57,92,177],"for":[6,28,43,58,86,93,115,129],"several":[7],"agents":[8,60,65,88,99,160,195,199],"from":[9],"their":[10,15,70,176,202],"given":[11,16],"start":[12],"locations":[13,18,155],"to":[14,81,100,154,196],"goal":[17,203],"on":[19,119],"a":[20,124],"known":[21],"stationary":[22],"map,":[23],"is":[24],"an":[25,144],"important":[26],"task":[27],"non-player":[29],"characters":[30],"in":[31,102,171],"video":[32],"games.":[33],"A":[34],"variety":[35],"of":[36],"heuristic":[37,106,126,147,151,179],"search":[38,107,127,148],"algorithms":[39,77,108],"have":[40,78,109],"been":[41,113],"developed":[42,114],"this":[44],"task.":[45],"Non-real-time":[46],"algorithms,":[47],"such":[48],"as":[49,139,161],"Flow":[50],"Annotated":[51],"Replanning":[52],"(FAR),":[53],"first":[54],"find":[55],"complete":[56,91],"all":[59,87],"and":[61,95,156,193,215],"then":[62],"move":[63,101],"the":[64,79,83,98,120,158],"along":[66],"these":[67],"paths.":[68],"However,":[69],"searches":[71],"are":[72],"often":[73],"too":[74],"expensive.":[75],"Real-time":[76,105],"ability":[80],"produce":[82],"next":[84],"moves":[85],"without":[89],"them":[94],"thus":[96],"allow":[97],"real":[103],"time.":[104],"so":[110],"far":[111],"typically":[112],"single-agent":[116],"pathfinding.":[117],"We,":[118],"other":[121,159,198],"hand,":[122],"present":[123],"real-time":[125,146],"algorithm":[128],"multi-agent":[130],"called":[132],"Bounded":[133],"Multi-Agent":[134],"A*":[135],"(BMAA*),":[136],"that":[137,149],"works":[138],"follows:":[140],"Every":[141],"agent":[142],"runs":[143],"individual":[145],"updates":[150],"values":[152],"assigned":[153],"treats":[157],"(moving)":[162],"obstacles.":[163],"Agents":[164],"do":[165],"not":[166],"coordinate":[167],"with":[168],"each":[169],"other,":[170],"particular,":[172],"they":[173],"neither":[174],"share":[175],"nor":[178],"values.":[180],"We":[181],"show":[182],"how":[183],"BMAA*":[184,210],"can":[185],"be":[186],"enhanced":[187],"by":[188],"adding":[189],"FAR-style":[190],"flow":[191],"annotations":[192],"allowing":[194],"push":[197],"temporarily":[200],"off":[201],"locations,":[204],"when":[205],"necessary.":[206],"In":[207],"our":[208],"experiments,":[209],"has":[211],"higher":[212],"completion":[213,217],"rates":[214],"lower":[216],"times":[218],"than":[219],"FAR.":[220]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3}],"updated_date":"2026-04-22T08:38:42.863108","created_date":"2025-10-10T00:00:00"}