MultiRobot Motion Planning Based on Diffusion and Time–Space Path Planning

ABSTRACT Diffusion‐based motion planning has shown strong capability in modelling complex, multimodal trajectory distributions through guided sampling. However, existing diffusion‐based planners primarily focus on single‐robot settings and do not readily extend to multirobot scenarios due to the rapidly growing trajectory dimensionality and the challenge of handling inter‐robot collisions. We propose a diffusion‐based framework for multirobot motion planning that explicitly accounts for inter‐robot interactions during trajectory generation. Instead of jointly modelling all robot trajectories in a single high‐dimensional diffusion process, our method reuses a pretrained single‐robot Motion Planning Diffusion (MPD) model and employs an alternating trajectory generation scheme guided by inter‐robot collision costs. This results in a Gibbs‐style inference procedure for coordinated multirobot planning without additional multirobot training. To resolve residual conflicts caused by temporal coupling, we further introduce a temporal coordination module based on time–space search that searches for a collision‐free execution schedule while preserving the geometric structure of the generated trajectories. Experimental results in simulated multirobot manipulation environments show that the proposed approach achieves the best average success rates among the tested methods under fixed time budgets.

Authors

Institutions

Publication Details

Journal
Artificial Intelligence for Engineering
Published
2026-06-30
DOI
https://doi.org/10.1049/aie2.70022
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MultiRobot Motion Planning Based on Diffusion and Time–Space Path Planning

Sheng‐Jen Hsieh, Cheng Niu, Tianle Zhang
Artificial Intelligence for Engineering
Robotic Path Planning Algorithms
article

MultiRobot Motion Planning Based on Diffusion and Time–Space Path Planning

Sheng‐Jen Hsieh, Cheng Niu, Tianle Zhang
article en

Abstract

ABSTRACT Diffusion‐based motion planning has shown strong capability in modelling complex, multimodal trajectory distributions through guided sampling. However, existing diffusion‐based planners primarily focus on single‐robot settings and do not readily extend to multirobot scenarios due to the rapidly growing trajectory dimensionality and the challenge of handling inter‐robot collisions. We propose a diffusion‐based framework for multirobot motion planning that explicitly accounts for inter‐robot interactions during trajectory generation. Instead of jointly modelling all robot trajectories in a single high‐dimensional diffusion process, our method reuses a pretrained single‐robot Motion Planning Diffusion (MPD) model and employs an alternating trajectory generation scheme guided by inter‐robot collision costs. This results in a Gibbs‐style inference procedure for coordinated multirobot planning without additional multirobot training. To resolve residual conflicts caused by temporal coupling, we further introduce a temporal coordination module based on time–space search that searches for a collision‐free execution schedule while preserving the geometric structure of the generated trajectories. Experimental results in simulated multirobot manipulation environments show that the proposed approach achieves the best average success rates among the tested methods under fixed time budgets.

Artificial Intelligence for Engineering
Texas A&M University (US)
National Science Foundation
Openalex Percentile: Top 8%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.