{"id":"https://openalex.org/W7162333589","doi":"https://doi.org/10.48550/arxiv.2605.23240","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","display_name":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","publication_year":2026,"publication_date":"2026-05-22","ids":{"openalex":"https://openalex.org/W7162333589","doi":"https://doi.org/10.48550/arxiv.2605.23240"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.23240","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.23240","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.23240","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136959728","display_name":"Yu Chen","orcid":"https://orcid.org/0009-0004-1018-5819"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Yu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132671345","display_name":"Ancheng Hou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hou, Ancheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136979573","display_name":"Mingyang Feng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Feng, Mingyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136903935","display_name":"Xiao Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Xiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136962070","display_name":"Xiang Yin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yin, Xiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.5573999881744385,"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.5573999881744385,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.3271999955177307,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.014600000344216824,"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/regular-polygon","display_name":"Regular polygon","score":0.49079999327659607},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4431999921798706},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4359000027179718},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4090000092983246},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.40299999713897705},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.3995000123977661},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.39640000462532043},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.37940001487731934},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3774999976158142},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.3440999984741211}],"concepts":[{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.49079999327659607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48249998688697815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48100000619888306},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4431999921798706},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4359000027179718},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4090000092983246},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.40299999713897705},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.3995000123977661},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.39640000462532043},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.37940001487731934},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3774999976158142},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.3440999984741211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34209999442100525},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.3375000059604645},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.3292999863624573},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.32670000195503235},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.32269999384880066},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31949999928474426},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.3174000084400177},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.3158999979496002},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.30090001225471497},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2827000021934509},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28110000491142273},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2551000118255615},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.23240","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.23240","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.23240","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.23240","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6726589798927307,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"continuous-time":[3],"motion":[4,30],"planning":[5],"under":[6],"Signal":[7],"Temporal":[8],"Logic":[9],"(STL)":[10],"specifications.":[11],"The":[12],"goal":[13],"is":[14,53,61,95],"to":[15,72],"generate":[16],"smooth":[17,108,208],"robot":[18,193],"trajectories":[19],"that":[20,40,196],"satisfy":[21],"high-level":[22],"logical":[23],"and":[24,82,117,128,139,153,172,186,206],"timing":[25],"requirements":[26],"while":[27],"respecting":[28],"low-level":[29],"constraints.":[31],"To":[32],"this":[33,87],"end,":[34],"we":[35],"propose":[36],"an":[37,165],"efficient":[38],"framework":[39],"combines":[41],"timed-automata":[42],"reasoning":[43],"with":[44,64,149],"graphs":[45],"of":[46,68,124],"convex":[47,66,140,145],"sets":[48],"(GCS).":[49],"An":[50],"STL":[51,92,113,167,203],"specification":[52],"first":[54],"represented":[55],"by":[56],"a":[57,65,74,98,102,107,160,180,183,187,191],"timed":[58,137],"automaton,":[59],"which":[60],"then":[62],"coupled":[63],"decomposition":[67,141],"the":[69,91,112,122,125,136,144,150,154,197],"configuration":[70],"space":[71],"form":[73],"joint":[75,88],"transition":[76,89],"system":[77],"encoding":[78],"both":[79],"task":[80],"progress":[81],"region":[83],"occupancy.":[84],"Based":[85],"on":[86,177,190],"system,":[90],"motion-planning":[93,204],"problem":[94,100],"reformulated":[96],"as":[97],"shortest-path":[99],"over":[101],"GCS,":[103],"whose":[104],"solution":[105],"induces":[106],"B\u00e9zier-spline":[109],"trajectory":[110],"satisfying":[111],"specification,":[114],"smoothness":[115],"requirements,":[116],"velocity":[118],"bounds.":[119],"We":[120,157],"establish":[121],"soundness":[123],"proposed":[126,198],"formulation":[127],"analyze":[129],"its":[130],"computational":[131],"complexity,":[132],"showing":[133],"that,":[134],"once":[135],"automaton":[138],"are":[142],"fixed,":[143],"relaxation":[146],"scales":[147],"polynomially":[148],"configuration-space":[151],"dimension":[152],"B\u00e9zier":[155],"degree.":[156],"further":[158],"develop":[159],"compact":[161],"timed-automaton":[162],"construction":[163],"for":[164],"expressive":[166],"fragment":[168],"using":[169],"dedicated":[170],"templates":[171],"Boolean":[173],"composition.":[174],"Numerical":[175],"experiments":[176],"low-dimensional":[178],"benchmarks,":[179],"$3$-D":[181],"quadrotor,":[182],"$30$-DoF":[184],"humanoid,":[185],"hardware":[188],"experiment":[189],"UR-3":[192],"arm":[194],"demonstrate":[195],"method":[199],"efficiently":[200],"solves":[201],"complex":[202],"problems":[205],"produces":[207],"executable":[209],"trajectories.":[210]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-26T00:00:00"}