{"id":"https://openalex.org/W2131923625","doi":"https://doi.org/10.1109/isda.2008.125","title":"Spider Search: An Efficient and Non-Frontier-Based Real-Time Search Algorithm","display_name":"Spider Search: An Efficient and Non-Frontier-Based Real-Time Search Algorithm","publication_year":2008,"publication_date":"2008-11-01","ids":{"openalex":"https://openalex.org/W2131923625","doi":"https://doi.org/10.1109/isda.2008.125","mag":"2131923625"},"language":"en","primary_location":{"id":"doi:10.1109/isda.2008.125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isda.2008.125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 Eighth International Conference on Intelligent Systems Design and Applications","raw_type":"proceedings-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/A5029665630","display_name":"Chao Lin Chu","orcid":null},"institutions":[{"id":"https://openalex.org/I27825529","display_name":"California State University Los Angeles","ror":"https://ror.org/0294hxs80","country_code":"US","type":"education","lineage":["https://openalex.org/I27825529"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chao Lin Chu","raw_affiliation_strings":["Department of Computer Science, California State University, Los Angeles, Los Angeles, CA, USA","Dept. of Comput. Sci., California State Univ., Los Angeles, Los Angeles, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, California State University, Los Angeles, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I27825529"]},{"raw_affiliation_string":"Dept. of Comput. Sci., California State Univ., Los Angeles, Los Angeles, CA","institution_ids":["https://openalex.org/I27825529"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111761529","display_name":"Russell J. Abbott","orcid":null},"institutions":[{"id":"https://openalex.org/I27825529","display_name":"California State University Los Angeles","ror":"https://ror.org/0294hxs80","country_code":"US","type":"education","lineage":["https://openalex.org/I27825529"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Russell J. Abbott","raw_affiliation_strings":["Department of Computer Science, California State University, Los Angeles, Los Angeles, CA, USA","Dept. of Comput. Sci., California State Univ., Los Angeles, Los Angeles, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, California State University, Los Angeles, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I27825529"]},{"raw_affiliation_string":"Dept. of Comput. Sci., California State Univ., Los Angeles, Los Angeles, CA","institution_ids":["https://openalex.org/I27825529"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016024286","display_name":"Debora Shuger","orcid":"https://orcid.org/0000-0002-0958-9486"},"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":false,"raw_author_name":"Debora K. Shuger","raw_affiliation_strings":["Department of English, University of California, Los Angeles, Los Angeles, CA, USA","Dept. of English, Univ. of California, Los Angeles, Los Angeles, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of English, University of California, Los Angeles, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"Dept. of English, Univ. of California, Los Angeles, Los Angeles, CA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"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.14210673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":null,"first_page":"487","last_page":"492"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9983000159263611,"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.9983000159263611,"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.9970999956130981,"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.9927999973297119,"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/best-first-search","display_name":"Best-first search","score":0.6837672591209412},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.6626011729240417},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.6606099605560303},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6562556624412537},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.610646665096283},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.5574851036071777},{"id":"https://openalex.org/keywords/beam-stack-search","display_name":"Beam stack search","score":0.5472211837768555},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.5468565225601196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.524077832698822},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5233615636825562},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.5016458034515381},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.4470316767692566},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.4220716655254364},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4199884831905365},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.07227751612663269}],"concepts":[{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.6837672591209412},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.6626011729240417},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.6606099605560303},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6562556624412537},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.610646665096283},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.5574851036071777},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.5472211837768555},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.5468565225601196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.524077832698822},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5233615636825562},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.5016458034515381},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.4470316767692566},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.4220716655254364},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4199884831905365},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.07227751612663269},{"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.1109/isda.2008.125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isda.2008.125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 Eighth International Conference on Intelligent Systems Design and Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1666476","https://openalex.org/W1549676634","https://openalex.org/W1557519121","https://openalex.org/W2021061679","https://openalex.org/W2122128939","https://openalex.org/W2122410182","https://openalex.org/W2623293810","https://openalex.org/W6600058601","https://openalex.org/W6632952755"],"related_works":["https://openalex.org/W2376570066","https://openalex.org/W2224555876","https://openalex.org/W2125033394","https://openalex.org/W4200104947","https://openalex.org/W134484048","https://openalex.org/W2208339373","https://openalex.org/W2354057059","https://openalex.org/W3014882394","https://openalex.org/W2064794194","https://openalex.org/W2593395660"],"abstract_inverted_index":{"Real-time":[0],"search":[1,7,20,25,37,85,98],"algorithms":[2,21,26],"are":[3,30,44],"limited":[4],"to":[5,66],"constant-bounded":[6],"at":[8,78],"each":[9,79],"time":[10,63],"step.":[11,80],"We":[12,81],"do":[13],"not":[14,74],"see":[15],"much":[16],"difference":[17],"between":[18],"standard":[19],"and":[22,64],"good":[23,35],"real-time":[24,36],"when":[27,41,69],"problem":[28,42],"sizes":[29,43],"small.":[31],"However,":[32],"having":[33],"a":[34,51,90],"algorithm":[38],"becomes":[39],"important":[40],"large.":[45],"In":[46],"this":[47],"paper":[48],"we":[49],"introduce":[50],"simple":[52],"yet":[53],"efficient":[54],"algorithm,":[55],"Spider":[56,84],"search,":[57],"which":[58],"uses":[59],"very":[60],"low":[61],"constant":[62],"space":[65],"solve":[67],"problems":[68],"agents":[70],"need":[71],"deep":[72],"(but":[73],"exhaustive)":[75],"path":[76],"analysis":[77],"expect":[82],"that":[83],"is":[86],"the":[87],"first":[88],"in":[89],"new":[91],"class":[92],"of":[93],"tree-based":[94],"rather":[95],"than":[96],"frontier-based":[97],"algorithms.":[99]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}