{"id":"https://openalex.org/W7137820361","doi":"https://doi.org/10.1609/aaai.v40i28.39512","title":"Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning","display_name":"Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7137820361","doi":"https://doi.org/10.1609/aaai.v40i28.39512"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v40i28.39512","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i28.39512","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/39512/43473","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/AAAI/article/download/39512/43473","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129688288","display_name":"Jinhao Liang","orcid":null},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jinhao Liang","raw_affiliation_strings":["University of Virginia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Virginia","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129677632","display_name":"Sven Koenig","orcid":null},"institutions":[{"id":"https://openalex.org/I26437253","display_name":"\u00d6rebro University","ror":"https://ror.org/05kytsw45","country_code":"SE","type":"education","lineage":["https://openalex.org/I26437253"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Sven Koenig","raw_affiliation_strings":["University of California, Irvine\n\u00d6rebro University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine\n\u00d6rebro University","institution_ids":["https://openalex.org/I26437253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129736808","display_name":"Ferdinando Fioretto","orcid":null},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ferdinando Fioretto","raw_affiliation_strings":["University of Virginia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Virginia","institution_ids":["https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"28","first_page":"23417","last_page":"23424"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9866999983787537,"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.9866999983787537,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0012000000569969416,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.0007999999797903001,"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/scalability","display_name":"Scalability","score":0.6710000038146973},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.656000018119812},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.6384000182151794},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6197999715805054},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5580999851226807},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5013999938964844},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4562999904155731},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44119998812675476},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.43320000171661377}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6710000038146973},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6579999923706055},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.656000018119812},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.6384000182151794},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6197999715805054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6079000234603882},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5580999851226807},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5013999938964844},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4562999904155731},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44119998812675476},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.43320000171661377},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.430400013923645},{"id":"https://openalex.org/C69357855","wikidata":"https://www.wikidata.org/wiki/Q163214","display_name":"Diffusion","level":2,"score":0.42899999022483826},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.38989999890327454},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.38850000500679016},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.32179999351501465},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.31279999017715454},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2808000147342682},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2615000009536743},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.25619998574256897}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/aaai.v40i28.39512","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i28.39512","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/39512/43473","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/39512","is_oa":false,"landing_page_url":"https://ojs.aaai.org/index.php/AAAI/article/view/39512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2159-5399","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i28.39512","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i28.39512","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/39512/43473","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5132308006286621,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G1686202458","display_name":"NSF-BSF: RI: Small: Efficient Bi- and Multi-Objective Search Algorithms","funder_award_id":"2544613","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2176146031","display_name":"PARTNER: ARISE: AI Research and Innovation for Smart Environments - Empowering Minorities in Autonomous Robotics and Infrastructure Monitoring","funder_award_id":"2434916","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3791455583","display_name":"Collaborative Research: RI: Small: End-to-end Learning of Fair and Explainable Schedules for Court Systems","funder_award_id":"2334936","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4434047044","display_name":"Collaborative Research: Physics Informed Real-time Optimal Power Flow","funder_award_id":"2334448","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5986150752","display_name":"AI Institute for Advances in Optimization","funder_award_id":"2112533","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8121542386","display_name":"CAREER: End-to-end Constrained Optimization Learning","funder_award_id":"2401285","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G871475615","display_name":"CISE: Large: Causal Foundations for Decision Making and Learning","funder_award_id":"2321786","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320316556","display_name":"Amazon Robotics","ror":null},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320332688","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7137820361.pdf","grobid_xml":"https://content.openalex.org/works/W7137820361.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Multi-Robot":[0],"Motion":[1],"Planning":[2],"(MRMP)":[3],"involves":[4],"generating":[5],"collision-free":[6],"trajectories":[7],"for":[8],"multiple":[9],"robots":[10,162],"operating":[11],"in":[12,54,155],"a":[13,75,138,151],"shared":[14],"continuous":[15,40],"workspace.":[16],"While":[17],"discrete":[18,80,117],"multi-agent":[19],"path":[20],"finding":[21],"(MAPF)":[22],"methods":[23],"are":[24],"broadly":[25],"adopted":[26],"due":[27],"to":[28,59,124,143,160],"their":[29,31],"scalability,":[30],"coarse":[32],"discretization":[33],"severely":[34],"limits":[35],"trajectory":[36,145],"quality.":[37],"In":[38],"contrast,":[39],"optimization-based":[41],"planners":[42],"offer":[43],"higher-quality":[44],"paths":[45],"but":[46],"suffer":[47],"from":[48],"the":[49,60,67,102],"curse":[50],"of":[51,62,69],"dimensionality,":[52],"resulting":[53,89],"poor":[55],"scalability":[56],"with":[57,83,110,120],"respect":[58],"number":[61],"robots.":[63],"This":[64],"paper":[65],"tackles":[66],"limitations":[68],"these":[70],"two":[71],"approaches":[72],"by":[73],"introducing":[74],"novel":[76],"framework":[77],"that":[78],"integrates":[79],"MAPF":[81,118],"solvers":[82],"constrained":[84,121],"generative":[85],"diffusion":[86,126],"models.":[87],"The":[88,147],"framework,":[90],"called":[91],"Discrete-Guided":[92],"Diffusion":[93],"(DGD),":[94],"has":[95],"three":[96],"key":[97],"characteristics:":[98],"(1)":[99],"it":[100,115,136],"decomposes":[101],"original":[103],"nonconvex":[104],"MRMP":[105],"problem":[106],"into":[107],"tractable":[108],"subproblems":[109],"convex":[111],"configuration":[112],"spaces,":[113],"(2)":[114],"combines":[116],"solutions":[119],"optimization":[122],"techniques":[123],"guide":[125],"models":[127],"capture":[128],"complex":[129,157],"spatiotemporal":[130],"dependencies":[131],"among":[132],"robots,":[133],"and":[134,167],"(3)":[135],"incorporates":[137],"lightweight":[139],"constraint":[140],"repair":[141],"mechanism":[142],"ensure":[144],"feasibility.":[146],"proposed":[148],"method":[149],"sets":[150],"new":[152],"state-of-the-art":[153],"performance":[154],"large-scale,":[156],"environments,":[158],"scaling":[159],"100":[161],"while":[163],"achieving":[164],"planning":[165],"efficiency":[166],"high":[168],"success":[169],"rates.":[170]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-03-18T00:00:00"}
