{"id":"https://openalex.org/W3119785025","doi":"https://doi.org/10.1109/cdc42340.2020.9304153","title":"Secure-by-Construction Optimal Path Planning for Linear Temporal Logic Tasks","display_name":"Secure-by-Construction Optimal Path Planning for Linear Temporal Logic Tasks","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3119785025","doi":"https://doi.org/10.1109/cdc42340.2020.9304153","mag":"3119785025"},"language":"en","primary_location":{"id":"doi:10.1109/cdc42340.2020.9304153","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9304153","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE 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/A5086158718","display_name":"Shuo Yang","orcid":"https://orcid.org/0000-0003-1847-6413"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuo Yang","raw_affiliation_strings":["Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034304769","display_name":"Xiang Yin","orcid":"https://orcid.org/0000-0003-1944-1570"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiang Yin","raw_affiliation_strings":["Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041126305","display_name":"Shaoyuan Li","orcid":"https://orcid.org/0000-0003-3427-2912"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shaoyuan Li","raw_affiliation_strings":["Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030109984","display_name":"Majid Zamani","orcid":"https://orcid.org/0000-0001-6608-3708"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]},{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"Majid Zamani","raw_affiliation_strings":["Ludwig Maximilian University of Munich, Munich, Germany","University of Colorado Boulder, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig Maximilian University of Munich, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]},{"raw_affiliation_string":"University of Colorado Boulder, CO, USA","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4460","last_page":"4466"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T12029","display_name":"DNA and Biological Computing","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7351890802383423},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.7211287617683411},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6489611864089966},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6419049501419067},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.617819607257843},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5038129687309265},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4960096776485443},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4537721574306488},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43594303727149963},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42969927191734314},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40847769379615784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3823733925819397},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26205360889434814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2249985933303833}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7351890802383423},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.7211287617683411},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6489611864089966},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6419049501419067},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.617819607257843},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5038129687309265},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4960096776485443},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4537721574306488},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43594303727149963},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42969927191734314},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40847769379615784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3823733925819397},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26205360889434814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2249985933303833},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc42340.2020.9304153","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9304153","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5400000214576721}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1498432697","https://openalex.org/W1975134293","https://openalex.org/W2004398490","https://openalex.org/W2019881090","https://openalex.org/W2059470663","https://openalex.org/W2061598829","https://openalex.org/W2064886960","https://openalex.org/W2077245982","https://openalex.org/W2077578897","https://openalex.org/W2089003125","https://openalex.org/W2117927826","https://openalex.org/W2157807654","https://openalex.org/W2497816991","https://openalex.org/W2594675090","https://openalex.org/W2601738991","https://openalex.org/W2624912704","https://openalex.org/W2739094621","https://openalex.org/W2768035641","https://openalex.org/W2784743256","https://openalex.org/W2883844343","https://openalex.org/W2901162916","https://openalex.org/W2945445283","https://openalex.org/W2957340013","https://openalex.org/W2963117388","https://openalex.org/W2964335063","https://openalex.org/W2967236043","https://openalex.org/W2990991612","https://openalex.org/W2994583186","https://openalex.org/W2999072249","https://openalex.org/W3033138220","https://openalex.org/W3089490871","https://openalex.org/W3106338013","https://openalex.org/W4250728693","https://openalex.org/W6655221434"],"related_works":["https://openalex.org/W3049557657","https://openalex.org/W3150915502","https://openalex.org/W2807251790","https://openalex.org/W2111158727","https://openalex.org/W1809059965","https://openalex.org/W2024668666","https://openalex.org/W3035590440","https://openalex.org/W2153551293","https://openalex.org/W2912520094","https://openalex.org/W2362494442"],"abstract_inverted_index":{"In":[0],"this":[1,79],"paper,":[2],"we":[3,153],"investigate":[4],"the":[5,31,35,55,61,86,89,102,108,123,126,129,133,139,146,149],"problem":[6,112],"of":[7,34,88,99,125,138,148],"planning":[8,111,141,161],"an":[9,39],"optimal":[10],"infinite":[11],"path":[12,110],"for":[13],"a":[14,19,46,66,71,97,158],"single":[15],"robot":[16,62,160],"to":[17,77],"achieve":[18],"linear":[20],"temporal":[21],"logic":[22],"(LTL)":[23],"task":[24],"with":[25],"security":[26,51],"guarantee.":[27],"We":[28,69,105],"assume":[29],"that":[30,54,60,95,107],"external":[32],"behavior":[33],"robot,":[36],"specified":[37],"by":[38,45,157],"output":[40],"function,":[41],"can":[42,113],"be":[43,114],"accessed":[44],"passive":[47],"intruder":[48,56],"(eavesdropper).":[49],"The":[50,136],"constraint":[52],"requires":[53],"should":[57],"never":[58],"infer":[59],"was":[63],"started":[64],"from":[65],"secret":[67],"location.":[68],"provide":[70],"sound":[72],"and":[73,128],"complete":[74],"algorithmic":[75],"procedure":[76],"solve":[78],"problem.":[80],"Our":[81],"approach":[82],"is":[83,143],"based":[84,117],"on":[85,118],"construction":[87],"twin":[90],"weighted":[91],"transition":[92],"systems":[93],"(twin-WTS)":[94],"tracks":[96],"pair":[98],"paths":[100],"having":[101],"same":[103],"observation.":[104],"show":[106],"security-aware":[109],"effectively":[115],"solved":[116],"graph":[119],"search":[120],"techniques":[121],"in":[122,145],"product":[124],"twin-WTS":[127],"B\u00fcchi":[130],"automaton":[131],"representing":[132],"LTL":[134],"formula.":[135],"complexity":[137],"proposed":[140],"algorithm":[142,156],"polynomial":[144],"size":[147],"system":[150],"model.":[151],"Finally,":[152],"illustrate":[154],"our":[155],"simple":[159],"example.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}