{"id":"https://openalex.org/W3021964239","doi":"https://doi.org/10.1177/0278364920913922","title":"STyLuS<sup>*</sup>: A Temporal Logic Optimal Control Synthesis Algorithm for Large-Scale Multi-Robot Systems","display_name":"STyLuS<sup>*</sup>: A Temporal Logic Optimal Control Synthesis Algorithm for Large-Scale Multi-Robot Systems","publication_year":2020,"publication_date":"2020-04-29","ids":{"openalex":"https://openalex.org/W3021964239","doi":"https://doi.org/10.1177/0278364920913922","mag":"3021964239"},"language":"en","primary_location":{"id":"doi:10.1177/0278364920913922","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364920913922","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"},"type":"article","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/A5014874021","display_name":"Yiannis Kantaros","orcid":"https://orcid.org/0000-0002-0257-7378"},"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":true,"raw_author_name":"Yiannis Kantaros","raw_affiliation_strings":["Department of Mechanical Engineering and Materials Science, Duke University, Durham, NC, USA"],"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"],"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":2,"corresponding_author_ids":["https://openalex.org/A5014874021"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":8.7242,"has_fulltext":false,"cited_by_count":115,"citation_normalized_percentile":{"value":0.98150186,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"39","issue":"7","first_page":"812","last_page":"836"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9995999932289124,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/temporal-logic","display_name":"Temporal logic","score":0.6228438019752502},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5997944474220276},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5948978662490845},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5520442724227905},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5476207137107849},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5049389004707336},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4958585202693939},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.44884005188941956},{"id":"https://openalex.org/keywords/hybrid-automaton","display_name":"Hybrid automaton","score":0.43018242716789246},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.4292653501033783},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42460933327674866},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4184116721153259},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38135120272636414},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31148332357406616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2447446584701538},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22480756044387817}],"concepts":[{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6228438019752502},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5997944474220276},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5948978662490845},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5520442724227905},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5476207137107849},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5049389004707336},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4958585202693939},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.44884005188941956},{"id":"https://openalex.org/C2776028153","wikidata":"https://www.wikidata.org/wiki/Q5953179","display_name":"Hybrid automaton","level":3,"score":0.43018242716789246},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4292653501033783},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42460933327674866},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4184116721153259},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38135120272636414},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31148332357406616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2447446584701538},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22480756044387817},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0278364920913922","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364920913922","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G5156775147","display_name":null,"funder_award_id":"#N000141812374","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W68069235","https://openalex.org/W233122475","https://openalex.org/W1489391022","https://openalex.org/W1498432697","https://openalex.org/W1499948104","https://openalex.org/W1566405224","https://openalex.org/W1625390266","https://openalex.org/W1864112212","https://openalex.org/W1970269621","https://openalex.org/W1971086298","https://openalex.org/W2000117665","https://openalex.org/W2004620590","https://openalex.org/W2006625750","https://openalex.org/W2007533680","https://openalex.org/W2018380024","https://openalex.org/W2038131922","https://openalex.org/W2060799405","https://openalex.org/W2073548775","https://openalex.org/W2077245982","https://openalex.org/W2077578897","https://openalex.org/W2089003125","https://openalex.org/W2101043416","https://openalex.org/W2116647221","https://openalex.org/W2117927826","https://openalex.org/W2126316555","https://openalex.org/W2129226651","https://openalex.org/W2141789581","https://openalex.org/W2146257001","https://openalex.org/W2151958719","https://openalex.org/W2153166592","https://openalex.org/W2157834152","https://openalex.org/W2163941698","https://openalex.org/W2165744968","https://openalex.org/W2290403162","https://openalex.org/W2554009248","https://openalex.org/W2607319504","https://openalex.org/W2623293810","https://openalex.org/W2736666525","https://openalex.org/W2791580684","https://openalex.org/W2798923485","https://openalex.org/W2804655496","https://openalex.org/W2913190903","https://openalex.org/W2913325211","https://openalex.org/W2963596362","https://openalex.org/W3149952516","https://openalex.org/W4206318793","https://openalex.org/W4230965787"],"related_works":["https://openalex.org/W2124110813","https://openalex.org/W3021103820","https://openalex.org/W2763487042","https://openalex.org/W2031188261","https://openalex.org/W4232446061","https://openalex.org/W4285022830","https://openalex.org/W2020883449","https://openalex.org/W3035590440","https://openalex.org/W2091682553","https://openalex.org/W2134312936"],"abstract_inverted_index":{"This":[0,130,180],"article":[1],"proposes":[2],"a":[3,55,69],"new":[4],"highly":[5],"scalable":[6],"and":[7,83,90,172,175],"asymptotically":[8,173],"optimal":[9,24,135,153,174,193,209],"control":[10,154,194],"synthesis":[11,155,195],"algorithm":[12,73],"from":[13,138],"linear":[14],"temporal":[15,34,45],"logic":[16,46],"specifications,":[17],"called":[18],"[Formula:":[19,166,204],"see":[20,167,205],"text]":[21,168,206],"for":[22,191,212],"large-Scale":[23],"Temporal":[25],"Logic":[26],"Synthesis,":[27],"that":[28,74,78,111,120,151,165,185,201,203],"is":[29,112,169,181,218],"designed":[30],"to":[31,54,122,126,133],"solve":[32],"complex":[33],"planning":[35,42],"problems":[36],"in":[37,107,116],"large-scale":[38],"multi-robot":[39,215],"systems.":[40],"Existing":[41],"approaches":[43],"with":[44,141],"specifications":[47],"rely":[48],"on":[49],"graph":[50,95],"search":[51,96],"techniques":[52],"applied":[53],"product":[56,88,139],"automaton":[57,89,119],"constructed":[58],"among":[59],"the":[60,80,86,108,117,123,127,182],"robots.":[61],"In":[62],"our":[63,101],"previous":[64,102],"work,":[65],"we":[66,99],"have":[67],"proposed":[68],"more":[70,147],"tractable":[71],"sampling-based":[72,192],"builds":[75],"incrementally":[76],"trees":[77],"approximate":[79],"state":[81],"space":[82],"transitions":[84,115],"of":[85,143,145],"synchronous":[87],"does":[91],"not":[92],"require":[93],"sophisticated":[94],"techniques.":[97],"Here,":[98],"extend":[100],"work":[103],"by":[104,114],"introducing":[105],"bias":[106],"sampling":[109],"process":[110],"guided":[113],"B\u00fcchi":[118],"belong":[121],"shortest":[124],"path":[125],"accepting":[128],"states.":[129],"allows":[131],"us":[132],"synthesize":[134,208],"motion":[136,210],"plans":[137,211],"automata":[140],"hundreds":[142],"orders":[144],"magnitude":[146],"states":[148],"than":[149],"those":[150],"existing":[152],"methods":[156],"or":[157],"off-the-shelf":[158],"model":[159],"checkers":[160],"can":[161,207],"manipulate.":[162],"We":[163,197],"show":[164,202],"probabilistically":[170],"complete":[171],"has":[176],"exponential":[177],"convergence":[178,186],"rate.":[179],"first":[183],"time":[184],"rate":[187],"results":[188,200],"are":[189],"provided":[190],"methods.":[196,222],"provide":[198],"simulation":[199],"very":[213],"large":[214],"systems,":[216],"which":[217],"impossible":[219],"using":[220],"state-of-the-art":[221]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":25},{"year":2024,"cited_by_count":24},{"year":2023,"cited_by_count":19},{"year":2022,"cited_by_count":18},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2}],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}