{"id":"https://openalex.org/W122154553","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-119","title":"Bounded suboptimal search: a direct approach using inadmissible estimates","display_name":"Bounded suboptimal search: a direct approach using inadmissible estimates","publication_year":2011,"publication_date":"2011-07-16","ids":{"openalex":"https://openalex.org/W122154553","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-119","mag":"122154553"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.310.257","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unh.edu/~ruml/papers/ees-ijcai-11.pdf","raw_type":"text"},"type":"article","indexed_in":[],"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/A5028539154","display_name":"Jordan Thayer","orcid":null},"institutions":[{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jordan Thayer","raw_affiliation_strings":["Department of Computer Science, University of New Hampshire, Durham, NH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Hampshire, Durham, NH","institution_ids":["https://openalex.org/I161057412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009850436","display_name":"Wheeler Ruml","orcid":"https://orcid.org/0000-0002-1308-2311"},"institutions":[{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wheeler Ruml","raw_affiliation_strings":["Department of Computer Science, University of New Hampshire, Durham, NH"],"raw_orcid":"https://orcid.org/0000-0002-1308-2311","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Hampshire, Durham, NH","institution_ids":["https://openalex.org/I161057412"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I161057412"],"apc_list":null,"apc_paid":null,"fwci":6.3185,"has_fulltext":false,"cited_by_count":101,"citation_normalized_percentile":{"value":0.96951594,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"674","last_page":"679"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"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.9977999925613403,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9973999857902527,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9962999820709229,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.8396464586257935},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7664180994033813},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7071950435638428},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6595165133476257},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5429529547691345},{"id":"https://openalex.org/keywords/search-cost","display_name":"Search cost","score":0.525418758392334},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5134614109992981},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4867532253265381},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.4806312620639801},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4545527994632721},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.38723787665367126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.350436806678772},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12514814734458923}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.8396464586257935},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7664180994033813},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7071950435638428},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6595165133476257},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5429529547691345},{"id":"https://openalex.org/C21782646","wikidata":"https://www.wikidata.org/wiki/Q841666","display_name":"Search cost","level":2,"score":0.525418758392334},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5134614109992981},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4867532253265381},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4806312620639801},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4545527994632721},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.38723787665367126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.350436806678772},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12514814734458923},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.310.257","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unh.edu/~ruml/papers/ees-ijcai-11.pdf","raw_type":"text"},{"id":"mag:122154553","is_oa":false,"landing_page_url":"https://www.cs.unh.edu/~ruml/papers/ees-ijcai-11.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W10620669","https://openalex.org/W125541279","https://openalex.org/W187834424","https://openalex.org/W1489183362","https://openalex.org/W1969483458","https://openalex.org/W2035601288","https://openalex.org/W2042872950","https://openalex.org/W2114678164","https://openalex.org/W2122410182","https://openalex.org/W2139084297","https://openalex.org/W2161076907","https://openalex.org/W2241582741","https://openalex.org/W2405683058","https://openalex.org/W3203982446"],"related_works":["https://openalex.org/W1969483458","https://openalex.org/W2035601288","https://openalex.org/W3101355526","https://openalex.org/W2042872950","https://openalex.org/W3106271432","https://openalex.org/W132584314","https://openalex.org/W2405683058","https://openalex.org/W1545688112","https://openalex.org/W2161076907","https://openalex.org/W2150470619","https://openalex.org/W2165946530","https://openalex.org/W2114678164","https://openalex.org/W2196666180","https://openalex.org/W2122054842","https://openalex.org/W187834424","https://openalex.org/W1622225657","https://openalex.org/W2405657414","https://openalex.org/W2139084297","https://openalex.org/W2134634502","https://openalex.org/W2102323131"],"abstract_inverted_index":{"Bounded":[0],"suboptimal":[1,48],"search":[2,33,63],"algorithms":[3,24],"offer":[4],"shorter":[5],"solving":[6],"times":[7],"by":[8],"sacrificing":[9],"optimality":[10],"and":[11,34,65,84,129,141],"instead":[12],"guaranteeing":[13],"solution":[14,36,82,85,97,139],"costs":[15],"within":[16,98],"a":[17,26,43,96],"desired":[18],"factor":[19],"of":[20,81,121],"optimal.":[21],"Typically":[22],"these":[23,55],"use":[25],"single":[27],"admissible":[28,67],"heuristic":[29],"both":[30],"for":[31,135],"guiding":[32],"bounding":[35],"cost.":[37],"In":[38],"this":[39],"paper,":[40],"we":[41],"present":[42],"new":[44],"approach":[45],"to":[46,61,69,87,95],"bounded":[47],"search,":[49],"Explicit":[50,112],"Estimation":[51,113],"Search,":[52],"that":[53,111],"separates":[54],"roles,":[56],"consulting":[57],"potentially":[58],"inadmissible":[59],"information":[60,68],"determine":[62],"order":[64],"using":[66],"guarantee":[70],"the":[71,99,118,122],"cost":[72,86,140],"bound.":[73,101],"Unlike":[74],"previous":[75,119],"proposals,":[76],"it":[77],"successfully":[78],"combines":[79],"estimates":[80],"length":[83,142],"predict":[88],"which":[89,138],"node":[90],"will":[91],"lead":[92],"most":[93],"quickly":[94],"suboptimality":[100],"An":[102],"empirical":[103],"evaluation":[104],"across":[105],"six":[106],"diverse":[107],"benchmark":[108],"domains":[109,125,136],"shows":[110],"Search":[114],"is":[115],"competitive":[116],"with":[117,126],"state":[120],"art":[123],"in":[124,137],"unit-cost":[127],"actions":[128],"substantially":[130],"outperforms":[131],"previously":[132],"proposed":[133],"techniques":[134],"can":[143],"differ.":[144],"1":[145]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":32},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}