{"id":"https://openalex.org/W2120107478","doi":"https://doi.org/10.1109/acc.2006.1657431","title":"On optimal control of Markov chains with safety constraint","display_name":"On optimal control of Markov chains with safety constraint","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2120107478","doi":"https://doi.org/10.1109/acc.2006.1657431","mag":"2120107478"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2006.1657431","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2006.1657431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 American Control Conference","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/A5068793144","display_name":"Shun\u2010Pin Hsu","orcid":"https://orcid.org/0000-0003-1008-9099"},"institutions":[{"id":"https://openalex.org/I193365169","display_name":"National Chi Nan University","ror":"https://ror.org/03ha6v181","country_code":"TW","type":"education","lineage":["https://openalex.org/I193365169"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shun-Pin Hsu","raw_affiliation_strings":["Electrical Engineering, National Chi Nan University, Nantou, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering, National Chi Nan University, Nantou, Taiwan","institution_ids":["https://openalex.org/I193365169"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022435379","display_name":"Ari Arapostathis","orcid":"https://orcid.org/0000-0003-2207-357X"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Arapostathis","raw_affiliation_strings":["Electrical and Computer Engineering, University of Texas, Austin, Austin, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, University of Texas, Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044031773","display_name":"Ratnesh Kumar","orcid":"https://orcid.org/0000-0003-3974-5790"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Kumar","raw_affiliation_strings":["Electrical and Computer Engineering, Iowa State University, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"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":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.17267118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"37","issue":null,"first_page":"6 pp.","last_page":"6 pp."},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6515969634056091},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6079022884368896},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5115493535995483},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5081861019134521},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46599188446998596},{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.4614182412624359},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4457017779350281},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4439353942871094},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.42986804246902466},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.42669668793678284},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4256861209869385},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.39009571075439453}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6515969634056091},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6079022884368896},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5115493535995483},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5081861019134521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46599188446998596},{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.4614182412624359},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4457017779350281},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4439353942871094},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.42986804246902466},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.42669668793678284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4256861209869385},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.39009571075439453},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/acc.2006.1657431","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2006.1657431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 American Control Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1031.6967","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1031.6967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://home.engineering.iastate.edu/%7Erkumar/PUBS/acc06-psafe.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1497487247","https://openalex.org/W1518931405","https://openalex.org/W1535136082","https://openalex.org/W2001139238","https://openalex.org/W2125422572","https://openalex.org/W2133626316","https://openalex.org/W2149500945","https://openalex.org/W2155397423","https://openalex.org/W2159089602","https://openalex.org/W2165469059"],"related_works":["https://openalex.org/W2155858901","https://openalex.org/W2491194410","https://openalex.org/W4382519099","https://openalex.org/W1515727993","https://openalex.org/W2037179686","https://openalex.org/W2802398440","https://openalex.org/W2085074295","https://openalex.org/W4236808165","https://openalex.org/W1523409810","https://openalex.org/W1999896854"],"abstract_inverted_index":{"We":[0,101],"study":[1],"the":[2,26,49,58,82,85,93,119,132,139,146,162,168,175,189],"control":[3,75],"of":[4,29,48,84,164],"completely":[5],"observed":[6],"Markov":[7],"chains":[8,177],"with":[9,20],"safety":[10,23,32,83],"bounds":[11,33,44],"as":[12,36],"introduced":[13],"by":[14],"Arapostathis":[15],"et":[16],"al":[17],"(2005),":[18],"but":[19],"more":[21],"general":[22],"constraints":[24],"and":[25,42,67,91],"added":[27],"requirement":[28],"optimality.":[30],"The":[31],"were":[34],"specified":[35],"unit-interval":[37],"valued":[38],"vector":[39],"pairs":[40],"(lower":[41],"upper":[43,159],"for":[45,107,161,167,174],"each":[46],"component":[47],"state":[50],"probability":[51],"distribution).":[52],"In":[53,172],"this":[54],"paper":[55],"we":[56,124,178],"generalize":[57],"constraint":[59],"set":[60,66,136],"to":[61,71,130,156,170,187],"be":[62],"any":[63],"linear":[64,104],"convex":[65],"present":[68,125],"a":[69,73,103,110,115,126],"way":[70],"compute":[72,131,188],"stationary":[74],"policy":[76,121],"which":[77],"is":[78,88,97,122,185],"safe":[79,111,135],"(i.e.,":[80],"maintains":[81],"distribution":[86,141],"that":[87,118,145,180],"initially":[89],"safe)":[90],"at":[92,181],"same":[94],"time":[95],"it":[96],"long-run":[98],"average":[99],"optimal.":[100],"propose":[102],"programming":[105],"formulation":[106],"computing":[108],"such":[109],"optimal":[112,120],"policy.":[113],"Under":[114],"simplifying":[116],"assumption":[117],"ergodic,":[123],"finitely-terminating":[127],"iterative":[128],"algorithm":[129,169],"maximal":[133],"invariant":[134],"(MISS)":[137],"where":[138],"initial":[140],"must":[142],"lie":[143],"so":[144],"future":[147],"distributions":[148],"always":[149],"remain":[150],"safe.":[151],"Our":[152],"approach":[153],"allows":[154],"us":[155],"calculate":[157],"an":[158],"bound":[160],"number":[163],"iterations":[165],"needed":[166,186],"terminate.":[171],"particular,":[173],"two-state":[176],"show":[179],"most":[182],"one":[183],"iteration":[184],"MISS.":[190]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}