{"id":"https://openalex.org/W2103935902","doi":null,"title":"Solving Structured Continuous-Time Markov Decision Processes","display_name":"Solving Structured Continuous-Time Markov Decision Processes","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2103935902","mag":"2103935902"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.101.8942","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.8942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://isaim2008.unl.edu/PAPERS/TechnicalProgram/ISAIM2008_0006_668ef1cf8fb11f5fb1223aed83c3adcc.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5068013322","display_name":"Kin Fai Kan","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kin Fai Kan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5091230938","display_name":"Christian Robert Shelton","orcid":"https://orcid.org/0000-0001-6698-7838","observed_orcids":["https://orcid.org/0000-0001-6698-7838"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christian R. Shelton","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6698-7838","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.843,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.74563489,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9682999849319458,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9682999849319458,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.003599999938160181,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.002899999963119626,"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/continuous-time-markov-decision-processes","display_name":"continuous-time Markov decision processes","score":0.9789999723434448},{"id":"https://openalex.org/keywords/continuous-time-bayesian-networks","display_name":"continuous time Bayesian networks","score":0.8809999823570251},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.8220000267028809},{"id":"https://openalex.org/keywords/approximation-bounds","display_name":"approximation bounds","score":0.8429999947547913},{"id":"https://openalex.org/keywords/scalability","display_name":"scalability","score":0.7760000228881836}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6680141091346741},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5830215811729431},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5755966305732727},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5253362655639648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5145592093467712},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4628552496433258},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.4612810015678406},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4589179456233978},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4234943687915802},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.41892626881599426},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.41704726219177246},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35674357414245605},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10878857970237732},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08322736620903015},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.101.8942","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.8942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://isaim2008.unl.edu/PAPERS/TechnicalProgram/ISAIM2008_0006_668ef1cf8fb11f5fb1223aed83c3adcc.pdf","raw_type":"text"},{"id":"mag:2103935902","doi":null,"is_oa":false,"landing_page_url":"http://isaim2008.unl.edu/PAPERS/TechnicalProgram/ISAIM2008_0006_668ef1cf8fb11f5fb1223aed83c3adcc.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306514445","display_name":"ISAIM","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"ISAIM","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W17127720","https://openalex.org/W39325421","https://openalex.org/W1503402212","https://openalex.org/W1543675445","https://openalex.org/W1563709661","https://openalex.org/W1588316674","https://openalex.org/W1745373831","https://openalex.org/W1851802298","https://openalex.org/W2020294948","https://openalex.org/W2132096648","https://openalex.org/W2145538960","https://openalex.org/W2149385746","https://openalex.org/W2163645888","https://openalex.org/W2169982856","https://openalex.org/W2334782222","https://openalex.org/W2951402568"],"related_works":["https://openalex.org/W7056168379","https://openalex.org/W1603307620","https://openalex.org/W7100515413","https://openalex.org/W7099948991","https://openalex.org/W7099052144","https://openalex.org/W2143031849","https://openalex.org/W2315710044","https://openalex.org/W3005767492","https://openalex.org/W2615697727","https://openalex.org/W1976165120"],"abstract_inverted_index":{"We":[0,11,48,62,85],"present":[1],"an":[2],"approach":[3],"to":[4,57,82],"solving":[5],"structured":[6],"continuous-time":[7,53],"Markov":[8,60],"decision":[9],"processes.":[10],"approximate":[12],"the":[13,14,33,41,46,50,59,67,70,75,78,90,93,104],"optimal":[15],"value":[16],"function":[17],"by":[18,65],"a":[19,25],"compact":[20],"linear":[21,26],"form,":[22],"resulting":[23],"in":[24,45,77],"program.":[27],"The":[28],"main":[29],"difficulty":[30],"arises":[31],"from":[32],"number":[34,42,79],"of":[35,43,52,69,80,92,100,108],"constraints":[36,81],"that":[37,64],"grow":[38],"exponentially":[39],"with":[40],"variables":[44],"system.":[47],"exploit":[49],"representation":[51],"Bayesian":[54],"networks":[55],"(CTBNs)":[56],"describe":[58],"process.":[61],"show":[63],"exploiting":[66],"structure":[68],"CTBN,":[71],"we":[72],"can":[73],"reduce":[74],"growth":[76],"be":[83],"polynomial.":[84],"provide":[86],"theoretic":[87],"bounds":[88],"on":[89,98],"quality":[91],"approximation":[94],"and":[95,106],"experimental":[96],"results":[97],"problems":[99],"different":[101],"sizes,":[102],"demonstrating":[103],"scalability":[105],"fidelity":[107],"our":[109],"approach.":[110],"1":[111]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2016-06-24T00:00:00"}