{"id":"https://openalex.org/W2009833344","doi":"https://doi.org/10.1016/0004-3702(93)90045-d","title":"Linear-space best-first search","display_name":"Linear-space best-first search","publication_year":1993,"publication_date":"1993-07-01","ids":{"openalex":"https://openalex.org/W2009833344","doi":"https://doi.org/10.1016/0004-3702(93)90045-d","mag":"2009833344"},"language":"en","primary_location":{"id":"doi:10.1016/0004-3702(93)90045-d","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0004-3702(93)90045-d","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5012387794","display_name":"Richard E. Korf","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Richard E. Korf","raw_affiliation_strings":["Computer Science Department, University of California, Los Angeles, Los Angeles, CA 90024, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of California, Los Angeles, Los Angeles, CA 90024, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012387794"],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":{"value":3670,"currency":"USD","value_usd":3670},"apc_paid":null,"fwci":17.3786,"has_fulltext":false,"cited_by_count":306,"citation_normalized_percentile":{"value":0.99269829,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"62","issue":"1","first_page":"41","last_page":"78"},"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.9993000030517578,"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.9993000030517578,"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.9973000288009644,"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.9968000054359436,"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/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.7380382418632507},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6405807137489319},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6334220170974731},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.6186411380767822},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.5568910241127014},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.523386538028717},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5130916833877563},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5070841312408447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5054290294647217},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4950975477695465},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.494780957698822},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47522833943367004},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4619925320148468},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4594903588294983},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4577987492084503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4525149166584015},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.4417964816093445},{"id":"https://openalex.org/keywords/linear-search","display_name":"Linear search","score":0.43776506185531616},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.4223499298095703},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.26652783155441284},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17415031790733337}],"concepts":[{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.7380382418632507},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6405807137489319},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6334220170974731},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.6186411380767822},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.5568910241127014},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.523386538028717},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5130916833877563},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5070841312408447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5054290294647217},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4950975477695465},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.494780957698822},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47522833943367004},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4619925320148468},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4594903588294983},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4577987492084503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4525149166584015},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4417964816093445},{"id":"https://openalex.org/C204259536","wikidata":"https://www.wikidata.org/wiki/Q787903","display_name":"Linear search","level":2,"score":0.43776506185531616},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.4223499298095703},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.26652783155441284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17415031790733337},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0004-3702(93)90045-d","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0004-3702(93)90045-d","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W21421256","https://openalex.org/W27451032","https://openalex.org/W38076005","https://openalex.org/W93749496","https://openalex.org/W96515380","https://openalex.org/W142052091","https://openalex.org/W177650123","https://openalex.org/W201239910","https://openalex.org/W1969483458","https://openalex.org/W2021061679","https://openalex.org/W2035601288","https://openalex.org/W2066356146","https://openalex.org/W2077166305","https://openalex.org/W2088359154","https://openalex.org/W2089137033","https://openalex.org/W2096138715","https://openalex.org/W2124310142","https://openalex.org/W2126677653","https://openalex.org/W2134634502","https://openalex.org/W2149951504","https://openalex.org/W2150470619","https://openalex.org/W2169528473","https://openalex.org/W2401610261","https://openalex.org/W2514454700","https://openalex.org/W2562621718","https://openalex.org/W6600864798","https://openalex.org/W6601120529","https://openalex.org/W6601538878","https://openalex.org/W6603835710","https://openalex.org/W6605801210","https://openalex.org/W6607203844","https://openalex.org/W6608203047","https://openalex.org/W6644040475","https://openalex.org/W6674065141","https://openalex.org/W6678502202","https://openalex.org/W6678592152","https://openalex.org/W6730741048"],"related_works":["https://openalex.org/W2224555876","https://openalex.org/W2081821176","https://openalex.org/W2402589461","https://openalex.org/W2150470619","https://openalex.org/W2358427436","https://openalex.org/W4200104947","https://openalex.org/W169590971","https://openalex.org/W2998661990","https://openalex.org/W2354057059","https://openalex.org/W4213195198"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}