{"id":"https://openalex.org/W7204593290","doi":"https://doi.org/10.48550/arxiv.2608.26314","title":"Dispersive Forward Tree Search for Optimal Control: Coverage, Complexity, and Computation","display_name":"Dispersive Forward Tree Search for Optimal Control: Coverage, Complexity, and Computation","publication_year":2026,"publication_date":"2026-08-26","ids":{"openalex":"https://openalex.org/W7204593290","doi":"https://doi.org/10.48550/arxiv.2608.26314"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2608.26314","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.26314","pdf_url":"https://arxiv.org/pdf/2608.26314","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2608.26314","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012499796","display_name":"Shashank A. Deshpande","orcid":"https://orcid.org/0009-0003-0059-5876","observed_orcids":["https://orcid.org/0009-0003-0059-5876"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Deshpande, Shashank A.","raw_affiliation_strings":["Department of Aeronautics and Astronautics , Massachusetts Institute of Technology , Cambridge , MA , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aeronautics and Astronautics , Massachusetts Institute of Technology , Cambridge , MA , USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011665886","display_name":"Jonathan P. How","orcid":"https://orcid.org/0000-0001-8576-1930","observed_orcids":["https://orcid.org/0000-0001-8576-1930"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"How, Jonathan P.","raw_affiliation_strings":["Department of Aeronautics and Astronautics , Massachusetts Institute of Technology , 77 Massachusetts Avenue , Cambridge , MA 02139 , USA","Department of Aeronautics and Astronautics , Massachusetts Institute of Technology , Cambridge , MA , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aeronautics and Astronautics , Massachusetts Institute of Technology , 77 Massachusetts Avenue , Cambridge , MA 02139 , USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Department of Aeronautics and Astronautics , Massachusetts Institute of Technology , Cambridge , MA , USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.9922000169754028,"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.9922000169754028,"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.003700000001117587,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0015999999595806003,"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/kinodynamic-motion-planning","display_name":"kinodynamic motion planning","score":0.8140000104904175},{"id":"https://openalex.org/keywords/differentially-flat-systems","display_name":"differentially flat systems","score":0.7760000228881836},{"id":"https://openalex.org/keywords/boundary-value-problems","display_name":"boundary value problems","score":0.7549999952316284},{"id":"https://openalex.org/keywords/control-affine-systems","display_name":"control-affine systems","score":0.7260000109672546},{"id":"https://openalex.org/keywords/unicycle","display_name":"unicycle","score":0.6420000195503235},{"id":"https://openalex.org/keywords/quadrotor","display_name":"quadrotor","score":0.9990000128746033},{"id":"https://openalex.org/keywords/real-time-planning","display_name":"real-time planning","score":0.6600000262260437},{"id":"https://openalex.org/keywords/receding-horizon","display_name":"receding horizon","score":0.6259999871253967},{"id":"https://openalex.org/keywords/parallel-planning","display_name":"parallel planning","score":0.4729999899864197},{"id":"https://openalex.org/keywords/embedded-processors","display_name":"embedded processors","score":0.35199999809265137}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6068999767303467},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5813999772071838},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5753999948501587},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49779999256134033},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.47360000014305115},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4553000032901764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43639999628067017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4348999857902527},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.43320000171661377},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4097999930381775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38350000977516174},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.36640000343322754},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.35920000076293945},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.35740000009536743},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.32350000739097595},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.31850001215934753},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3181000053882599},{"id":"https://openalex.org/C2778584072","wikidata":"https://www.wikidata.org/wiki/Q7353545","display_name":"Robustification","level":3,"score":0.290800005197525},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.2906000018119812},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25360000133514404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25049999356269836}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2608.26314","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.26314","pdf_url":"https://arxiv.org/pdf/2608.26314","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2608.26314","doi":"https://doi.org/10.48550/arxiv.2608.26314","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.26314","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2608.26314","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.26314","pdf_url":"https://arxiv.org/pdf/2608.26314","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7204593290.pdf","grobid_xml":"https://content.openalex.org/works/W7204593290.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Steering-based":[0],"planners":[1,29,204],"require":[2],"solutions":[3],"to":[4,86,97,227],"state-to-state":[5],"boundary":[6],"value":[7],"problems,":[8],"which":[9,94,163],"can":[10],"be":[11],"inaccessible":[12],"for":[13,91,174,188],"nonlinear":[14,59],"platforms.":[15,190],"Forward":[16,152],"propagation":[17],"evades":[18],"the":[19,23,27,53,99,104,110,124,143,147,160,175,177,181],"steering":[20],"requirement,":[21],"but":[22],"finite-sample":[24,47],"behavior":[25],"of":[26,56,67,115,159],"associated":[28],"remains":[30],"uncharacterized":[31],"and":[32,61,127,180,183,195],"their":[33],"implementations":[34],"underperform":[35],"in":[36,123,142,223,231],"practice.":[37],"This":[38],"paper":[39],"develops":[40],"a":[41,64,73,77,83,119,129,138,224],"propagation-based":[42],"kinodynamic":[43,203],"planner":[44],"with":[45],"deterministic":[46],"near-optimality":[48,136],"guarantees.":[49],"We":[50,81,106,145,169,219],"work":[51],"within":[52],"large":[54],"class":[55,113],"differentially":[57],"flat":[58],"systems":[60],"show":[62,107],"that":[63,108,134],"forward":[65,161],"tree":[66,79,120,139],"locally":[68],"dispersive":[69,88,172],"control":[70],"commands":[71],"contains":[72],"near-optimal":[74],"trajectory":[75,112],"at":[76,137,205,234],"certified":[78,111],"size.":[80],"provide":[82],"general":[84],"mechanism":[85],"construct":[87],"command":[89],"sets":[90],"control-affine":[92],"systems,":[93],"are":[95],"necessary":[96],"implement":[98,146,221],"search":[100,149,154],"algorithm":[101],"prescribed":[102],"by":[103],"theory.":[105],"covering":[109],"irrespective":[114],"cost":[116],"provably":[117],"demands":[118],"exponentially":[121],"sized":[122],"problem":[125],"horizon,":[126],"present":[128],"cost-conditioned":[130],"dominance":[131],"pruning":[132],"procedure":[133],"retains":[135],"size":[140],"polynomial":[141],"horizon.":[144],"resulting":[148],"algorithm,":[150],"Dispersive":[151],"Tree":[153],"(DFT*),":[155],"as":[156,214],"breadth-first":[157],"expansion":[158],"tree,":[162],"maps":[164],"naturally":[165],"onto":[166],"parallel":[167,215],"hardware.":[168],"design":[170],"efficient":[171],"samplers":[173],"unicycle,":[176],"trailer":[178],"car,":[179],"quadrotor":[182],"evaluate":[184],"challenging":[185],"planning":[186,230],"tasks":[187],"these":[189],"DFT*":[191,222],"delivers":[192],"consistently":[193],"competitive":[194],"often":[196],"substantially":[197],"better":[198],"solution":[199,207],"quality":[200],"than":[201],"state-of-the-art":[202],"comparable":[206],"times":[208],"on":[209],"embedded-tier":[210,235],"processors,":[211],"accelerating":[212],"further":[213],"compute":[216,236],"is":[217],"scaled.":[218],"also":[220],"receding-horizon":[225],"loop":[226],"demonstrate":[228],"real-time":[229],"dynamic":[232],"environments":[233],"budgets.":[237]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2026-08-29T00:00:00"}