{"id":"https://openalex.org/W7138864632","doi":"https://doi.org/10.1609/aaai.v40i43.41044","title":"Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions","display_name":"Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138864632","doi":"https://doi.org/10.1609/aaai.v40i43.41044"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i43.41044","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41044","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v40i43.41044","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026896382","display_name":"Daniel Platnick","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148693","display_name":"Metropolitan University","ror":"https://ror.org/04hdrrs71","country_code":"BD","type":"education","lineage":["https://openalex.org/I4210148693"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Daniel Platnick","raw_affiliation_strings":["Flybits Labs\nToronto Metropolitan University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Flybits Labs\nToronto Metropolitan University","institution_ids":["https://openalex.org/I4210148693"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130103422","display_name":"Dawson Tomasz","orcid":null},"institutions":[{"id":"https://openalex.org/I4210127509","display_name":"Vector Institute","ror":"https://ror.org/03kqdja62","country_code":"CA","type":"facility","lineage":["https://openalex.org/I4210127509"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Dawson Tomasz","raw_affiliation_strings":["Toronto Metropolitan University\nVector Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Toronto Metropolitan University\nVector Institute","institution_ids":["https://openalex.org/I4210127509"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120598763","display_name":"Eamon Earl","orcid":null},"institutions":[{"id":"https://openalex.org/I4210127509","display_name":"Vector Institute","ror":"https://ror.org/03kqdja62","country_code":"CA","type":"facility","lineage":["https://openalex.org/I4210127509"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Eamon Earl","raw_affiliation_strings":["Toronto Metropolitan University\nVector Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Toronto Metropolitan University\nVector Institute","institution_ids":["https://openalex.org/I4210127509"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091952767","display_name":"Sourena Khanzadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sourena Khanzadeh","raw_affiliation_strings":["Toronto Metropolitan University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Toronto Metropolitan University","institution_ids":["https://openalex.org/I530967"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055185956","display_name":"Richard Valenzano","orcid":"https://orcid.org/0000-0001-5954-7869"},"institutions":[{"id":"https://openalex.org/I4210127509","display_name":"Vector Institute","ror":"https://ror.org/03kqdja62","country_code":"CA","type":"facility","lineage":["https://openalex.org/I4210127509"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Richard Valenzano","raw_affiliation_strings":["Toronto Metropolitan University\nVector Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Toronto Metropolitan University\nVector Institute","institution_ids":["https://openalex.org/I4210127509"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.59269406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"43","first_page":"37143","last_page":"37151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.7638000249862671,"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"}},"topics":[{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.7638000249862671,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.10419999808073044,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.025699999183416367,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7235000133514404},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6869000196456909},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.6764000058174133},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4020000100135803},{"id":"https://openalex.org/keywords/random-search","display_name":"Random search","score":0.3167000114917755},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3086000084877014}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7235000133514404},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6869000196456909},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6764000058174133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46619999408721924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45680001378059387},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4449999928474426},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4020000100135803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3481000065803528},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.30309998989105225},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.272599995136261},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i43.41044","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41044","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i43.41044","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41044","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5665616989135742,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Greedy":[0,5],"search":[1,43],"methods":[2,38,95],"such":[3],"as":[4],"Best-First":[6],"Search":[7],"(GBFS)":[8],"and":[9,33,45,62,70,75],"Enforced":[10],"Hill-Climbing":[11],"(EHC)":[12],"often":[13],"struggle":[14],"when":[15,82],"faced":[16],"with":[17,145],"Uninformed":[18],"Heuristic":[19],"Regions":[20],"(UHRs)":[21],"like":[22],"heuristic":[23],"local":[24],"minima":[25],"or":[26],"plateaus.":[27],"In":[28],"this":[29],"work,":[30],"we":[31,51,92,142],"theoretically":[32],"empirically":[34],"compare":[35],"two":[36],"popular":[37],"for":[39,96,118,158],"escaping":[40,57,97,159],"UHRs:":[41],"breadth-first":[42],"(BrFS)":[44],"restarting":[46],"random":[47,72],"walks":[48],"(RRWs).":[49],"First,":[50],"derive":[52],"the":[53,68,71],"expected":[54,127],"runtime":[55,128],"of":[56,67,111],"a":[58],"UHR":[59,69],"using":[60],"BrFS":[61,105],"RRWs,":[63],"based":[64],"on":[65,148],"properties":[66],"walk":[73],"procedure,":[74],"then":[76],"use":[77,116],"these":[78,94,146],"results":[79],"to":[80,106,109,124,138,152],"identify":[81],"RRWs":[83,117],"will":[84],"be":[85,139],"faster":[86],"in":[87,130],"expectation":[88],"than":[89],"BrFS.":[90],"Next,":[91],"evaluate":[93],"UHRs":[98],"by":[99],"comparing":[100],"standard":[101],"EHC,":[102],"which":[103,115],"uses":[104],"escape":[107],"UHRs,":[108],"variants":[110],"EHC":[112,133],"called":[113],"EHC-RRW,":[114],"that":[119],"purpose.":[120],"EHC-RRW":[121],"is":[122],"shown":[123,137],"have":[125],"strong":[126],"guarantees":[129],"cases":[131],"where":[132],"has":[134],"previously":[135],"been":[136],"effective.":[140],"Finally,":[141],"run":[143],"experiments":[144],"approaches":[147],"PDDL":[149],"planning":[150],"benchmarks":[151],"better":[153],"understand":[154],"their":[155],"relative":[156],"effectiveness":[157],"UHRs.":[160]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-03-20T00:00:00"}