{"id":"https://openalex.org/W7153153317","doi":"https://doi.org/10.48550/arxiv.2604.07599","title":"SANDO: Safe Autonomous Trajectory Planning for Dynamic Unknown Environments","display_name":"SANDO: Safe Autonomous Trajectory Planning for Dynamic Unknown Environments","publication_year":2026,"publication_date":"2026-04-08","ids":{"openalex":"https://openalex.org/W7153153317","doi":"https://doi.org/10.48550/arxiv.2604.07599"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.07599","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.07599","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":null,"license_id":null,"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.2604.07599","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080422424","display_name":"Kota Kondo","orcid":"https://orcid.org/0000-0002-2356-1359"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kondo, Kota","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036406890","display_name":"Jesus Tordesillas","orcid":"https://orcid.org/0000-0001-6848-4070"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tordesillas, Jes\u00fas","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011665886","display_name":"Jonathan P. How","orcid":"https://orcid.org/0000-0001-8576-1930"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"How, Jonathan P.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080422424"],"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.963699996471405,"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.963699996471405,"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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.011599999852478504,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11489","display_name":"Air Traffic Management and Optimization","score":0.006899999920278788,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/trajectory","display_name":"Trajectory","score":0.680400013923645},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6046000123023987},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5602999925613403},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5421000123023987},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.4708999991416931},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.45879998803138733},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.45829999446868896},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45159998536109924},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.43869999051094055},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.4074999988079071}],"concepts":[{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.680400013923645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6290000081062317},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6046000123023987},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5602999925613403},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5421000123023987},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.4708999991416931},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.45879998803138733},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.45829999446868896},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45159998536109924},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.43869999051094055},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.4074999988079071},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4065999984741211},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39910000562667847},{"id":"https://openalex.org/C203479927","wikidata":"https://www.wikidata.org/wiki/Q5165939","display_name":"Controller (irrigation)","level":2,"score":0.39890000224113464},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3937000036239624},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.38999998569488525},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.38690000772476196},{"id":"https://openalex.org/C79487989","wikidata":"https://www.wikidata.org/wiki/Q934680","display_name":"Vehicle dynamics","level":2,"score":0.38449999690055847},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3628000020980835},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3625999987125397},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.35569998621940613},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.353300005197525},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33399999141693115},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.3206000030040741},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.28690001368522644},{"id":"https://openalex.org/C144171764","wikidata":"https://www.wikidata.org/wiki/Q48103","display_name":"Torque","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.2671000063419342},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.251800000667572},{"id":"https://openalex.org/C153240184","wikidata":"https://www.wikidata.org/wiki/Q3243772","display_name":"Control variable","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.07599","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.07599","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.07599","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.07599","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":null,"license_id":null,"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":{"SANDO":[0,54,196],"is":[1,114],"a":[2,18,21,62,78,117,127,141,227],"safe":[3,80,238,245],"trajectory":[4,112],"planner":[5,67],"for":[6,173],"3D":[7],"dynamic":[8,177,192,248],"unknown":[9,17],"environments,":[10],"where":[11],"obstacle":[12,216],"locations":[13],"and":[14,20,77,126,151,168,191,234,243],"motions":[15],"are":[16,36,171],"priori":[19],"collision-free":[22,41,146],"plan":[23],"can":[24],"become":[25],"unsafe":[26],"at":[27,48,97],"any":[28],"moment,":[29],"requiring":[30],"fast":[31,37,138],"replanning.":[32],"Existing":[33],"soft-constraint":[34],"planners":[35],"but":[38],"cannot":[39],"guarantee":[40],"paths,":[42],"while":[43],"hard-constraint":[44],"methods":[45,183],"ensure":[46],"safety":[47,143],"the":[49,104,108,132,199],"cost":[50],"of":[51,134],"longer":[52],"computation.":[53,139],"addresses":[55],"this":[56],"trade-off":[57],"through":[58],"three":[59],"contributions.":[60],"First,":[61],"heat":[63],"map-based":[64],"A*":[65],"global":[66],"steers":[68],"paths":[69],"away":[70],"from":[71],"high-risk":[72],"regions":[73],"using":[74],"soft":[75],"costs,":[76],"spatiotemporal":[79],"flight":[81],"corridor":[82],"(STSFC)":[83],"generator":[84],"produces":[85],"time-layered":[86],"polytopes":[87],"that":[88,157,169,195],"inflate":[89],"obstacles":[90],"only":[91],"by":[92,103],"their":[93],"worst-case":[94],"reachable":[95],"set":[96],"each":[98],"time":[99],"layer,":[100],"rather":[101],"than":[102],"worst":[105],"case":[106],"over":[107],"entire":[109],"horizon.":[110],"Second,":[111],"optimization":[113,166],"formulated":[115],"as":[116],"Mixed-Integer":[118],"Quadratic":[119],"Program":[120],"(MIQP)":[121],"with":[122,203,229],"hard":[123],"collision-avoidance":[124],"constraints,":[125],"variable":[128,158],"elimination":[129,159],"technique":[130],"reduces":[131],"number":[133],"decision":[135],"variables,":[136],"enabling":[137],"Third,":[140],"formal":[142],"analysis":[144],"establishes":[145],"guarantees":[147],"under":[148,221],"explicit":[149],"velocity-bound":[150],"estimation-error":[152],"assumptions.":[153],"Ablation":[154],"studies":[155],"show":[156,194],"yields":[160],"up":[161],"to":[162],"7.4x":[163],"speedup":[164],"in":[165,175,240],"time,":[167],"STSFCs":[170],"critical":[172],"feasibility":[174],"dense":[176],"environments.":[178],"Benchmark":[179],"simulations":[180],"against":[181],"state-of-the-art":[182],"across":[184,207],"standardized":[185],"static":[186,189,241],"benchmarks,":[187],"obstacle-rich":[188],"forests,":[190],"environments":[193,242],"consistently":[197],"achieves":[198],"highest":[200],"success":[201],"rate":[202],"no":[204],"constraint":[205],"violations":[206],"all":[208],"difficulty":[209],"levels;":[210],"perception-only":[211],"experiments":[212,225],"without":[213],"ground":[214],"truth":[215],"information":[217],"confirm":[218],"robust":[219],"performance":[220],"realistic":[222],"sensing.":[223],"Hardware":[224],"on":[226],"UAV":[228],"fully":[230],"onboard":[231],"planning,":[232],"perception,":[233],"localization":[235],"demonstrate":[236],"six":[237],"flights":[239,246],"ten":[244],"among":[247],"obstacles.":[249]},"counts_by_year":[],"updated_date":"2026-04-11T06:19:08.300824","created_date":"2026-04-11T00:00:00"}