{"id":"https://openalex.org/W2789754971","doi":"https://doi.org/10.3233/icg-1994-17411","title":"Agent Searching in a Tree and the Optimality of Iterative Deepening","display_name":"Agent Searching in a Tree and the Optimality of Iterative Deepening","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2789754971","doi":"https://doi.org/10.3233/icg-1994-17411","mag":"2789754971"},"language":"en","primary_location":{"id":"doi:10.3233/icg-1994-17411","is_oa":true,"landing_page_url":"https://doi.org/10.3233/icg-1994-17411","pdf_url":"https://content.iospress.com:443/download/icga-journal/icg17-4-11?id=icga-journal%2Ficg17-4-11","source":{"id":"https://openalex.org/S30686695","display_name":"ICGA Journal","issn_l":"1389-6911","issn":["1389-6911","2468-2438"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310321919","host_organization_name":"International Computer Games Association","host_organization_lineage":["https://openalex.org/P4310321919"],"host_organization_lineage_names":["International Computer Games Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICGA Journal","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://content.iospress.com:443/download/icga-journal/icg17-4-11?id=icga-journal%2Ficg17-4-11","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033329960","display_name":"Pallab Dasgupta","orcid":"https://orcid.org/0000-0002-2178-8154"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]},{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH","IN"],"is_corresponding":false,"raw_author_name":"P. Dasgupta","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India 721302","Ecole Poly technique Federale de Lausanne, Laboratoire d'Informatique Theorique, IN (Ecublens), CH-1015 Lausanne, Switzerland","Kharagpur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India 721302","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Ecole Poly technique Federale de Lausanne, Laboratoire d'Informatique Theorique, IN (Ecublens), CH-1015 Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"Kharagpur, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008983984","display_name":"P.P. Chakrabarti","orcid":"https://orcid.org/0000-0002-0515-2885"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]},{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH","IN"],"is_corresponding":false,"raw_author_name":"P.P. Chakrabarti","raw_affiliation_strings":["Kharagpur, India","Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India 721302","Ecole Poly technique Federale de Lausanne, Laboratoire d'Informatique Theorique, IN (Ecublens), CH-1015 Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kharagpur, India","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India 721302","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Ecole Poly technique Federale de Lausanne, Laboratoire d'Informatique Theorique, IN (Ecublens), CH-1015 Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049220059","display_name":"S.C. DeSarkar","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]},{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH","IN"],"is_corresponding":false,"raw_author_name":"S.C. DeSarkar","raw_affiliation_strings":["Kharagpur, India","Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India 721302","Ecole Poly technique Federale de Lausanne, Laboratoire d'Informatique Theorique, IN (Ecublens), CH-1015 Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kharagpur, India","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India 721302","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Ecole Poly technique Federale de Lausanne, Laboratoire d'Informatique Theorique, IN (Ecublens), CH-1015 Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.44706608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"4","first_page":"222","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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/T11182","display_name":"Auction Theory and Applications","score":0.9785000085830688,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9679999947547913,"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/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.9521704912185669},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.743809700012207},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.597744345664978},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5934196710586548},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5474997758865356},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.5328980088233948},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5143533945083618},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.48692142963409424},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.4770445227622986},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4663853645324707},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46242183446884155},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.4431607723236084},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4376927614212036},{"id":"https://openalex.org/keywords/beam-stack-search","display_name":"Beam stack search","score":0.43100079894065857},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.43099939823150635},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.390163779258728},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36096978187561035},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.091848224401474},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.061088889837265015}],"concepts":[{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.9521704912185669},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.743809700012207},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.597744345664978},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5934196710586548},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5474997758865356},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.5328980088233948},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5143533945083618},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.48692142963409424},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.4770445227622986},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4663853645324707},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46242183446884155},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.4431607723236084},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4376927614212036},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.43100079894065857},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.43099939823150635},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.390163779258728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36096978187561035},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.091848224401474},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.061088889837265015},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/icg-1994-17411","is_oa":true,"landing_page_url":"https://doi.org/10.3233/icg-1994-17411","pdf_url":"https://content.iospress.com:443/download/icga-journal/icg17-4-11?id=icga-journal%2Ficg17-4-11","source":{"id":"https://openalex.org/S30686695","display_name":"ICGA Journal","issn_l":"1389-6911","issn":["1389-6911","2468-2438"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310321919","host_organization_name":"International Computer Games Association","host_organization_lineage":["https://openalex.org/P4310321919"],"host_organization_lineage_names":["International Computer Games Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICGA Journal","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.3233/icg-1994-17411","is_oa":true,"landing_page_url":"https://doi.org/10.3233/icg-1994-17411","pdf_url":"https://content.iospress.com:443/download/icga-journal/icg17-4-11?id=icga-journal%2Ficg17-4-11","source":{"id":"https://openalex.org/S30686695","display_name":"ICGA Journal","issn_l":"1389-6911","issn":["1389-6911","2468-2438"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310321919","host_organization_name":"International Computer Games Association","host_organization_lineage":["https://openalex.org/P4310321919"],"host_organization_lineage_names":["International Computer Games Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICGA Journal","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2789754971.pdf","grobid_xml":"https://content.openalex.org/works/W2789754971.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2150470619","https://openalex.org/W2376570066","https://openalex.org/W2224555876","https://openalex.org/W2354057059","https://openalex.org/W2208339373","https://openalex.org/W2391773788","https://openalex.org/W4214503203","https://openalex.org/W2368028352","https://openalex.org/W2064794194","https://openalex.org/W2081821176"],"abstract_inverted_index":{"The":[0,25],"agent":[1,19,67,111,134],"searching":[2,68,112],"framework":[3,26],"models":[4],"the":[5,14,22,38,82,106,128],"effort":[6],"of":[7,13,40,97],"a":[8,70,137],"search":[9,23,35,44,50,84,96,135],"strategy":[10],"in":[11,33,48,69,72,77,113,131,136],"terms":[12],"distance":[15],"traversed":[16],"by":[17],"an":[18,66],"while":[20],"exploring":[21],"space.":[24],"has":[27],"been":[28],"found":[29],"to":[30,122],"be":[31],"useful":[32],"modeling":[34],"problems":[36,129],"where":[37],"cost":[39],"backtracking":[41],"and":[42,76],"retracing":[43],"paths":[45],"is":[46,87,91,119],"important":[47],"determining":[49],"complexity.":[51],"In":[52,81,101],"this":[53,102],"paper":[54,103],"we":[55,104],"show":[56],"that":[57,89,109],"depth-first":[58],"iterative":[59,117],"deepening":[60,118],"(DFID)":[61],"strategies":[62],"are":[63],"optimal":[64,93,120],"for":[65,94,110],"line,":[71],"m":[73],"concurrent":[74],"rays,":[75],"uniform":[78,98,114],"b-ary":[79,99,115],"trees.":[80,100],"conventional":[83],"model":[85],"it":[86],"known":[88],"DFID":[90],"asymptotically":[92],"uninformed":[95],"prove":[105],"stronger":[107],"result":[108],"trees,":[116],"up":[121],"lower-order":[123],"terms.":[124],"We":[125],"also":[126],"discuss":[127],"involved":[130],"optimally":[132],"performing":[133],"graph.":[138]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}