{"id":"https://openalex.org/W2972682655","doi":"https://doi.org/10.23919/acc.2019.8815215","title":"Approximate Dynamic Programming with Probabilistic Temporal Logic Constraints","display_name":"Approximate Dynamic Programming with Probabilistic Temporal Logic Constraints","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2972682655","doi":"https://doi.org/10.23919/acc.2019.8815215","mag":"2972682655"},"language":"en","primary_location":{"id":"doi:10.23919/acc.2019.8815215","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2019.8815215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 American Control Conference (ACC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5014329552","display_name":"Lening Li","orcid":"https://orcid.org/0000-0002-8321-1254"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lening Li","raw_affiliation_strings":["Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, 01609, USA","Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, 01609, USA","institution_ids":["https://openalex.org/I107077323"]},{"raw_affiliation_string":"Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, USA","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046206794","display_name":"Jie Fu","orcid":"https://orcid.org/0000-0002-4470-2827"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jie Fu","raw_affiliation_strings":["Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, 01609, USA","Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, 01609, USA","institution_ids":["https://openalex.org/I107077323"]},{"raw_affiliation_string":"Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, USA","institution_ids":["https://openalex.org/I107077323"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I107077323"],"apc_list":null,"apc_paid":null,"fwci":0.2187,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.52470256,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1696","last_page":"1703"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9986000061035156,"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.9986000061035156,"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/T10142","display_name":"Formal Methods in Verification","score":0.9918000102043152,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9466000199317932,"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/markov-decision-process","display_name":"Markov decision process","score":0.7869527339935303},{"id":"https://openalex.org/keywords/probabilistic-ctl","display_name":"Probabilistic CTL","score":0.710332453250885},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6920260190963745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5997955799102783},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5931271910667419},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5764774680137634},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5484099388122559},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.5279185771942139},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47824493050575256},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4765758514404297},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.4625154733657837},{"id":"https://openalex.org/keywords/softmax-function","display_name":"Softmax function","score":0.44717949628829956},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.42572811245918274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3119858503341675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3073671758174896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2568095922470093},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.1941983699798584},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13846951723098755}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7869527339935303},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.710332453250885},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6920260190963745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5997955799102783},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5931271910667419},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5764774680137634},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5484099388122559},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.5279185771942139},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47824493050575256},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4765758514404297},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.4625154733657837},{"id":"https://openalex.org/C188441871","wikidata":"https://www.wikidata.org/wiki/Q7554146","display_name":"Softmax function","level":3,"score":0.44717949628829956},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.42572811245918274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3119858503341675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3073671758174896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2568095922470093},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.1941983699798584},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13846951723098755},{"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/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc.2019.8815215","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2019.8815215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1506085041","https://openalex.org/W1516256348","https://openalex.org/W1568495775","https://openalex.org/W1582865675","https://openalex.org/W1599873380","https://openalex.org/W1745373831","https://openalex.org/W2059470663","https://openalex.org/W2078151802","https://openalex.org/W2098432798","https://openalex.org/W2119567691","https://openalex.org/W2121863487","https://openalex.org/W2124339220","https://openalex.org/W2125408844","https://openalex.org/W2158479468","https://openalex.org/W2169250070","https://openalex.org/W2222789563","https://openalex.org/W2400458653","https://openalex.org/W2503658399","https://openalex.org/W2570542232","https://openalex.org/W2598790804","https://openalex.org/W2620827312","https://openalex.org/W2963082979","https://openalex.org/W2963714625","https://openalex.org/W2963778636","https://openalex.org/W3162902207","https://openalex.org/W4214717370","https://openalex.org/W4254313632","https://openalex.org/W4301422153","https://openalex.org/W6687063787"],"related_works":["https://openalex.org/W3107204728","https://openalex.org/W4287591324","https://openalex.org/W3108503355","https://openalex.org/W4226420367","https://openalex.org/W2138707849","https://openalex.org/W2532582634","https://openalex.org/W3005864166","https://openalex.org/W1981889059","https://openalex.org/W1967294943","https://openalex.org/W2144159228"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,45,79,110],"develop":[4],"approximate":[5,85],"dynamic":[6,73],"programming":[7,74],"methods":[8],"for":[9,92],"stochastic":[10,65],"systems":[11],"modeled":[12],"as":[13],"Markov":[14],"Decision":[15],"Processes,":[16],"given":[17,130],"both":[18],"soft":[19],"performance":[20],"criteria":[21],"and":[22,72,134,141],"hard":[23],"constraints":[24,57,103],"in":[25,64],"a":[26,50,81,120],"class":[27,51],"of":[28,41,52,117,143],"probabilistic":[29],"temporal":[30],"logic":[31],"called":[32],"Probabilistic":[33],"Computation":[34],"Tree":[35],"Logic":[36],"(PCTL).":[37],"Our":[38],"approach":[39],"consists":[40],"two":[42],"steps:":[43],"First,":[44],"show":[46,111],"how":[47],"to":[48,89],"transform":[49],"PCTL":[53,105],"formulas":[54],"into":[55],"chance":[56],"that":[58,104,112],"can":[59,123],"be":[60,124],"enforced":[61],"during":[62],"planning":[63,151],"systems.":[66],"Second,":[67],"by":[68,113,131],"integrating":[69],"randomized":[70],"optimization":[71],"with":[75],"softmax":[76],"Bellman":[77],"operator,":[78],"devise":[80],"novel":[82],"trajectory":[83],"sampling-based":[84],"value":[86,98,137],"iteration":[87],"method":[88,145],"iteratively":[90],"solve":[91],"an":[93],"upper":[94,128],"bound":[95,122,129],"on":[96],"the":[97,102,114,118,127,132,135,144],"function":[99],"while":[100],"ensuring":[101],"specifications":[106],"are":[107,146],"satisfied.":[108],"Particularly,":[109],"on-policy":[115],"sampling":[116],"trajectories,":[119],"tight":[121],"achieved":[125],"between":[126],"approximation":[133],"true":[136],"function.":[138],"The":[139],"correctness":[140],"efficiency":[142],"demonstrated":[147],"using":[148],"robotic":[149],"motion":[150],"examples.":[152]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}