{"id":"https://openalex.org/W7138391685","doi":"https://doi.org/10.48550/arxiv.2603.13333","title":"STL-SVPIO: Signal Temporal Logic guided Stein Variational Path Integral Optimization","display_name":"STL-SVPIO: Signal Temporal Logic guided Stein Variational Path Integral Optimization","publication_year":2026,"publication_date":"2026-03-06","ids":{"openalex":"https://openalex.org/W7138391685","doi":"https://doi.org/10.48550/arxiv.2603.13333"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.13333","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13333","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.13333","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089057605","display_name":"Hongrui Zheng","orcid":"https://orcid.org/0000-0002-1284-285X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zheng, Hongrui","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018518467","display_name":"Zirui Zang","orcid":"https://orcid.org/0000-0002-0990-6680"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zang, Zirui","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129668237","display_name":"Ahmad Amine","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amine, Ahmad","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129685062","display_name":"Cristian Ioan Vasile","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vasile, Cristian Ioan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5129677727","display_name":"Rahul Mangharam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mangharam, Rahul","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5089057605"],"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.15320000052452087,"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.15320000052452087,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0940999984741211,"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.05730000138282776,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6947000026702881},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4404999911785126},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.43160000443458557},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.42489999532699585},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.4004000127315521},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.3856000006198883},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.36000001430511475}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6947000026702881},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5568000078201294},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4404999911785126},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.43160000443458557},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.42489999532699585},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.4004000127315521},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3856000006198883},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3774000108242035},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.36000001430511475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.352400004863739},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31299999356269836},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30309998989105225},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C154018700","wikidata":"https://www.wikidata.org/wiki/Q898323","display_name":"Path integral formulation","level":3,"score":0.2865999937057495},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.27649998664855957},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.2676999866962433}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.13333","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13333","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.13333","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13333","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Signal":[0,67],"Temporal":[1,68],"Logic":[2,69],"(STL)":[3],"enables":[4],"formal":[5],"specification":[6],"of":[7,33,103,126,198],"complex":[8,22,150],"spatiotemporal":[9],"constraints":[10],"for":[11,143],"robotic":[12,178],"task":[13],"planning.":[14],"However,":[15],"synthesizing":[16],"long-horizon":[17,63,151],"continuous":[18],"control":[19,58,104],"trajectories":[20],"from":[21,47],"STL":[23,34,79,145],"specifications":[24],"is":[25],"fundamentally":[26],"challenging":[27],"due":[28],"to":[29,164,194],"the":[30,121,196],"nested":[31],"structure":[32],"robustness":[35,108,140],"objectives.":[36],"Existing":[37],"solver-based":[38],"methods,":[39,52],"such":[40,53,185],"as":[41,54,80,186],"Mixed-Integer":[42],"Linear":[43],"Programming":[44],"(MILP),":[45],"suffer":[46],"exponential":[48],"scaling,":[49],"whereas":[50],"sampling":[51],"Model-Predictive":[55],"Path":[56,73],"Integral":[57,74],"(MPPI),":[59],"struggle":[60],"with":[61,156,182],"sparse,":[62],"costs.":[64],"We":[65,130],"introduce":[66],"guided":[70],"Stein":[71,89],"Variational":[72,90],"Optimization":[75],"(STL-SVPIO),":[76],"which":[77],"reframes":[78],"a":[81,99],"globally":[82],"informative,":[83],"differentiable":[84,94],"reward-shaping":[85],"mechanism.":[86],"By":[87],"leveraging":[88],"Gradient":[91],"Descent":[92],"and":[93,141,158,189],"physics":[95],"engines,":[96],"STL-SVPIO":[97,133,175],"transports":[98],"mutually":[100],"repulsive":[101],"swarm":[102],"particles":[105],"toward":[106],"high":[107],"regions.":[109],"Our":[110],"method":[111],"transforms":[112],"sparse":[113],"logical":[114],"satisfaction":[115],"into":[116],"tractable":[117],"variational":[118],"inference,":[119],"mitigating":[120],"severe":[122],"local":[123],"minima":[124],"traps":[125],"standard":[127],"gradient-based":[128],"methods.":[129],"demonstrate":[131],"that":[132],"significantly":[134],"outperforms":[135],"existing":[136],"methods":[137],"in":[138,176],"both":[139],"efficiency":[142],"traditional":[144],"tasks.":[146],"Moreover,":[147],"it":[148],"solves":[149],"tasks,":[152],"including":[153],"multi-agent":[154],"coordination":[155],"synchronization":[157],"queuing":[159],"while":[160],"baselines":[161],"either":[162],"fail":[163],"discover":[165],"feasible":[166],"solutions,":[167],"or":[168],"become":[169],"computationally":[170],"intractable.":[171],"Finally,":[172],"we":[173],"use":[174],"agile":[177],"motion":[179],"planning":[180],"tasks":[181],"nonlinear":[183],"dynamics,":[184],"7-DoF":[187],"manipulation":[188],"half":[190],"cheetah":[191],"back":[192],"flips":[193],"show":[195],"generalizability":[197],"our":[199],"algorithm.":[200]},"counts_by_year":[],"updated_date":"2026-03-18T06:31:55.123368","created_date":"2026-03-18T00:00:00"}