{"id":"https://openalex.org/W2964017891","doi":"https://doi.org/10.1109/cdc40024.2019.9029959","title":"Topological Approximate Dynamic Programming under Temporal Logic Constraints","display_name":"Topological Approximate Dynamic Programming under Temporal Logic Constraints","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W2964017891","doi":"https://doi.org/10.1109/cdc40024.2019.9029959","mag":"2964017891"},"language":"en","primary_location":{"id":"doi:10.1109/cdc40024.2019.9029959","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1907.10510","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Lening Li","orcid":null},"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, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, USA","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"last","author":{"id":null,"display_name":"Jie Fu","orcid":null},"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, USA"],"raw_orcid":null,"affiliations":[{"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.1093,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.38190944,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"42","issue":null,"first_page":"5330","last_page":"5337"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9988999962806702,"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.9988999962806702,"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.9860000014305115,"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/T11178","display_name":"Receptor Mechanisms and Signaling","score":0.9567999839782715,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.6970000267028809},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6524999737739563},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5813999772071838},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5533999800682068},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5156000256538391},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4832000136375427},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.42579999566078186},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4205999970436096}],"concepts":[{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6970000267028809},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6524999737739563},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5813999772071838},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5533999800682068},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5156000256538391},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5033000111579895},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4832000136375427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4417000114917755},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.42579999566078186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42489999532699585},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4205999970436096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4074999988079071},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3937999904155731},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3702999949455261},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3677999973297119},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.28130000829696655},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C2777796570","wikidata":"https://www.wikidata.org/wiki/Q2351326","display_name":"Dynamic logic (digital electronics)","level":4,"score":0.26910001039505005},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.26829999685287476},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.2599000036716461}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc40024.2019.9029959","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1907.10510","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.10510","pdf_url":"https://arxiv.org/pdf/1907.10510","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1907.10510","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.10510","pdf_url":"https://arxiv.org/pdf/1907.10510","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W120333500","https://openalex.org/W1540883472","https://openalex.org/W2059470663","https://openalex.org/W2063243689","https://openalex.org/W2081287319","https://openalex.org/W2620827312","https://openalex.org/W2890511739","https://openalex.org/W2963575966","https://openalex.org/W2963778636","https://openalex.org/W2972682655","https://openalex.org/W6638088447","https://openalex.org/W6676641049","https://openalex.org/W6683204974","https://openalex.org/W6731234973","https://openalex.org/W6731804457","https://openalex.org/W6734206676"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,47,75,104],"develop":[4],"a":[5,30,53,70,77,132],"model-free":[6,78],"approximate":[7,79],"dynamic":[8,80],"programming":[9,81],"method":[10,42,82],"for":[11,88],"stochastic":[12],"systems":[13],"modeled":[14],"as":[15],"Markov":[16],"decision":[17],"processes":[18],"to":[19,83,99],"maximize":[20],"the":[21,49,59,63,92,100,107,110,118,127],"probability":[22],"of":[23,32,55,62,109,120,126],"satisfying":[24],"high-level":[25],"system":[26],"specifications":[27],"expressed":[28],"in":[29,91,95],"subclass":[31],"temporal":[33,38,71],"logic":[34,72],"formulas-syntactically":[35],"co-safe":[36],"linear":[37],"logic.":[39],"Our":[40],"proposed":[41,111],"includes":[43],"two":[44],"steps:":[45],"First,":[46],"decompose":[48],"planning":[50,135],"problem":[51],"into":[52],"sequence":[54],"sub-problems":[56],"based":[57],"on":[58],"topological":[60],"property":[61],"task":[64,93],"automaton":[65],"which":[66],"is":[67],"translated":[68],"from":[69],"formula.":[73],"Second,":[74],"extend":[76],"solve":[84],"value":[85],"functions,":[86],"one":[87],"each":[89],"state":[90],"automaton,":[94],"an":[96],"order":[97],"reverse":[98],"causal":[101],"dependency.":[102],"Particularly,":[103],"show":[105],"that":[106],"run-time":[108],"algorithm":[112,128],"does":[113],"not":[114],"grow":[115],"exponentially":[116],"with":[117],"size":[119],"specifications.":[121],"The":[122],"correctness":[123],"and":[124],"efficiency":[125],"are":[129],"demonstrated":[130],"using":[131],"robotic":[133],"motion":[134],"example.":[136]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2019-07-30T00:00:00"}