{"id":"https://openalex.org/W7139062607","doi":"https://doi.org/10.1609/aaai.v40i43.41046","title":"Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics","display_name":"Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7139062607","doi":"https://doi.org/10.1609/aaai.v40i43.41046"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i43.41046","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41046","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41046/45007","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://ojs.aaai.org/index.php/AAAI/article/download/41046/45007","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073638946","display_name":"Shahaf Shperberg","orcid":"https://orcid.org/0000-0001-7683-3031"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Shahaf S. Shperberg","raw_affiliation_strings":["Ben-Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129870707","display_name":"Natalie Morad","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Natalie Morad","raw_affiliation_strings":["Ben Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129805342","display_name":"Lior Siag","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Lior Siag","raw_affiliation_strings":["Ben Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011195666","display_name":"Ariel Felner","orcid":"https://orcid.org/0000-0003-0065-2757"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ariel Felner","raw_affiliation_strings":["Ben-Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025220652","display_name":"Dor Atzmon","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Dor Atzmon","raw_affiliation_strings":["Bar-Ilan University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar-Ilan University","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5073638946"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63736264,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"43","first_page":"37161","last_page":"37169"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.27950000762939453,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.27950000762939453,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.21330000460147858,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.21240000426769257,"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/heuristics","display_name":"Heuristics","score":0.6826000213623047},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5892999768257141},{"id":"https://openalex.org/keywords/strengths-and-weaknesses","display_name":"Strengths and weaknesses","score":0.511900007724762},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.38350000977516174},{"id":"https://openalex.org/keywords/meta-heuristic","display_name":"Meta heuristic","score":0.3587999939918518},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.34439998865127563},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.33709999918937683}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6826000213623047},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6141999959945679},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5892999768257141},{"id":"https://openalex.org/C63882131","wikidata":"https://www.wikidata.org/wiki/Q17122954","display_name":"Strengths and weaknesses","level":2,"score":0.511900007724762},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46889999508857727},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.38350000977516174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3817000091075897},{"id":"https://openalex.org/C2988037039","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Meta heuristic","level":2,"score":0.3587999939918518},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.34439998865127563},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.3003000020980835},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28780001401901245},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28049999475479126},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.27880001068115234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26429998874664307},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.2619999945163727}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i43.41046","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41046","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41046/45007","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.41046","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41046","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41046/45007","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":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7139062607.pdf","grobid_xml":"https://content.openalex.org/works/W7139062607.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Recent":[0],"advancements":[1],"in":[2],"bidirectional":[3,29,49,83],"heuristic":[4],"search":[5,22,50],"have":[6],"yielded":[7],"significant":[8],"theoretical":[9],"insights":[10],"and":[11,57,106],"novel":[12],"algorithms.":[13],"While":[14],"most":[15],"previous":[16],"work":[17],"has":[18],"concentrated":[19],"on":[20,27,34],"optimal":[21,48],"methods,":[23],"this":[24],"paper":[25],"focuses":[26],"bounded-suboptimal":[28,67,82],"search,":[30],"where":[31],"a":[32],"bound":[33],"the":[35,38,46,66,74,88,104],"suboptimality":[36],"of":[37,61,76,108],"solution":[39],"cost":[40],"is":[41],"specified.":[42],"We":[43],"build":[44],"upon":[45],"state-of-the-art":[47],"algorithm,":[51],"BAE*,":[52],"designed":[53],"for":[54,65],"consistent":[55],"heuristics,":[56],"introduce":[58],"several":[59],"variants":[60,79],"BAE*":[62],"specifically":[63],"tailored":[64],"context.":[68],"Through":[69],"experimental":[70],"evaluation,":[71],"we":[72],"compare":[73],"performance":[75],"these":[77],"new":[78],"against":[80],"other":[81],"algorithms":[84],"as":[85,87],"well":[86],"standard":[89],"weighted":[90],"A*":[91],"algorithm.":[92],"Our":[93],"results":[94],"demonstrate":[95],"that":[96],"each":[97,109],"algorithm":[98],"excels":[99],"under":[100],"distinct":[101],"conditions,":[102],"highlighting":[103],"strengths":[105],"weaknesses":[107],"approach.":[110]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-03-20T00:00:00"}