{"id":"https://openalex.org/W7130744595","doi":"https://doi.org/10.48550/arxiv.2602.16825","title":"RRT$^\u03b7$: Sampling-based Motion Planning and Control from STL Specifications using Arithmetic-Geometric Mean Robustness","display_name":"RRT$^\u03b7$: Sampling-based Motion Planning and Control from STL Specifications using Arithmetic-Geometric Mean Robustness","publication_year":2026,"publication_date":"2026-02-18","ids":{"openalex":"https://openalex.org/W7130744595","doi":"https://doi.org/10.48550/arxiv.2602.16825"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.16825","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","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":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126522896","display_name":"Ahmad Ahmad","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ahmad, Ahmad","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126520562","display_name":"Shuo Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Shuo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031884953","display_name":"Roberto Tron","orcid":"https://orcid.org/0000-0002-6676-8595"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tron, Roberto","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000180146","display_name":"Belta Calin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Belta, Calin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5126522896"],"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.3012000024318695,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.3012000024318695,"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.2815999984741211,"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/T10142","display_name":"Formal Methods in Verification","score":0.25029999017715454,"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/robustness","display_name":"Robustness (evolution)","score":0.7818999886512756},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5730999708175659},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.46869999170303345},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.45890000462532043},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4578999876976013},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.374099999666214},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.34610000252723694},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.3140999972820282}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7818999886512756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6313999891281128},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5730999708175659},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.45890000462532043},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4578999876976013},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39649999141693115},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.374099999666214},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.34610000252723694},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2863999903202057},{"id":"https://openalex.org/C79518650","wikidata":"https://www.wikidata.org/wiki/Q2081431","display_name":"Integrator","level":3,"score":0.275299996137619},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C2776350369","wikidata":"https://www.wikidata.org/wiki/Q843479","display_name":"Control logic","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.2685000002384186},{"id":"https://openalex.org/C31531917","wikidata":"https://www.wikidata.org/wiki/Q915157","display_name":"Robust control","level":3,"score":0.26750001311302185},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2653000056743622},{"id":"https://openalex.org/C17500928","wikidata":"https://www.wikidata.org/wiki/Q959968","display_name":"Control system","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.2615000009536743},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25130000710487366}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.16825","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.16825","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.16825","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":"pmh:doi:10.48550/arxiv.2602.16825","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.647555947303772,"display_name":"Sustainable cities and communities","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":{"Sampling-based":[0],"motion":[1],"planning":[2,77],"has":[3],"emerged":[4],"as":[5],"a":[6,25,75,175,180],"powerful":[7],"approach":[8,165],"for":[9,30,105,135],"robotics,":[10],"enabling":[11],"exploration":[12],"of":[13,126,160],"complex,":[14],"high-dimensional":[15],"configuration":[16],"spaces.":[17],"When":[18],"combined":[19],"with":[20,63,149,195],"Signal":[21],"Temporal":[22],"Logic":[23,133],"(STL),":[24],"temporal":[26],"logic":[27],"widely":[28],"used":[29],"formalizing":[31],"interpretable":[32],"robotic":[33,168],"tasks,":[34],"these":[35,120],"methods":[36],"can":[37],"address":[38],"complex":[39],"spatiotemporal":[40],"constraints.":[41],"However,":[42],"traditional":[43,188],"approaches":[44],"rely":[45],"on":[46,53,166],"min-max":[47],"robustness":[48,85,102,151],"measures":[49],"that":[50,67,79],"focus":[51],"only":[52],"critical":[54],"time":[55,92],"points":[56,93],"and":[57,94,122,157,179],"subformulae,":[58],"creating":[59],"non-smooth":[60],"optimization":[61],"landscapes":[62],"sharp":[64],"decision":[65],"boundaries":[66],"hinder":[68],"efficient":[69,115],"tree":[70,111],"exploration.":[71],"We":[72,162],"propose":[73],"RRT$^\u03b7$,":[74],"sampling-based":[76],"framework":[78,140],"integrates":[80],"the":[81,154],"Arithmetic-Geometric":[82],"Mean":[83],"(AGM)":[84],"measure":[86],"to":[87],"evaluate":[88],"satisfaction":[89],"across":[90],"all":[91],"subformulae.":[95],"Our":[96,139],"key":[97],"contributions":[98],"include:":[99],"(1)":[100],"AGM":[101],"interval":[103],"semantics":[104],"reasoning":[106],"about":[107],"partial":[108],"trajectories":[109],"during":[110],"construction,":[112],"(2)":[113],"an":[114],"incremental":[116],"monitoring":[117],"algorithm":[118],"computing":[119],"intervals,":[121],"(3)":[123],"enhanced":[124],"Direction":[125],"Increasing":[127],"Satisfaction":[128],"vectors":[129],"leveraging":[130],"Fulfillment":[131],"Priority":[132],"(FPL)":[134],"principled":[136],"objective":[137],"composition.":[138],"synthesizes":[141],"dynamically":[142],"feasible":[143],"control":[144],"sequences":[145],"satisfying":[146],"STL":[147,189],"specifications":[148],"high":[150],"while":[152],"maintaining":[153],"probabilistic":[155],"completeness":[156],"asymptotic":[158],"optimality":[159],"RRT$^\\ast$.":[161],"validate":[163],"our":[164],"three":[167],"systems.":[169],"A":[170],"double":[171],"integrator":[172],"point":[173],"robot,":[174,178],"unicycle":[176],"mobile":[177],"7-DOF":[181],"robot":[182],"arm,":[183],"demonstrating":[184],"superior":[185],"performance":[186],"over":[187],"robustness-based":[190],"planners":[191],"in":[192],"multi-constraint":[193],"scenarios":[194],"limited":[196],"guidance":[197],"signals.":[198]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-21T00:00:00"}
