{"id":"https://openalex.org/W3011955568","doi":"https://doi.org/10.1109/cdc40024.2019.9030087","title":"Transfer Planning for Temporal Logic Tasks","display_name":"Transfer Planning for Temporal Logic Tasks","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3011955568","doi":"https://doi.org/10.1109/cdc40024.2019.9030087","mag":"3011955568"},"language":"en","primary_location":{"id":"doi:10.1109/cdc40024.2019.9030087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9030087","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":["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/A5009405571","display_name":"Xusheng Luo","orcid":"https://orcid.org/0000-0003-4342-7234"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xusheng Luo","raw_affiliation_strings":["Department of Mechanical Engineering and Materials Science, Duke University, Durham, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering and Materials Science, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080808780","display_name":"Michael M. Zavlanos","orcid":"https://orcid.org/0000-0003-1748-8228"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael M. Zavlanos","raw_affiliation_strings":["Department of Mechanical Engineering and Materials Science, Duke University, Durham, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering and Materials Science, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":0.328,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.63758374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"94","issue":null,"first_page":"5306","last_page":"5311"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9994999766349792,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9994999766349792,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.693318247795105},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4412805438041687},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15016323328018188}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.693318247795105},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4412805438041687},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15016323328018188}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc40024.2019.9030087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9030087","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1230237032","https://openalex.org/W1498432697","https://openalex.org/W2004620590","https://openalex.org/W2073548775","https://openalex.org/W2091682553","https://openalex.org/W2117927826","https://openalex.org/W2141088850","https://openalex.org/W2165698076","https://openalex.org/W2290403162","https://openalex.org/W2607319504","https://openalex.org/W2784322399","https://openalex.org/W2804948070","https://openalex.org/W2913325211","https://openalex.org/W2963117388","https://openalex.org/W6627847364","https://openalex.org/W6739554287","https://openalex.org/W6752298494"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3],"optimal":[4,106],"control":[5,107],"synthesis":[6,108],"algorithm":[7,150],"for":[8,67],"Linear":[9],"Temporal":[10],"Logic":[11],"(LTL)":[12],"tasks":[13,21,32,69],"that":[14,70,110,127,129,147],"exploits":[15],"experience":[16,92,118],"from":[17],"solving":[18],"similar":[19],"LTL":[20,31,95],"before.":[22,75],"The":[23],"key":[24],"idea":[25],"is":[26,79,151],"to":[27,44,63,90,99,111,119,140],"appropriately":[28],"decompose":[29],"complex":[30],"into":[33],"simpler":[34],"subtasks":[35],"and":[36,59,86,105,154],"define":[37],"sets":[38],"of":[39,56,138],"skills,":[40],"or":[41],"plans,":[42],"needed":[43],"solve":[45,120],"these":[46,134],"subtasks.":[47],"These":[48],"skills":[49,58],"can":[50,60,87],"be":[51,61,88],"stored":[52],"in":[53,103,136],"a":[54,100],"library":[55],"reusable":[57],"used":[62,89],"quickly":[64],"synthesize":[65],"plans":[66],"new":[68,101],"have":[71],"not":[72,115],"been":[73],"encountered":[74],"Our":[76],"proposed":[77,149],"method":[78],"inspired":[80],"by":[81],"literature":[82],"on":[83],"multi-task":[84],"learning":[85],"transfer":[91],"between":[93],"different":[94],"tasks.":[96],"It":[97],"amounts":[98],"paradigm":[102],"model-checking":[104],"methods":[109,135],"this":[112],"date":[113],"do":[114],"use":[116],"prior":[117],"planning":[121],"problems.":[122],"We":[123,144],"present":[124],"numerical":[125],"experiments":[126],"show":[128,146],"our":[130,148],"approach":[131],"generally":[132],"outperforms":[133],"terms":[137],"time":[139],"generate":[141],"feasible":[142],"plans.":[143],"also":[145],"probabilistically":[152],"complete":[153],"asymptotically":[155],"optimal.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"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"}