In multi-robot manipulation, an action's value depends on how teammates respond. We present \method{} (Cooperative Action--Response Belief Estimation), a framework for learning team-response beliefs from local history. A predictive belief encoder represents the interaction and conditions a nominal action. Matched reactive and replay continuations separate each candidate's direct advantage from the utility contributed by teammate adaptation. A candidate-conditioned readout learns this response distribution alongside total advantage, and calibrated selection chooses an alternative or retains the nominal action. Our analysis characterizes when response changes the preferred action and how prediction and source errors limit the recoverable gain. With the representation, proposals, and data fixed, explicit response supervision improves candidate ranking and reduces selection regret relative to learning the same information through branch utilities. The benefit is concentrated in decisions where teammate adaptation changes the preferred action. Across RoboFactory, the MARS Control Track, and physical collaboration tasks, CARE achieves the highest average success among the evaluated policies, combining a capable nominal policy with selective coordination adjustments. Together, these results show that CARE turns predictions of teammate adaptation into effective decentralized action selection. Project page: https://jeong-zju.github.io/care/.
Figures & tables
Fig. 2: CARE learns and acts on team-response beliefs. A predictive belief encoder represents the interaction from local history and conditions the nominal action (left). Paired reactive and replay contrasts distinguish teammate adaptation from direct effects through R=A−D (center). A candidate-conditioned readout estimates these advantages from the learned representation, which remains fixed during response learning. Calibrated selection chooses a supported alternative or retains u0 (right). Execution requires only local history.
Fig. 3: Collaborative tasks in RoboFactory. Representative sequences of the six tasks with teams of two to four robots.
RoboFactory
Policy
LB 2
CA 3
LP 4
TP 4
PS 2
PF 2
Avg.
No external robot-action pretraining
ACT [ 8 ]
90
50
80
0
5
100
54.17
Diffusion Policy [ 9 ]
65
20
0
5
0
35
20.83
LatentToM † [ 2 ]
100
35
95
35
95
75
72.50
GauDP † [ 3 ]
70
10
0
0
0
70
25.00
TABLE I: Closed-loop SR (%) on RoboFactory and the MARS Control Track.
Γ (utility units)
Recov. ↑
Regret ↓
Stratum
n
Mean
Median
P90
Direct
Total
Branches
CARE
Direct
Total
Branches
CARE
Response-dependent
108
0.0124
0.0108
0.0240
0.060
0.390
0.450
0.560
0.0076
0.0059
0.0054
0.0046
positive reversal
68
0.0148
0.0131
0.0265
0.040
0.440
0.500
0.630
0.0084
0.0054
0.0049
0.0039
negative reversal
40
0.0083
0.0074
0.0178
0.090
0.305
0.365
0.440
0.0062
0.0068
0.0063
0.0058
Response-invariant
72
0
0
0
0.000
0.000
0.000
0.000
0.0000
0.0012
0.0010
0.0009
All decisions
180
0.0074
0.0065
0.0180
0.036
0.234
0.270
0.336
0.0046
0.0040
0.0036
0.0031
TABLE II: Response strata on the 180 held-out decisions under trajectory-grouped cross-validation.
Fig. 4: Teammate response matters for action selection. From the same Lift Barrier configuration (left), the default action drops the barrier (top right), while CARE’s response-aware selection follows the teammate’s upward motion and completes the lift (bottom right).
Proposals / selector
SR ↑
Recov. ↑
Regret ↓
OR
Perturbed / CARE
84.2
0.450
0.0055
6.5
CARE / Random
63.3
0.140
0.0086
96.7
CARE / Direct-only
80.0
0.040
0.0096
42.0
CARE / Total-only
81.7
0.280
0.0072
28.0
CARE / CARE
85.8
0.520
0.0048
6.0
Supervision variant
SR ↑
R MAE ↓
Rank ↑
Regret ↓
TABLE III: Mechanism studies with fixed proposals.
Fig. 5: CARE on two physical collaboration tasks. In Opening Box (top), one arm supports the lid and waits while its partner grasps and places the object. In Folding Bed (bottom), one arm holds the quilt edge and waits for the partner to regrasp. Keyframes highlight sustained support and waiting.
Selector
OR (%)
SR (%) ↑
Nominal path (selector off)
0.0
80.8
Posterior mean
98.0
42.5
Uncalibrated lower quantile
38.0
78.3
Candidate-wise calibration
18.0
89.2
Simultaneous calibration
6.0
85.8
CARE (+ safety filter)
6.0
85.8
TABLE IV: Selection rules with the same trained response readout.
Fig. 6: Response-readout ablations across three seeds. Mean paired differences from CARE with 95% bootstrap intervals on the snapshot split (circles) and trajectory-grouped CV (diamonds). Table III reports one deployed seed, not these three-seed means. Upper rows vary the supervision targets and lower rows the coupling.
Collaborative manipulation requires robots to perform complementary actions as interactions unfold. We study single-policy decentralized collaboration: every robot runs the same policy from its visual observations and proprioception, without task prompts, identity labels, or inter-robot messages. The challenge is to learn complementary team behaviors within shared parameters and select appropriate actions from each robot's local observations. We introduce CoRE, which learns Collaboration-Role Experts from pooled multi-task, multi-robot demonstrations. Fused appearance and geometry provide local interaction evidence. Query-conditioned cross-attention experts provide adaptable prediction paths, which a local router combines at each action-chunk position. During training, an action-expert alignment loss supervises expert selection using relative forced-route prediction errors against demonstrations under fixed inputs, without role labels. Across simulation benchmarks, CoRE achieves the highest average performance among evaluated decentralized methods. Physical experiments demonstrate effective collaboration across diverse manipulation tasks and robustness to partner delays and slowdowns. Project page: https://aus.bot/research/core/.
Yanan Zhou, Zhaoyan Qian, Zihao Li +3
School of Computer Science, The University of Sydney, Australia. · College of Computer Science and Technology, Zhejiang University of Technology, China.
Multi-arm manipulation demands precise spatiotemporal coordination, yet many centralized approaches scale poorly as team size increases. To address this, we propose CLS-DP, a decentralized multi-agent framework that enables implicit coordination under partial observability without shared global views, explicit state information, or inter-agent communication. Under the centralized training and decentralized execution (CTDE) paradigm, CLS-DP distills privileged multi-agent dynamics into a latent space. At deployment, each agent infers a collaborative latent from its local RGB observation and a shared task instruction; it then conditions the diffusion denoising process on this latent. This design enables implicit coordination with a per-agent cost independent of team size. Across six RoboFactory benchmark tasks spanning two to four agents, CLS-DP achieves a 38% mean success rate, outperforming the best centralized baseline (20%) and a decentralized ablation without the collaborative latent (9%). It also maintains superior parameter efficiency across all agent configurations. Attribution maps show that an agent conditioned on the collaborative latent places high attribution on the joints and grippers of both itself and its teammates throughout execution. This suggests that the learned latent efficiently encodes collaborative dynamics from local observation, which facilitates implicit coordination in realistic settings characterized by partial observability.
Chanyoung Park, Minsung Yoon, Andrew Jeong +1
School of Computing at the Korea Advanced Institute of Science and Technology (KAIST), Daejeon, 34141, Republic of Korea
Learning a collective policy for state-based Cartesian manipulation across diverse robotic embodiments presents a fundamental challenge due to embodiment-dependent transition dynamics. Collective learning aggregates multi-robot experience to discover shared task structure, yet naive aggregation can average incompatible action modes when different embodiments realize the same Cartesian command through different transition behavior. This leads to strategy ambiguity and performance collapse on dynamically outlying embodiments. To address this, we propose PACE, a two-stage collective learning framework that separates shared task-space intent from embodiment-dependent transition dynamics. The first stage employs a representation layer pre-trained on offline trajectories to extract task-level context from collective data. The second stage introduces a decision layer equipped with a predictive dynamics adapter. By forcing the latent state to predict future transitions, this adapter acts as a latent regularizer that grounds the policy in the transition behavior of the executing robot while preserving real-time inference without online planning. Evaluations across simulated embodiments demonstrate that our method prevents performance collapse on distinct robots. It achieves over 93% overall success and 89% on dynamically out-of-distribution zero-shot simulated robots, outperforming the Transformer behavior cloning (82%) and diffusion policy baselines (66%). Physical KUKA deployment further validates the feasibility of the full state-based pipeline under zero-shot sim-to-real transfer.
Shaocheng Liu, Yuan Meng, Zhenshan Bing +1
School of Computation, Information and Technology, Technical University of Munich, Garching, Germany. · State Key Laboratory for Novel Software Technology and the School of Science and Technology, Nanjing University (Suzhou Campus), China.