{"id":"https://openalex.org/W4407950421","doi":"https://doi.org/10.1109/cdc56724.2024.10886577","title":"Robust Stochastic Shortest-Path Planning via Risk-Sensitive Incremental Sampling*","display_name":"Robust Stochastic Shortest-Path Planning via Risk-Sensitive Incremental Sampling*","publication_year":2024,"publication_date":"2024-12-16","ids":{"openalex":"https://openalex.org/W4407950421","doi":"https://doi.org/10.1109/cdc56724.2024.10886577"},"language":"en","primary_location":{"id":"doi:10.1109/cdc56724.2024.10886577","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc56724.2024.10886577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 63rd Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017857965","display_name":"Clinton Enwerem","orcid":"https://orcid.org/0000-0002-4239-2941"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Clinton Enwerem","raw_affiliation_strings":["Institute for Systems Research, University of Maryland,Department of Electrical & Computer Engineering,College Park,MD"],"affiliations":[{"raw_affiliation_string":"Institute for Systems Research, University of Maryland,Department of Electrical & Computer Engineering,College Park,MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051837539","display_name":"Erfaun Noorani","orcid":"https://orcid.org/0000-0002-5171-122X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erfaun Noorani","raw_affiliation_strings":["Institute for Systems Research, University of Maryland,Department of Electrical & Computer Engineering,College Park,MD"],"affiliations":[{"raw_affiliation_string":"Institute for Systems Research, University of Maryland,Department of Electrical & Computer Engineering,College Park,MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044395526","display_name":"John S. Baras","orcid":"https://orcid.org/0000-0002-4955-8561"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John S. Baras","raw_affiliation_strings":["Institute for Systems Research, University of Maryland,Department of Electrical & Computer Engineering,College Park,MD"],"affiliations":[{"raw_affiliation_string":"Institute for Systems Research, University of Maryland,Department of Electrical & Computer Engineering,College Park,MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053858045","display_name":"Brian M. Sadler","orcid":"https://orcid.org/0000-0002-9564-3812"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian M. Sadler","raw_affiliation_strings":["University of Texas at Austin,TX"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin,TX","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017857965"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25572485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1087","last_page":"1094"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9969000220298767,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9969000220298767,"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/computer-science","display_name":"Computer science","score":0.64180588722229},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5747849941253662},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5254356265068054},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4914485216140747},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4451752305030823},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.41592898964881897},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33281487226486206},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2483881413936615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19136041402816772},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19097867608070374},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12619203329086304},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11272162199020386},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.1087060272693634}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.64180588722229},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5747849941253662},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5254356265068054},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4914485216140747},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4451752305030823},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.41592898964881897},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33281487226486206},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2483881413936615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19136041402816772},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19097867608070374},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12619203329086304},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11272162199020386},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.1087060272693634},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc56724.2024.10886577","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc56724.2024.10886577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 63rd Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320316514","display_name":"Arm","ror":"https://ror.org/04mmhzs81"},{"id":"https://openalex.org/F4320332447","display_name":"U.S. Army","ror":"https://ror.org/00afsp483"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1647779468","https://openalex.org/W1913405677","https://openalex.org/W1971086298","https://openalex.org/W2072033067","https://openalex.org/W2080589303","https://openalex.org/W2099114258","https://openalex.org/W2101496914","https://openalex.org/W2125137443","https://openalex.org/W2127082526","https://openalex.org/W2128990851","https://openalex.org/W2159555929","https://openalex.org/W2336416123","https://openalex.org/W2963732412","https://openalex.org/W3015527528","https://openalex.org/W3104753760","https://openalex.org/W3123076862","https://openalex.org/W4210392450","https://openalex.org/W4287186233","https://openalex.org/W4294690570","https://openalex.org/W4314946929","https://openalex.org/W4321473440","https://openalex.org/W4382200339","https://openalex.org/W6741147320","https://openalex.org/W6845130110","https://openalex.org/W6846683052"],"related_works":["https://openalex.org/W2770593030","https://openalex.org/W3154990682","https://openalex.org/W2560201613","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153"],"abstract_inverted_index":{"With":[0],"the":[1,53,67,90,94,99,103,111,124,127,158,174,198],"pervasiveness":[2],"of":[3,55,93,102,126],"Stochastic":[4],"Shortest-Path":[5],"(SSP)":[6],"problems":[7,42],"in":[8,123,139,173,207],"high-risk":[9],"industries,":[10],"such":[11],"as":[12],"last-mile":[13],"autonomous":[14],"delivery":[15],"and":[16,48,98,146,193,219],"supply":[17],"chain":[18],"management,":[19],"robust":[20,183],"planning":[21,73,137],"algorithms":[22],"are":[23,167,181],"crucial":[24],"for":[25,39],"ensuring":[26],"successful":[27],"task":[28],"completion":[29],"while":[30],"mitigating":[31],"hazardous":[32],"outcomes.":[33],"Mainstream":[34],"chance-constrained":[35],"incremental":[36],"sampling":[37,115],"techniques":[38],"solving":[40],"SSP":[41,104],"tend":[43],"to":[44,110,119,171,184,197],"be":[45],"overly":[46],"conservative":[47],"typically":[49],"do":[50],"not":[51],"consider":[52],"likelihood":[54],"undesirable":[56],"tail":[57],"events.":[58],"We":[59,130],"propose":[60],"an":[61,120],"alternative":[62],"risk-aware":[63],"approach":[64,133],"inspired":[65],"by":[66,214],"asymptoticallyoptimal":[68],"Rapidy-Exploring":[69],"Random":[70],"Trees":[71],"(RRT*)":[72],"algorithm,":[74],"which":[75],"selects":[76],"nodes":[77],"along":[78],"path":[79,122,136],"segments":[80],"with":[81,108,144,164,202],"minimal":[82],"Conditional":[83],"Value-at-Risk":[84],"(CVaR).":[85],"Our":[86,150],"motivation":[87],"rests":[88],"on":[89],"step-wise":[91],"coherence":[92],"CVaR":[95,112],"risk":[96,156],"measure":[97],"optimal":[100,121],"substructure":[101],"problem.":[105],"Thus,":[106],"optimizing":[107],"respect":[109],"at":[113],"each":[114],"iteration":[116],"necessarily":[117],"leads":[118],"limit":[125],"sample":[128],"size.":[129],"validate":[131],"our":[132],"via":[134],"numerical":[135],"experiments":[138],"a":[140,204],"two-dimensional":[141],"grid":[142],"world":[143],"obstacles":[145],"stochastic":[147],"pathsegment":[148],"lengths.":[149],"simulation":[151],"results":[152],"show":[153],"that":[154,166,180],"incorporating":[155],"into":[157],"tree":[159],"growth":[160],"process":[161],"yields":[162],"paths":[163,179],"lengths":[165],"significantly":[168,215],"less":[169],"sensitive":[170],"variations":[172],"noise":[175,217],"parameter,":[176],"or":[177],"equivalently,":[178],"more":[182],"environmental":[185],"uncertainty.":[186],"Algorithmic":[187],"analyses":[188],"reveal":[189],"similar":[190],"query":[191],"time":[192],"memory":[194],"space":[195],"complexity":[196],"baseline":[199],"RRT*":[200],"procedure,":[201],"only":[203],"marginal":[205],"increase":[206,211],"processing":[208],"time.":[209],"This":[210],"is":[212],"offset":[213],"lower":[216],"sensitivity":[218],"reduced":[220],"planner":[221],"failure":[222],"rates.":[223]},"counts_by_year":[],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}