{"id":"https://openalex.org/W2522422402","doi":"https://doi.org/10.1109/tac.2015.2508739","title":"State Classification of Time-Nonhomogeneous Markov Chains and Average Reward Optimization of Multi-Chains","display_name":"State Classification of Time-Nonhomogeneous Markov Chains and Average Reward Optimization of Multi-Chains","publication_year":2015,"publication_date":"2015-12-17","ids":{"openalex":"https://openalex.org/W2522422402","doi":"https://doi.org/10.1109/tac.2015.2508739","mag":"2522422402"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2015.2508739","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2015.2508739","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/A5100635237","display_name":"Xi\u2010Ren Cao","orcid":"https://orcid.org/0000-0001-5165-8804"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xi-Ren Cao","raw_affiliation_strings":["Department of Automation, Ministry of Education of China, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Department of Automation, Ministry of Education of China, Shanghai, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100635237"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2943,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.87111773,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"61","issue":"10","first_page":"3001","last_page":"3015"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9884999990463257,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9884999990463257,"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/T10768","display_name":"Electric Vehicles and Infrastructure","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9832000136375427,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.809255838394165},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6446259021759033},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5844513773918152},{"id":"https://openalex.org/keywords/chain","display_name":"Chain (unit)","score":0.576907217502594},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5556313991546631},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5283730030059814},{"id":"https://openalex.org/keywords/discrete-time-and-continuous-time","display_name":"Discrete time and continuous time","score":0.5193818211555481},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4957967698574066},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4760008752346039},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4757154583930969},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4583025276660919},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4206734895706177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3902786374092102},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2654406428337097},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15498101711273193},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07404616475105286}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.809255838394165},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6446259021759033},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5844513773918152},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.576907217502594},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5556313991546631},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5283730030059814},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.5193818211555481},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4957967698574066},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4760008752346039},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4757154583930969},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4583025276660919},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4206734895706177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3902786374092102},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2654406428337097},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15498101711273193},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07404616475105286},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tac.2015.2508739","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2015.2508739","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"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-160110","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-160110","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4956378139","display_name":null,"funder_award_id":"61221003","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1494899432","https://openalex.org/W1506327958","https://openalex.org/W1516360205","https://openalex.org/W1596241917","https://openalex.org/W1967486764","https://openalex.org/W1977277767","https://openalex.org/W1984520907","https://openalex.org/W2010654234","https://openalex.org/W2024900792","https://openalex.org/W2028054171","https://openalex.org/W2044312362","https://openalex.org/W2062747548","https://openalex.org/W2080857937","https://openalex.org/W2093311403","https://openalex.org/W2102162493","https://openalex.org/W2116387273","https://openalex.org/W2119567691","https://openalex.org/W2119682789","https://openalex.org/W2130503701","https://openalex.org/W2143921394","https://openalex.org/W2315152390","https://openalex.org/W2329923978","https://openalex.org/W2334782222","https://openalex.org/W2484957131","https://openalex.org/W2611866857","https://openalex.org/W4229588785","https://openalex.org/W4254814937"],"related_works":["https://openalex.org/W2742360428","https://openalex.org/W4320830217","https://openalex.org/W2060570504","https://openalex.org/W1932159282","https://openalex.org/W21651232","https://openalex.org/W4312006216","https://openalex.org/W2897181898","https://openalex.org/W2602009922","https://openalex.org/W2166339378","https://openalex.org/W3104183741"],"abstract_inverted_index":{"In":[0,22,88],"a":[1,36,46,73,82],"discrete":[2],"time":[3,61,148],"nonhomogeneous":[4],"Markov":[5],"chain":[6],"(TNHMC),":[7],"the":[8,26,33,42,54,60,86,97,108,117,131,135,153,169,183],"states":[9,34,44,52,58],"spaces,":[10],"transition":[11],"probabilities,":[12],"and":[13,45,56,96,100,110,179],"reward":[14,68,119],"functions":[15],"at":[16],"different":[17],"times":[18],"may":[19],"be":[20,39],"different.":[21],"this":[23,89],"paper,":[24,90],"with":[25,94,182],"confluencity":[27,95],"previously":[28],"introduced,":[29],"we":[30,91,105],"show":[31,92],"that":[32,93],"of":[35,48,50,66,72,116,120,123,176,185],"TNHMC":[37,133],"can":[38,106],"classified":[40],"into":[41],"branching":[43],"number":[47],"classes":[49,126],"confluent":[51,75,125],"(versus":[53],"transient":[55],"recurrent":[57],"in":[59,69,81,130,143],"homogeneous":[62],"case).":[63],"The":[64,171],"optimization":[65,181],"average":[67,118],"TNHMC's":[70],"consisting":[71,122],"single":[74],"class":[76],"(uni-chain)":[77],"have":[78],"been":[79],"addressed":[80],"previous":[83],"paper":[84],"by":[85],"author.":[87],"state":[98,177],"classification":[99,178],"under":[101],"some":[102],"bound":[103],"conditions,":[104],"obtain":[107],"necessary":[109],"sufficient":[111,136],"conditions":[112],"for":[113],"optimal":[114],"policies":[115],"TNHMCs":[121],"multiple":[124],"(multi-chains).":[127],"Just":[128],"like":[129],"uni-chain":[132],"case,":[134],"condition":[137],"does":[138],"not":[139,155],"need":[140],"to":[141,157,167],"hold":[142],"any":[144],"\u201czero":[145],"frequently":[146],"visited\u201d":[147],"sequence.":[149],"This":[150],"\u201cunder-selectivity\u201d":[151],"makes":[152],"problem":[154],"amenable":[156],"dynamic":[158],"programming.":[159],"A":[160],"direct":[161],"comparison":[162],"based":[163],"approach":[164],"is":[165],"used":[166],"prove":[168],"results.":[170],"results":[172],"enhance":[173],"our":[174],"understanding":[175],"performance":[180],"notion":[184],"confluencity.":[186]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}