{"id":"https://openalex.org/W2121544988","doi":"https://doi.org/10.1142/s0218001499000537","title":"INTERLEAVED VERSUS <i>A PRIORI</i> EXPLORATION FOR REPEATED NAVIGATION IN A PARTIALLY-KNOWN GRAPH","display_name":"INTERLEAVED VERSUS <i>A PRIORI</i> EXPLORATION FOR REPEATED NAVIGATION IN A PARTIALLY-KNOWN GRAPH","publication_year":1999,"publication_date":"1999-11-01","ids":{"openalex":"https://openalex.org/W2121544988","doi":"https://doi.org/10.1142/s0218001499000537","mag":"2121544988"},"language":"en","primary_location":{"id":"doi:10.1142/s0218001499000537","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218001499000537","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Pattern Recognition and 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/A5074618190","display_name":"Shlomo Argamon-Engelson","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]},{"id":"https://openalex.org/I192238737","display_name":"Jerusalem College of Technology","ror":"https://ror.org/002kenh51","country_code":"IL","type":"education","lineage":["https://openalex.org/I192238737"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"SHLOMO ARGAMON-ENGELSON","raw_affiliation_strings":["Department of Computer Science, Jerusalem College of Technology, P.O.B. 16031, 91160 Jerusalem, Israel","Department of Mathematics and Computer Science, Bar-Ilan University, 52900 Ramat Gan, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Jerusalem College of Technology, P.O.B. 16031, 91160 Jerusalem, Israel","institution_ids":["https://openalex.org/I192238737"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Bar-Ilan University, 52900 Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103213461","display_name":"Sarit Kraus","orcid":"https://orcid.org/0000-0003-4672-623X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]},{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"SARIT KRAUS","raw_affiliation_strings":["Department of Mathematics and Computer Science, Bar-Ilan University, 52900 Ramat Gan, Israel","Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Bar-Ilan University, 52900 Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103436660","display_name":"Sigalit Sina","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]},{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"SIGALIT SINA","raw_affiliation_strings":["Department of Mathematics and Computer Science, Bar-Ilan University, 52900 Ramat Gan, Israel","Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Bar-Ilan University, 52900 Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074618190"],"corresponding_institution_ids":["https://openalex.org/I13955877","https://openalex.org/I192238737"],"apc_list":null,"apc_paid":null,"fwci":0.4047,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74288275,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"07","first_page":"963","last_page":"986"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.9995999932289124,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9976000189781189,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9973000288009644,"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/computer-science","display_name":"Computer science","score":0.7839547395706177},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.7001352906227112},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.6651282906532288},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5632592439651489},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.51416015625},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4331062436103821},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.41472524404525757},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25670570135116577}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7839547395706177},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.7001352906227112},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.6651282906532288},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5632592439651489},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.51416015625},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4331062436103821},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41472524404525757},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25670570135116577},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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":"doi:10.1142/s0218001499000537","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218001499000537","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Pattern Recognition and Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:touroscholar.touro.edu:president_pubs-1304","is_oa":false,"landing_page_url":"https://touroscholar.touro.edu/president_pubs/304","pdf_url":null,"source":{"id":"https://openalex.org/S4377196437","display_name":"Touro Scholar (Touro College)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200437953","host_organization_name":"Touro College","host_organization_lineage":["https://openalex.org/I200437953"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Office of the President Publications and Research","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1974672670","https://openalex.org/W1993711637","https://openalex.org/W2010493094","https://openalex.org/W2021061679","https://openalex.org/W2048226872","https://openalex.org/W2080028974","https://openalex.org/W2106389684","https://openalex.org/W2107726111","https://openalex.org/W2154082525","https://openalex.org/W4211055657"],"related_works":["https://openalex.org/W1974056099","https://openalex.org/W2386077341","https://openalex.org/W563589758","https://openalex.org/W5922282","https://openalex.org/W2954004777","https://openalex.org/W2949638731","https://openalex.org/W2951102138","https://openalex.org/W62490179","https://openalex.org/W4299447939","https://openalex.org/W2046546488"],"abstract_inverted_index":{"In":[0,203],"this":[1],"paper,":[2],"we":[3,205,237],"address":[4],"the":[5,19,37,48,54,70,117,120,139,192,195,207,210,217],"tradeoff":[6],"between":[7],"exploration":[8,63,100,107,156,164,177,189,242],"and":[9,53,119],"exploitation":[10],"for":[11,65,102,163,182,209],"agents":[12],"which":[13,45,105],"need":[14,42],"to":[15,26,43,58,77,231],"learn":[16,44],"more":[17,28],"about":[18],"structure":[20],"of":[21,81,127,147,197,212,228],"their":[22],"environment":[23],"in":[24,134,245],"order":[25],"perform":[27,78,232],"effectively.":[29],"For":[30],"example,":[31],"a":[32,66,89,97,135,159,174,183,220,225],"software":[33],"agent":[34,71,218],"operating":[35],"on":[36,47,88],"World":[38],"Wide":[39],"Web":[40],"may":[41],"sites":[46],"net":[49],"are":[50,84],"most":[51,55,246],"useful,":[52],"efficient":[56],"routes":[57],"those":[59],"sites.":[60],"We":[61,150,179],"compare":[62],"strategies":[64],"repeated":[67,103,185,214],"task,":[68,186],"where":[69,216],"is":[72,132,200,243],"given":[73],"some":[74,79],"particular":[75],"task":[76,109,125,166,198,223],"number":[80,196],"times.":[82],"Tasks":[83],"modeled":[85],"as":[86,171,173],"navigation":[87],"partially":[90],"known":[91,226],"(deterministic)":[92],"graph.":[93],"This":[94],"paper":[95],"describes":[96],"new":[98],"utility-based":[99,154,187,240],"algorithm":[101,157,162],"tasks":[104],"interleaves":[106],"with":[108,138],"performance.":[110],"The":[111],"method":[112],"takes":[113],"into":[114],"account":[115],"both":[116],"costs":[118],"potential":[121],"benefits":[122],"(for":[123],"future":[124],"repetitions)":[126],"different":[128],"exploratory":[129,142],"actions.":[130],"Exploration":[131],"performed":[133,144],"greedy":[136],"fashion,":[137],"locally":[140],"optimal":[141],"action":[143],"during":[145],"repetition":[146],"each":[148,233],"task.":[149],"experimentally":[151],"evaluated":[152],"our":[153],"interleaved":[155,176,188,241],"against":[158],"heuristic":[160],"search":[161],"before":[165],"performance":[167],"(a":[168],"priori":[169],"exploration)":[170],"well":[172],"randomized":[175],"algorithm.":[178],"found":[180,238],"that":[181,239],"single":[184],"consistently":[190],"outperforms":[191],"alternatives,":[193],"unless":[194],"repetitions":[199],"very":[201],"high.":[202],"addition,":[204],"extended":[206],"algorithms":[208],"case":[211],"multiple":[213],"tasks,":[215],"has":[219],"different,":[221],"randomly-chosen":[222],"(from":[224],"subset":[227],"possible":[229],"tasks)":[230],"time.":[234],"Here":[235],"too,":[236],"clear":[244],"cases.":[247]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}