Multi-agent motion planning for high-degree-of-freedom robotics manipulators in shared workspaces remains a fundamental yet challenging problem. Centralized planners often suffer from poor scalability, while decentralized approaches face robustness and safety concerns. Game-theoretic formulations offer a promising approach for modeling agent interactions, potentially overcoming these limitations. However, their application to articulated multi-arm systems remains limited. This paper presents an iterative Linear Quadratic (LQ) game framework for multi-manipulator motion planning, where each manipulator is modeled as an independent agent optimizing its own objective while interacting with other agents based on shared global states and collision constraints. The method solves a series of local LQ games by linearizing the dynamics and approximating the cost around a nominal trajectory, with Riccati backward recursions yielding feedback Nash strategies. To address the challenges of articulated systems, we incorporate differentiable penalties for self-collision and inter-arm collision into the optimization pipeline, enabling coordinated, collision-aware trajectory generation. Experiments demonstrate that our framework produces smooth, safe, and efficient trajectories in high-dimensional settings, outperforming traditional methods. This highlights the effectiveness of differential game formulations for multi-robot manipulation.
Figures & tables
Test Scenarios
ILQ-Arm (Ours)
Centralized CHOMP
Best Response CHOMP
Centralized RRT*
SR ↑
PT ↓
PL ↓
SR ↑
PT ↓
PL ↓
SR ↑
PT ↓
PL ↓
SR ↑
PT ↓
PL ↓
2 agents
96.8
0.121
10.109
89.2
5.777
34.331
44.0
94.725
34.362
62.8
15.110
23.455
3 agents
87.6
0.866
14.060
80.4
17.659
31.899
26.0
130.511
28.616
56.8
15.105
16.794
4 agents
86.0
1.954
15.767
62.0
44.726
33.039
42.4
115.353
32.445
40.8
15.101
19.921
2 agents w obs
95.2
0.585
7.893
98.8
1.698
12.78
73.6
45.425
10.541
87.6
15.103
8.665
TABLE I : This table compares ILQ-Arm with the baseline methods. ILQ-Arm achieves the best overall performance in success rate, planning time, and path length. Centralized CHOMP performs reasonably well but is computationally expensive and scales poorly as the number of agents increases. NeHMO achieves moderate success rates but produces less efficient solutions with longer paths. In contrast, ILQ-Arm consistently scales to complex scenarios while maintaining high success rates and the lowest planning times, demonstrating its effectiveness for multi-agent rearrangement.
Fig. 2 : This figure illustrates representative test scenarios, including the 4-agent setup, the 2-agent case with obstacles, and the NeHMO benchmarks with 2 and 3 agents.
Fig. 3 : The figure shows a multi-agent motion planning. Each key-frame illustrates the system’s motion, with the corresponding time step indicated in the upper-right corner. At way-points 1 and 2, the robots demonstrate effective inter-robot collision avoidance while simultaneously optimizing their trajectories toward the final configuration. Our ILQ-Arm finds collision free solution in 0.05 seconds, while the execution lasted 45 seconds.
Test Scenarios
ILQ-Arm (Ours)
ILQ-Arm w/o self-collision
ILQ-Arm w Pseudo-Huber
ILQ-Arm w running goal
SR ↑
#CL ↓
PT ↓
PL ↓
#CL ↓
PT ↓
PL ↓
SR ↑
PT ↓
PL ↓
SR ↑
PT ↓
PL ↓
2 agents
86.4
0
0.659
7.668
31
0.0950
7.649
86.4
0.656
7.668
74.4
1.689
9.154
3 agents
78.4
0
1.734
14.206
17
1.123
14.177
74.0
1.713
14.177
25.2
7.408
15.160
4 agents
84.0
0
2.287
14.906
16
1.466
14.907
82.8
2.781
14.909
37.6
8.414
17.590
2 agents w obs
86.4
0
1.343
7.910
19
0.545
7.943
86.4
1.304
7.910
67.6
1.480
9.277
TABLE II : The ablation study highlights the importance of the control cost, terminal goal cost, and self-collision penalty in multi-agent motion planning. Removing the self-collision term reduces computation time but eliminates collision-free guarantees, making the planner unsafe for real-world use. Overall, the full ILQ-Arm formulation achieves the best balance of success rate, collision avoidance, planning time, and path length. These results demonstrate that all cost components are necessary for reliable, efficient, and dynamically consistent motion planning.
Multi-robot systems provide the parallelism and redundancy necessary for long-horizon tasks, while Large Language Models (LLMs) offer the reasoning capabilities to decompose these objectives into actionable plans. However, effectively grounding this high-level reasoning in physical multi-robot execution remains an open challenge. Existing LLM-based approaches fall mainly into two categories: Single-robot methods achieve robust contact-rich manipulation but lack the coordination mechanisms required for tasks spanning multiple workspaces. Current multi-robot frameworks focus on high-level planning, often treating manipulation as an idealized primitive that fails to account for real-world execution uncertainties. To address this, we propose a hierarchical closed-loop agentic LLM-based framework to ensure robust multi-robot manipulation. Our system consists of three specialized agents: the Planning Agent decomposes instructions into allocated sub-tasks, the Manipulation Agent for each robot executes actions via adaptive tool use, and the Verification Agent closes the loop by monitoring physical outcomes and feeding back semantic corrections. Extensive real-world experiments demonstrate that our framework achieves superior success rates, ensures robust adaptability ranging from single to cross workspace manipulation, and offers a generalizable approach for diverse manipulation tasks.
Yi-Xiang He, Lan Wei, Haoming Cen +6
Sun Yat-sen University · Key Laboratory of Machine Intelligence and Advanced Computing, Ministry of Education, China
Learned manipulation policies increasingly predict motions for abstract "hands" and are attractive in practice because they rely on easily collected demonstrations and transfer across robot platforms. Executing these trajectories on multi-arm robots, however, is not trivial. Multi-hand policy outputs must be assigned to physical arms, each arm must realize a configuration-space motion that tracks its prescribed end-effector trajectory, and all arms must respect kinematic limits and avoid collisions. In the absence of algorithms that directly address this problem, practitioners typically extend single-arm inverse-kinematics (IK) pipelines in an ad hoc way, with no guarantees of feasibility or safety. In this work, we close this execution gap with a search-based framework that is theoretically complete for grounding policy-generated multi-hand trajectories onto physical multi-arm systems. Building on Conflict-Based Search, our method explicitly searches over both the discrete assignment of trajectories to arms and the continuous Jacobian null spaces of redundant manipulators, using redundancy to avoid inter-arm collisions while tracking the prescribed motions. This unified treatment of assignment and null-space motion yields a practically efficient planner that safely realizes coordinated manipulation-policy outputs on multi-arm robots. See omcbsa.github.io for more.
Yorai Shaoul, Jiaoyang Li, Maxim Likhachev
The Robotics Institute, Carnegie Mellon University
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