{"id":"https://openalex.org/W2110235415","doi":"https://doi.org/10.1109/tac.2008.2006932","title":"Optimal Node Visitation in Stochastic Digraphs","display_name":"Optimal Node Visitation in Stochastic Digraphs","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2110235415","doi":"https://doi.org/10.1109/tac.2008.2006932","mag":"2110235415"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2008.2006932","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2008.2006932","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/A5111880744","display_name":"Theologos Bountourelis","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Theologos Bountourelis","raw_affiliation_strings":["School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008675858","display_name":"Spyros Reveliotis","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Spyros Reveliotis","raw_affiliation_strings":["School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":1.8846,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8749747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"53","issue":"11","first_page":"2558","last_page":"2570"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9908000230789185,"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.9908000230789185,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9835000038146973,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9783999919891357,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6933717727661133},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.6333106160163879},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6100261211395264},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5778269171714783},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.5256182551383972},{"id":"https://openalex.org/keywords/stochastic-control","display_name":"Stochastic control","score":0.509674072265625},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.5070154666900635},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5019679069519043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48467138409614563},{"id":"https://openalex.org/keywords/divergence","display_name":"Divergence (linguistics)","score":0.47066959738731384},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4377148151397705},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42992669343948364},{"id":"https://openalex.org/keywords/uniform-boundedness","display_name":"Uniform boundedness","score":0.424416184425354},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4235972762107849},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19098559021949768}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6933717727661133},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.6333106160163879},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6100261211395264},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5778269171714783},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.5256182551383972},{"id":"https://openalex.org/C170131372","wikidata":"https://www.wikidata.org/wiki/Q7617811","display_name":"Stochastic control","level":3,"score":0.509674072265625},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.5070154666900635},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5019679069519043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48467138409614563},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.47066959738731384},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4377148151397705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42992669343948364},{"id":"https://openalex.org/C90377204","wikidata":"https://www.wikidata.org/wiki/Q1052594","display_name":"Uniform boundedness","level":3,"score":0.424416184425354},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4235972762107849},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19098559021949768},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2008.2006932","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2008.2006932","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W565357261","https://openalex.org/W610904500","https://openalex.org/W1482298744","https://openalex.org/W1487626875","https://openalex.org/W1496620875","https://openalex.org/W1535260388","https://openalex.org/W1587663028","https://openalex.org/W1973473808","https://openalex.org/W2025486342","https://openalex.org/W2025702744","https://openalex.org/W2027968610","https://openalex.org/W2037077125","https://openalex.org/W2059057465","https://openalex.org/W2090134545","https://openalex.org/W2098432798","https://openalex.org/W2112214730","https://openalex.org/W2122967269","https://openalex.org/W2146431819","https://openalex.org/W2798766386","https://openalex.org/W2799087070","https://openalex.org/W2802739963","https://openalex.org/W4210923851","https://openalex.org/W4235273215","https://openalex.org/W4246978400","https://openalex.org/W4297744580","https://openalex.org/W4299533062"],"related_works":["https://openalex.org/W2306553012","https://openalex.org/W4251417359","https://openalex.org/W4229993731","https://openalex.org/W2381059884","https://openalex.org/W2372756075","https://openalex.org/W1979193983","https://openalex.org/W2220405813","https://openalex.org/W1821795854","https://openalex.org/W2374111230","https://openalex.org/W3187221303"],"abstract_inverted_index":{"The":[0,38],"optimal":[1,90,127],"node":[2,34],"visitation":[3,12,98,137],"(ONV)":[4],"problem":[5,48,150],"addressed":[6],"in":[7,18,35],"this":[8,36,82,120],"paper":[9],"concerns":[10],"the":[11,29,46,75,78,85,96,114,117,123,126,136,152],"of":[13,16,25,45,77,81,88,116,119,125,159,176],"a":[14,19,22,43,50,59,133,156],"subset":[15],"nodes":[17],"stochastic":[20,51],"graph":[21],"specified":[23],"number":[24],"times,":[26],"while":[27],"minimizing":[28],"expected":[30,79,86],"visits":[31],"to":[32,84,93,103,141],"another":[33],"graph.":[37],"presented":[39],"results":[40],"first":[41],"provide":[42],"formulation":[44],"ONV":[47],"as":[49,95,135],"shortest":[52],"path":[53],"problem,":[54],"and":[55,66,168],"subsequently":[56,163],"they":[57],"develop":[58],"suboptimal":[60],"policy":[61,83,91,121,128,154],"that":[62,74,109],"is":[63,72,107,145],"computationally":[64],"tractable":[65],"asymptotically":[67],"optimal.":[68],"In":[69],"particular,":[70],"it":[71,106,144],"established":[73],"ratio":[76],"performance":[80,87,118,124],"an":[89],"converges":[92],"one,":[94],"underlying":[97],"requirements":[99,138],"are":[100,139],"scaled":[101,140],"uniformly":[102,130],"infinity.":[104,142],"Furthermore,":[105],"shown":[108,146],"under":[110],"some":[111],"stronger":[112],"assumptions,":[113],"divergence":[115],"from":[122],"remains":[129],"bounded":[131],"by":[132],"constant,":[134],"Finally,":[143],"that,":[147],"for":[148],"certain":[149],"structures,":[151],"considered":[153],"admits":[155],"closed-form":[157],"characterization":[158],"its":[160,165,169],"performance,":[161],"which":[162],"enables":[164],"optimized":[166],"parameterization":[167],"efficient":[170],"integration":[171],"into":[172],"adaptive":[173],"control":[174],"schemes":[175],"even":[177],"higher":[178],"efficiency.":[179]},"counts_by_year":[{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}