乐胖代购免代理版

{"id":"https://openalex.org/W2965387939","doi":"https://doi.org/10.1609/socs.v10i1.18498","title":"Revisiting Suboptimal Search","display_name":"Revisiting Suboptimal Search","publication_year":2021,"publication_date":"2021-09-01","ids":{"openalex":"https://openalex.org/W2965387939","doi":"https://doi.org/10.1609/socs.v10i1.18498","mag":"2965387939"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v10i1.18498","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18498/18289","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18498/18289","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100614650","display_name":"Jingwei Chen","orcid":"https://orcid.org/0000-0002-9868-8936"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"funder","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jingwei Chen","raw_affiliation_strings":["University of Alberta"],"affiliations":[{"raw_affiliation_string":"University of Alberta","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041415709","display_name":"Nathan Sturtevant","orcid":"https://orcid.org/0000-0003-4318-2791"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"funder","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Nathan Sturtevant","raw_affiliation_strings":["University of Alberta"],"affiliations":[{"raw_affiliation_string":"University of Alberta","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114038210","display_name":"William Doyle","orcid":null},"institutions":[{"id":"https://openalex.org/I179093154","display_name":"University of New Hampshire at Manchester","ror":"https://ror.org/04pvpk743","country_code":"US","type":"education","lineage":["https://openalex.org/I179093154"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William Doyle","raw_affiliation_strings":["University of New Hampshire"],"affiliations":[{"raw_affiliation_string":"University of New Hampshire","institution_ids":["https://openalex.org/I179093154"]}]},{"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/I179093154","display_name":"University of New Hampshire at Manchester","ror":"https://ror.org/04pvpk743","country_code":"US","type":"education","lineage":["https://openalex.org/I179093154"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wheeler Ruml","raw_affiliation_strings":["University of New Hampshire"],"affiliations":[{"raw_affiliation_string":"University of New Hampshire","institution_ids":["https://openalex.org/I179093154"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.198,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":6,"citation_normalized_percentile":{"value":0.3028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":80,"max":82},"biblio":{"volume":"10","issue":"1","first_page":"18","last_page":"25"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9992,"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.9992,"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.9991,"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.9978,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/beam-stack-search","display_name":"Beam stack search","score":0.49520436},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.48271844},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.4524263}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.77814263},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5829008},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.5689157},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.5518794},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.54644626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5310407},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.53004766},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4969168},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.49674565},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.49520436},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.48271844},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4797679},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.4524263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34486783},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3413983},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v10i1.18498","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18498/18289","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v10i1.18498","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18498/18289","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":22,"referenced_works":["https://openalex.org/W122154553","https://openalex.org/W1487826456","https://openalex.org/W1546496537","https://openalex.org/W1949377792","https://openalex.org/W1969483458","https://openalex.org/W2010549090","https://openalex.org/W2035601288","https://openalex.org/W2042872950","https://openalex.org/W2083105191","https://openalex.org/W2102323131","https://openalex.org/W2114678164","https://openalex.org/W2135125135","https://openalex.org/W2149568304","https://openalex.org/W2293367869","https://openalex.org/W2293478223","https://openalex.org/W2529475626","https://openalex.org/W2577858298","https://openalex.org/W2623293810","https://openalex.org/W2788006543","https://openalex.org/W2807827805","https://openalex.org/W2966481281","https://openalex.org/W4301620674"],"related_works":["https://openalex.org/W4300167198","https://openalex.org/W4200104947","https://openalex.org/W2998661990","https://openalex.org/W2808808802","https://openalex.org/W2397806795","https://openalex.org/W2354057059","https://openalex.org/W2125033394","https://openalex.org/W2064794194","https://openalex.org/W169590971","https://openalex.org/W134484048"],"abstract_inverted_index":{"Suboptimal":[0],"search":[1,11],"algorithms":[2,24],"can":[3],"often":[4,65],"solve":[5],"much":[6,72],"larger":[7],"problems":[8],"than":[9],"optimal":[10],"algorithms,":[12],"and":[13,28],"thus":[14],"have":[15],"broad":[16],"practical":[17],"use.":[18],"This":[19],"paper":[20],"returns":[21],"to":[22,40],"early":[23],"like":[25],"WA*,":[26],"A*_e":[27],"Optimistic":[29],"search.":[30,76,87],"It":[31],"studies":[32],"the":[33,69,75],"commonalities":[34],"between":[35],"these":[36,79],"approaches":[37],"in":[38,54,85],"order":[39],"build":[41],"a":[42,57,82],"new":[43,58,83],"bounded-suboptimal":[44],"algorithm.":[45],"Combined":[46],"with":[47],"recent":[48],"research":[49],"on":[50],"avoiding":[51],"node":[52],"re-expansions":[53],"bounded-optimal":[55,86],"search,":[56],"solution":[59,70],"quality":[60],"bound":[61,71],"is":[62],"developed,":[63],"which":[64],"provides":[66],"proof":[67],"of":[68],"earlier":[73],"during":[74],"Put":[77],"together,":[78],"ideas":[80],"provide":[81],"state-of-the-art":[84]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2965387939","counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3}],"updated_date":"2025-04-17T05:05:24.972308","created_date":"2019-08-13"}