{"id":"https://openalex.org/W7147522684","doi":"https://doi.org/10.48550/arxiv.2603.26995","title":"SCRAMPPI: Efficient Contingency Planning for Mobile Robot Navigation via Hamilton-Jacobi Reachability","display_name":"SCRAMPPI: Efficient Contingency Planning for Mobile Robot Navigation via Hamilton-Jacobi Reachability","publication_year":2026,"publication_date":"2026-03-27","ids":{"openalex":"https://openalex.org/W7147522684","doi":"https://doi.org/10.48550/arxiv.2603.26995"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.26995","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26995","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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.26995","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119212569","display_name":"Raj Harshit Srirangam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Srirangam, Raj Harshit","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040137924","display_name":"Leonard Jung","orcid":"https://orcid.org/0009-0004-2125-5923"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jung, Leonard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132628773","display_name":"Rohith Poola","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Poola, Rohith","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132629127","display_name":"Michael Everett","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Everett, Michael","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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8518000245094299,"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.8518000245094299,"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/T10142","display_name":"Formal Methods in Verification","score":0.027699999511241913,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.027499999850988388,"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/reachability","display_name":"Reachability","score":0.7092000246047974},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5393000245094299},{"id":"https://openalex.org/keywords/backup","display_name":"Backup","score":0.5019999742507935},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4871000051498413},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.4683000147342682},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4269999861717224},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4032000005245209},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.36730000376701355},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.34439998865127563}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7092000246047974},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5860000252723694},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5393000245094299},{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.5019999742507935},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4871000051498413},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.4683000147342682},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4269999861717224},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4242999851703644},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4032000005245209},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.36730000376701355},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3427000045776367},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.3246000111103058},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3003000020980835},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C150921843","wikidata":"https://www.wikidata.org/wiki/Q1170431","display_name":"Resampling","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.26159998774528503},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.2578999996185303},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C14331377","wikidata":"https://www.wikidata.org/wiki/Q2340208","display_name":"Contingency plan","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.26995","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26995","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.26995","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26995","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":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Autonomous":[0],"robots":[1],"commonly":[2],"aim":[3],"to":[4,17,28,34,66,86,106],"complete":[5],"a":[6,11,23,29,36,44,53,63,67,97,131,171],"nominal":[7,50,61,163],"behavior":[8],"while":[9,147],"minimizing":[10],"cost;":[12],"this":[13,77,89,94],"leaves":[14],"them":[15],"vulnerable":[16],"failure":[18],"or":[19,25,80],"unplanned":[20],"scenarios,":[21],"where":[22],"backup":[24],"contingency":[26,108,165],"plan":[27],"safe":[30,69],"set":[31,70,120],"is":[32,41,125],"needed":[33],"avoid":[35],"total":[37],"mission":[38],"failure.":[39],"This":[40],"formalized":[42],"as":[43,96,122],"trajectory":[45,65],"optimization":[46],"problem":[47,99],"over":[48],"the":[49,60,112,123,144],"cost":[51],"with":[52,130],"safety":[54],"constraint:":[55],"from":[56],"any":[57],"point":[58],"along":[59],"plan,":[62],"feasible":[64],"designated":[68],"must":[71],"exist.":[72],"Previous":[73],"methods":[74],"either":[75],"relax":[76],"hard":[78,145],"constraint,":[79],"use":[81],"an":[82,175],"expensive":[83],"sampling-based":[84],"strategy":[85],"optimize":[87],"for":[88],"constraint.":[90],"Instead,":[91],"we":[92,140,153],"formalize":[93],"requirement":[95],"reach-avoid":[98],"and":[100,127,156,164],"leverage":[101],"Hamilton-Jacobi":[102],"(HJ)":[103],"reachability":[104],"analysis":[105],"certify":[107],"feasibility.":[109],"By":[110],"computing":[111],"value":[113],"function":[114],"of":[115,143],"our":[116,160],"safe-set's":[117],"backward":[118],"reachable":[119],"online":[121],"environment":[124],"revealed":[126],"integrating":[128],"it":[129],"sampling":[132,150],"based":[133,138],"planner":[134],"(MPPI)":[135],"via":[136],"resampling":[137],"rollouts,":[139],"guarantee":[141],"satisfaction":[142],"constraint":[146],"greatly":[148],"increasing":[149],"efficiency.":[151],"Finally,":[152],"present":[154],"simulated":[155],"hardware":[157],"experiments":[158],"demonstrating":[159],"algorithm":[161],"generating":[162],"plans":[166],"in":[167,174],"real":[168],"time":[169],"on":[170],"mobile":[172],"robot":[173],"adversarial":[176],"evasion":[177],"task.":[178]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-02T00:00:00"}