Akule Sapphire/Ice fish logoAkule

Fast and Scalable Multi-Robot Motion Planning via Sparse Interaction Diffusion

Akule learns which pairwise interactions to evaluate and how to combine their corrections for efficient planning across robot team sizes.

Canonical WeaveN=28 · MPD / MMD / Akule
Canonical Weave · complete qualitative comparisonExplore eight benchmark families ↗

Sparse Interaction Diffusion

Independent robot trajectories can conflict. Evaluating every ordered pair at every diffusion step becomes expensive as the team grows.

Akule separates which interactions to evaluate from how to combine their corrections. A frozen single-robot prior provides motion proposals; learned selection and signed composition coordinate them before downstream validation and repair.

Abstract

Diffusion models provide expressive trajectory priors for multi-robot motion planning (MRMP), but scaling them to large teams requires coordinating individual motions without expensive joint computation. We introduce Akule, a sparse interaction diffusion framework that augments a frozen single-robot prior with three learned modules: a reusable pairwise correction model Rφ, a contextual selector Uψ that determines which corrections to evaluate, and a composer Gω that combines their effects through context-dependent signed weights. This decomposition separates which interactions merit computation from how their effects should be combined into coordinated denoising updates. We train Rφ using matched pairwise trajectory optimizations, then learn Gω and Uψ from physically optimized joint trajectories without requiring a prescribed ground-truth interaction graph. The resulting joint proposals are passed to a downstream search-based planner for validation and repair. Across diverse MRMP benchmarks, Akule achieves competitive planning success, complete-planner speedups of up to 25×, zero-shot population transfer, and successful planning with up to 256 robots. Ablations further demonstrate that learned selection and composition reduce pre-repair conflicts and downstream repair effort relative to heuristic selection and uniform summation. Project website: https://akule-diff.github.io/

Learned Interaction Selection and Composition

Contextual interaction selectionSix robot states with faint candidate edges. Selected directed edges change as the team state evolves; moving blue dots indicate evaluation of only the selected pairwise corrections.Team context → directed selection → pairwise correction
Evaluate R on selected pairs
Uψ · SELECT

Contextual interaction selection

The selector chooses a directed graph from trajectory and team context. Only selected pairs are passed to the expensive correction model R.

Context-aware signed compositionThree correction vectors are weighted by positive, attenuated, and negative coefficients. The dark arrow is their exact vector sum. This is a schematic, not a robot trajectory.Uniform summationSigned composition Σ RᵢⱼΣ αᵢⱼ RᵢⱼSchematic correction coordinates · dark arrow = sum
Amplify · attenuate · reverse
α₁ = +1.30α₂ = +0.25α₃ = −0.70
Gω · COMPOSE

Context-aware signed composition

The composer can amplify, attenuate, or reverse selected corrections. Context-dependent coefficients replace uniform summation; the resulting sum enters the denoising update.

Akule Architecture

Shared parameters and symmetric aggregation make the architecture permutation equivariant and usable across team sizes.

A frozen unary prior with learned pairwise corrections, interaction selection, signed composition, and downstream repair.
  1. 01

    Propose

    A frozen single-robot prior predicts goal-conditioned motion.

  2. 02

    Select

    U selects a directed graph using trajectory and team context.

  3. 03

    Correct

    The reusable R model evaluates only selected pairwise interactions.

  4. 04

    Compose

    G combines corrections through context-dependent signed weights.

  5. 05

    Repair

    Downstream search validates the joint proposal and repairs conflicts.

Weave and SMD use interaction-aware reverse-diffusion rollouts. Highways and Conveyor apply one interaction correction at t=0 to selected independently generated candidates.

Contextual interaction selection: score candidate edges before evaluating pairwise corrections.
Context-aware signed composition: amplify, attenuate, or reverse selected corrections before the reverse update.

Benchmark Results

Final manuscript results across eight environments and 44 environment–population configurations.

25×

Up to 25× planning speedup

Complete-planner speedups across the evaluated benchmark settings.

256

Planning with 256 robots

The paper reports 8/10 successful ScaledWeave tasks at N=256.

28 → 10

Zero-shot population transfer

One Weave coordination model, trained at N=28 and evaluated unchanged at N=20 and N=10.

Population transfer and pre-repair collision reductions on matched scenes and noise. The collision comparison covers 39 populations and 2,000 paired scenes.
ScaledWeave planning latency and latency per robot. MPD and MMD-xECBS time out on every scene from N=64.
Sparse versus dense Akule across all 44 matched conditions: pairwise evaluations avoided, complete planning time, and mean path length.

Results by environment and team size

View this comparison ↓

P/A: path length / acceleration. Values and reported precision are preserved from the manuscript. Download table data ↗

Implementation and Reproducibility

Download the frozen checkpoints and evaluate saved scenes with benchmark-specific inference and repair.

Explore the Akule repository ↗
QuickstartPython 3.9 · CUDA
GIT_LFS_SKIP_SMUDGE=1 git clone https://github.com/akule-diff/Akule.git
cd Akule
uv sync --locked
uv run python scripts/download_checkpoints.py --env weave
uv run python scripts/evaluate.py --env weave --n 28 \
  --mode sparse --repair

Installation & requirements ↗

Citation

@misc{akule2027,
  title = {Akule: Fast and Scalable Multi-Robot Motion
           Planning via Sparse Interaction Diffusion},
  author = {Anonymous},
  year = {2027}
}

Research figure

Open full resolution ↗