{"id":"https://openalex.org/W2973074152","doi":"https://doi.org/10.23919/acc.2019.8814646","title":"Compositional planning in Markov decision processes: Temporal abstraction meets generalized logic composition","display_name":"Compositional planning in Markov decision processes: Temporal abstraction meets generalized logic composition","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2973074152","doi":"https://doi.org/10.23919/acc.2019.8814646","mag":"2973074152"},"language":"en","primary_location":{"id":"doi:10.23919/acc.2019.8814646","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2019.8814646","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/A5100362379","display_name":"Xuan Liu","orcid":"https://orcid.org/0000-0003-4598-4202"},"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":"Xuan Liu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, 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":["Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, 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.6258,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62837234,"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":"559","last_page":"566"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9966999888420105,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9958999752998352,"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.8093304634094238},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7951402068138123},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.7388017773628235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.731813907623291},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.6758379340171814},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6752470135688782},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5670836567878723},{"id":"https://openalex.org/keywords/composition","display_name":"Composition (language)","score":0.5236758589744568},{"id":"https://openalex.org/keywords/macro","display_name":"Macro","score":0.4636939764022827},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4397854208946228},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4157070517539978},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.27404066920280457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14187729358673096}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.8093304634094238},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7951402068138123},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.7388017773628235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.731813907623291},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6758379340171814},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6752470135688782},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5670836567878723},{"id":"https://openalex.org/C40231798","wikidata":"https://www.wikidata.org/wiki/Q1333743","display_name":"Composition (language)","level":2,"score":0.5236758589744568},{"id":"https://openalex.org/C166955791","wikidata":"https://www.wikidata.org/wiki/Q629579","display_name":"Macro","level":2,"score":0.4636939764022827},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4397854208946228},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4157070517539978},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27404066920280457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14187729358673096},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc.2019.8814646","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2019.8814646","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":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W59183349","https://openalex.org/W125598877","https://openalex.org/W1510264585","https://openalex.org/W1540883472","https://openalex.org/W1585861384","https://openalex.org/W1943821960","https://openalex.org/W1963873191","https://openalex.org/W2023808162","https://openalex.org/W2056358437","https://openalex.org/W2089003125","https://openalex.org/W2093916942","https://openalex.org/W2109910161","https://openalex.org/W2114768982","https://openalex.org/W2124339220","https://openalex.org/W2130535800","https://openalex.org/W2158548602","https://openalex.org/W2593044849","https://openalex.org/W2912453235","https://openalex.org/W2963262099","https://openalex.org/W2963868084","https://openalex.org/W2964131705","https://openalex.org/W2964227312","https://openalex.org/W4242441073"],"related_works":["https://openalex.org/W2124110813","https://openalex.org/W3021103820","https://openalex.org/W2763487042","https://openalex.org/W2521108391","https://openalex.org/W1532447905","https://openalex.org/W2031188261","https://openalex.org/W4285022830","https://openalex.org/W4232446061","https://openalex.org/W2077520193","https://openalex.org/W1513400763"],"abstract_inverted_index":{"In":[0,26,47],"hierarchical":[1,38],"planning":[2,11,39,84,107,146],"for":[3,40,65,112,119],"Markov":[4],"decision":[5],"processes":[6],"(MDPs),":[7],"temporal":[8,44,132],"abstraction":[9],"allows":[10],"with":[12,85,108,148],"macro-actions":[13],"that":[14],"take":[15],"place":[16],"at":[17],"different":[18],"time":[19],"scale":[20],"in":[21,83,127,144],"form":[22],"of":[23,56,75,117,123,130,140],"sequential":[24,50],"composition.":[25],"this":[27],"paper,":[28],"we":[29,52],"propose":[30],"a":[31,54,68,77,96,149],"novel":[32],"approach":[33],"to":[34,49,101],"compositional":[35],"reasoning":[36],"and":[37,67,114,138,152],"MDPs":[41],"under":[42],"co-safe":[43,131],"logic":[45,61,73],"constraints.":[46],"addition":[48],"composition,":[51],"introduce":[53],"composition":[55],"policies":[57,104,111],"based":[58],"on":[59],"generalized":[60],"composition:":[62],"Given":[63],"sub-policies":[64],"sub-tasks":[66],"new":[69],"task":[70,154],"expressed":[71],"as":[72],"compositions":[74,116],"subtasks,":[76],"semi-optimal":[78],"policy,":[79],"which":[80],"is":[81,99],"optimal":[82,103],"only":[86],"sub-policies,":[87,118],"can":[88],"be":[89],"obtained":[90],"by":[91,106],"simply":[92],"composing":[93],"sub-polices.":[94],"Thus,":[95],"synthesis":[97],"algorithm":[98],"developed":[100],"compute":[102],"efficiently":[105],"primitive":[109],"actions,":[110],"sub-tasks,":[113],"the":[115,121,128,136,141],"maximizing":[120],"probability":[122],"satisfying":[124],"constraints":[125],"specified":[126],"fragment":[129],"logic.":[133],"We":[134],"demonstrate":[135],"correctness":[137],"efficiency":[139],"proposed":[142],"method":[143],"stochastic":[145],"examples":[147],"single":[150],"agent":[151],"multiple":[153],"specifications.":[155]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}