{"id":"https://openalex.org/W2966589477","doi":"https://doi.org/10.1109/lics.2019.8785706","title":"Graph Planning with Expected Finite Horizon","display_name":"Graph Planning with Expected Finite Horizon","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2966589477","doi":"https://doi.org/10.1109/lics.2019.8785706","mag":"2966589477"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","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/A5052607806","display_name":"Krishnendu Chatterjee","orcid":"https://orcid.org/0000-0002-4561-241X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Krishnendu Chatterjee","raw_affiliation_strings":["IST, Austria"],"affiliations":[{"raw_affiliation_string":"IST, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102787606","display_name":"Laurent Doyen","orcid":"https://orcid.org/0000-0003-3714-6145"},"institutions":[{"id":"https://openalex.org/I29607241","display_name":"\u00c9cole Normale Sup\u00e9rieure - PSL","ror":"https://ror.org/05a0dhs15","country_code":"FR","type":"funder","lineage":["https://openalex.org/I2746051580","https://openalex.org/I29607241"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Laurent Doyen","raw_affiliation_strings":["CNRS & LSV, ENS Paris-Saclay, France"],"affiliations":[{"raw_affiliation_string":"CNRS & LSV, ENS Paris-Saclay, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I29607241","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052607806"],"corresponding_institution_ids":["https://openalex.org/I157556583"],"apc_list":null,"apc_paid":null,"fwci":0.3537,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62764435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"58","issue":null,"first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9965000152587891,"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.9965000152587891,"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/T11031","display_name":"Game Theory and Applications","score":0.9944999814033508,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9934999942779541,"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/stopping-time","display_name":"Stopping time","score":0.6830238103866577},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.6791406273841858},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5879507064819336},{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.568727433681488},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5343904495239258},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5012426376342773},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48846855759620667},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.480047345161438},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.45869866013526917},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4523816704750061},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42455318570137024},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.410916268825531},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27287524938583374}],"concepts":[{"id":"https://openalex.org/C99888217","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping time","level":2,"score":0.6830238103866577},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.6791406273841858},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5879507064819336},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.568727433681488},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5343904495239258},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5012426376342773},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48846855759620667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.480047345161438},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.45869866013526917},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4523816704750061},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42455318570137024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.410916268825531},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27287524938583374},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2019.8785706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W93404625","https://openalex.org/W1234389479","https://openalex.org/W1424654272","https://openalex.org/W1496590343","https://openalex.org/W1583869287","https://openalex.org/W1623604111","https://openalex.org/W1834996031","https://openalex.org/W2028145673","https://openalex.org/W2032100464","https://openalex.org/W2051068608","https://openalex.org/W2109100253","https://openalex.org/W2122410182","https://openalex.org/W2611243847","https://openalex.org/W2623293810","https://openalex.org/W4235239597","https://openalex.org/W4242285942","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W3097642646","https://openalex.org/W4316830005","https://openalex.org/W1989184280","https://openalex.org/W2002489931","https://openalex.org/W4402039348","https://openalex.org/W2022139826","https://openalex.org/W3123468487","https://openalex.org/W2349258365","https://openalex.org/W4299402126","https://openalex.org/W2011704737"],"abstract_inverted_index":{"Graph":[0],"planning":[1,21],"gives":[2],"rise":[3],"to":[4,23,61,81,91],"fundamental":[5],"algorithmic":[6],"questions":[7],"such":[8,64],"as":[9],"shortest":[10],"path,":[11],"traveling":[12],"salesman":[13],"problem,":[14],"etc.":[15],"A":[16,96],"classical":[17],"problem":[18],"in":[19,45,168],"discrete":[20],"is":[22,51,58,70,77,86,152],"consider":[24],"a":[25,30,39],"weighted":[26],"graph":[27],"and":[28],"construct":[29],"path":[31],"that":[32,65,126,156],"maximizes":[33],"the":[34,48,55,66,73,84,93,104,131],"sum":[35],"of":[36],"weights":[37],"for":[38,99,120,149,175],"given":[40],"time":[41,49,57,69,75,137,178],"horizon":[42,50,110,151],"T.":[43,71],"However,":[44],"many":[46],"scenarios,":[47],"not":[52,78,118],"fixed,":[53],"but":[54],"stopping":[56,68,74,136,177],"chosen":[59,87],"according":[60],"some":[62],"distribution":[63,76,85,133,164],"expected":[67,135],"If":[72],"known,":[79],"then":[80,139],"ensure":[82],"robustness,":[83],"by":[88],"an":[89,128,181],"adversary,":[90],"represent":[92],"worst-case":[94],"scenario.":[95],"stationary":[97,115,140,147,159],"plan":[98,183],"every":[100],"vertex":[101],"always":[102],"chooses":[103,130],"same":[105],"outgoing":[106],"edge.":[107],"For":[108],"fixed":[109,112,150],"or":[111],"stopping-time":[113,132,163],"distribution,":[114],"plans":[116,141,148,160],"are":[117,142],"sufficient":[119],"optimality.":[121],"Quite":[122],"surprisingly":[123],"we":[124,154],"show":[125,155],"when":[127],"adversary":[129],"with":[134],"T,":[138],"sufficient.":[143],"While":[144],"computing":[145,157],"optimal":[146,158,182],"NP-complete,":[153],"under":[161],"adversarial":[162,176],"can":[165],"be":[166],"achieved":[167],"polynomial":[169],"time.":[170],"Consequently,":[171],"our":[172],"polynomial-time":[173],"algorithm":[174],"also":[179],"computes":[180],"among":[184],"all":[185],"possible":[186],"plans.":[187]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}