{"id":"https://openalex.org/W7161846414","doi":"https://doi.org/10.48550/arxiv.2605.19089","title":"Reachability-Augmented Dual Dynamic Programming for Optimal Path Parameterization","display_name":"Reachability-Augmented Dual Dynamic Programming for Optimal Path Parameterization","publication_year":2026,"publication_date":"2026-05-18","ids":{"openalex":"https://openalex.org/W7161846414","doi":"https://doi.org/10.48550/arxiv.2605.19089"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.19089","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19089","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.2605.19089","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136565312","display_name":"Yunan Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yunan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136609497","display_name":"Jizhou Yan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yan, Jizhou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079033650","display_name":"Chuxiong Hu","orcid":"https://orcid.org/0000-0002-3504-3065"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Chuxiong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136565536","display_name":"Zeyang Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Zeyang","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.47440001368522644,"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.47440001368522644,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.05790000036358833,"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/T10531","display_name":"Advanced Vision and Imaging","score":0.051600001752376556,"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/reachability","display_name":"Reachability","score":0.6955000162124634},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6230999827384949},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.614799976348877},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5961999893188477},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5694000124931335},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5594000220298767},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.439300000667572},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4154999852180481},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4124000072479248}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6955000162124634},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6389999985694885},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6230999827384949},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.614799976348877},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5961999893188477},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5694000124931335},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5594000220298767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4909000098705292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4438999891281128},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.439300000667572},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4154999852180481},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4124000072479248},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.3917999863624573},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3833000063896179},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3562999963760376},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.298799991607666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.290800005197525},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.29030001163482666},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2754000127315521},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C147297375","wikidata":"https://www.wikidata.org/wiki/Q6674930","display_name":"Look-ahead","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.2549999952316284},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2524999976158142},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.19089","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19089","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.2605.19089","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19089","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":{"Optimal":[0],"path":[1,15],"parameterization":[2],"(OPP)":[3],"is":[4,98],"a":[5,12,47,68,87,218,238],"fundamental":[6],"problem":[7],"for":[8,72,93,153,175,180],"planning":[9],"trajectories":[10,125],"along":[11],"prescribed":[13],"geometric":[14],"under":[16,145],"kinodynamic":[17],"constraints":[18],"and":[19,30,35,59,89,117,123,133,140,155,177,232],"task-dependent":[20],"objectives.":[21,45],"While":[22],"TOPP":[23],"minimizes":[24],"traversal":[25,212],"time,":[26],"its":[27],"saturating":[28],"states":[29],"controls":[31],"may":[32],"induce":[33],"vibration":[34],"tracking":[36],"errors,":[37],"which":[38],"can":[39],"be":[40],"mitigated":[41],"by":[42,172,224],"introducing":[43],"smoothness":[44],"However,":[46],"key":[48,96,219],"capability":[49,220],"gap":[50,221],"remains":[51],"in":[52,67,107,222,237],"OPP:":[53],"feasibility":[54,230],"guarantees,":[55],"general-objective":[56,227],"optimality":[57,139],"certificates,":[58],"computational":[60],"efficiency":[61],"are":[62,151],"difficult":[63],"to":[64,99,165],"achieve":[65],"simultaneously":[66],"unified":[69],"framework,":[70],"especially":[71],"third-order":[73],"OPP":[74,223,240],"(OPP3)":[75],"with":[76,112,191,204],"non-convex":[77,134],"constraints.":[78],"This":[79],"paper":[80],"proposes":[81],"reachability-augmented":[82],"dual":[83,109],"dynamic":[84],"programming":[85],"(RDDP),":[86],"state-grid-free":[88],"objective-aware":[90],"DP":[91,110,235],"framework":[92],"OPP.":[94],"The":[95],"idea":[97],"replace":[100],"the":[101,196],"relatively":[102],"complete":[103],"recourse":[104],"assumption":[105],"used":[106],"classical":[108],"(DDP)":[111],"OPP-specific":[113,146],"backward":[114],"reachable":[115,129],"sets,":[116],"then":[118],"generate":[119],"both":[120],"value-function":[121],"cuts":[122],"trial":[124],"only":[126],"inside":[127],"these":[128],"sets.":[130],"For":[131],"convex":[132],"OPP,":[135],"we":[136],"prove":[137],"global":[138],"Karush-Kuhn-Tucker":[141],"convergence":[142,186],"of":[143],"RDDP":[144,160,182,194,216],"conditions,":[147],"respectively.":[148],"Efficient":[149],"instantiations":[150],"developed":[152],"OPP2":[154,176],"OPP3.":[156,181],"Experiments":[157],"show":[158],"that":[159],"achieves":[161,184],"objective":[162],"values":[163],"comparable":[164],"convex-optimization":[166],"baselines":[167],"while":[168,199],"reducing":[169],"computation":[170,236],"time":[171],"28.6":[173],"times":[174,179],"5.8":[178],"also":[183],"faster":[185],"than":[187],"grid-based":[188],"DP.":[189],"Compared":[190],"reachability-analysis":[192],"methods,":[193],"retains":[195],"reachability":[197],"mechanism":[198],"replacing":[200],"local":[201],"maximum-control":[202],"propagation":[203],"value-function-guided":[205],"control":[206],"selection,":[207],"thereby":[208],"enabling":[209],"objectives":[210],"beyond":[211],"time.":[213],"In":[214],"summary,":[215],"addresses":[217],"unifying":[225],"certifiable":[226],"optimization,":[228],"reachability-based":[229],"preservation,":[231],"online-compatible":[233],"low-dimensional":[234],"single":[239],"framework.":[241]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-21T00:00:00"}