{"id":"https://openalex.org/W7169495036","doi":"https://doi.org/10.48550/arxiv.2607.14455","title":"Motion Planning with Model-Based Diffusion via Constraint Optimization and Adaptive Scheduling","display_name":"Motion Planning with Model-Based Diffusion via Constraint Optimization and Adaptive Scheduling","publication_year":2026,"publication_date":"2026-07-16","ids":{"openalex":"https://openalex.org/W7169495036","doi":"https://doi.org/10.48550/arxiv.2607.14455"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.14455","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.14455","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,"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.2607.14455","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140824697","display_name":"Zhilin He","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"He, Zhilin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5141055147","display_name":"Bowei Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Bowei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5141057440","display_name":"Jianlin Dou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dou, Jianlin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125715658","display_name":"Yuner Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Yuner","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5141094942","display_name":"Changliu Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Changliu","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.6413999795913696,"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.6413999795913696,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.14920000731945038,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.09319999814033508,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/motion-planning","display_name":"Motion planning","score":0.5613999962806702},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.505299985408783},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.42899999022483826},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4250999987125397},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.41670000553131104},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.3799000084400177},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.37619999051094055},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.37310001254081726},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.36640000343322754}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6608999967575073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5716999769210815},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5613999962806702},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.505299985408783},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.42899999022483826},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4250999987125397},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.41670000553131104},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3799000084400177},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.37619999051094055},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.37310001254081726},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.36640000343322754},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.3637999892234802},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3465999960899353},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.3456000089645386},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.33970001339912415},{"id":"https://openalex.org/C69357855","wikidata":"https://www.wikidata.org/wiki/Q163214","display_name":"Diffusion","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.30489999055862427},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.267300009727478},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.2614000141620636},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.25}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.14455","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.14455","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,"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.2607.14455","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.14455","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,"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":{"Single-Robot":[0],"Motion":[1],"Planning":[2],"(SRMP)":[3],"in":[4],"highly":[5,189],"non-convex":[6,190],"constrained":[7,77],"environments,":[8],"where":[9],"robots":[10],"must":[11],"satisfy":[12],"collision-free":[13],"guarantees,":[14],"dynamic":[15],"feasibility,":[16],"and":[17,25,49,79,109,129,155,158,179,193],"task-related":[18],"constraints,":[19],"is":[20],"challenging":[21],"under":[22],"complex":[23],"constraints":[24],"computational":[26],"limits.":[27],"Recent":[28],"Model-Based":[29,124],"Diffusion":[30,125],"(MBD)":[31],"approaches":[32],"recast":[33],"the":[34,52,116,137],"SRMP":[35,134],"as":[36],"trajectory":[37,66],"optimization":[38],"that":[39,135,168],"samples":[40,57],"from":[41,55],"a":[42,63,103,147,194],"posterior":[43],"over":[44],"trajectories,":[45],"using":[46],"known":[47],"dynamics,":[48],"analytically":[50],"estimates":[51],"score":[53],"function":[54],"rollout":[56],"to":[58,76,106,114],"guide":[59],"diffusion":[60,95,119,144,164],"denoising":[61],"toward":[62],"low-cost,":[64],"clean":[65],"without":[67],"demonstration":[68],"learning.":[69],"While":[70],"existing":[71],"works":[72],"further":[73],"adapt":[74],"MBD":[75],"environments":[78],"showcase":[80],"promising":[81],"performance,":[82],"they":[83],"are":[84],"still":[85],"limited":[86],"by":[87],"(1)":[88],"enforcing":[89],"safety":[90,112,160,173],"either":[91],"via":[92,126],"soft":[93,143],"feasibility":[94],"priors":[96],"or":[97],"hard":[98,152],"projection":[99,153],"operators,":[100],"but":[101],"lack":[102],"unified":[104],"framework":[105],"integrate":[107],"both,":[108],"(2)":[110],"fixing":[111],"enforcement":[113],"neglect":[115],"changing":[117],"of":[118],"scheduling.":[120,165],"Therefore,":[121],"we":[122],"introduce":[123],"Constraint":[127],"Optimization":[128],"Adaptive":[130],"Scheduling":[131],"(MD-COAS)":[132],"for":[133],"unifies":[136],"inexact":[138],"Augmented":[139],"Lagrangian":[140],"Method":[141],"(iALM)":[142],"prior":[145],"with":[146,163],"Convex":[148],"Feasible":[149],"Set":[150],"(CFS)-based":[151],"operator,":[154],"adaptively":[156],"schedules":[157],"co-optimizes":[159],"enforcement,":[161],"along":[162],"Experiments":[166],"demonstrate":[167],"our":[169],"method":[170],"achieves":[171],"higher":[172],"\\&":[174],"success":[175],"rates,":[176],"faster":[177],"convergence,":[178],"lower":[180],"final":[181],"costs":[182],"than":[183],"baseline":[184],"planners":[185],"on":[186],"randomly":[187],"generated":[188],"2D":[191],"benchmarks":[192],"7-DoF":[195],"robot":[196],"arm":[197],"avoidance":[198],"task.":[199]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-18T00:00:00"}