Pith. sign in

REVIEW 3 cited by

Learning a Decentralized Multi-arm Motion Planner

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2011.02608 v1 pith:UY335OKB submitted 2020-11-05 cs.RO cs.AIcs.CVcs.LGcs.MA

Learning a Decentralized Multi-arm Motion Planner

classification cs.RO cs.AIcs.CVcs.LGcs.MA
keywords multi-armlearningmotiondecentralizedplanningpolicysystemsteam
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We present a closed-loop multi-arm motion planner that is scalable and flexible with team size. Traditional multi-arm robot systems have relied on centralized motion planners, whose runtimes often scale exponentially with team size, and thus, fail to handle dynamic environments with open-loop control. In this paper, we tackle this problem with multi-agent reinforcement learning, where a decentralized policy is trained to control one robot arm in the multi-arm system to reach its target end-effector pose given observations of its workspace state and target end-effector pose. The policy is trained using Soft Actor-Critic with expert demonstrations from a sampling-based motion planning algorithm (i.e., BiRRT). By leveraging classical planning algorithms, we can improve the learning efficiency of the reinforcement learning algorithm while retaining the fast inference time of neural networks. The resulting policy scales sub-linearly and can be deployed on multi-arm systems with variable team sizes. Thanks to the closed-loop and decentralized formulation, our approach generalizes to 5-10 multi-arm systems and dynamic moving targets (>90% success rate for a 10-arm system), despite being trained on only 1-4 arm planning tasks with static targets. Code and data links can be found at https://multiarm.cs.columbia.edu.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Embodying Multi-Hand Manipulation Policies by Searching the Assignment and Null Spaces

    cs.RO 2026-07 conditional novelty 7.0

    A new planner, Ω-CBSA, jointly chooses which robot arm follows which hand trajectory and searches elbow/wrist null-space motions to guarantee collision-free multi-arm execution of learned manipulation policies.

  2. Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning

    cs.RO 2025-11 conditional novelty 6.0

    HaMMAR learns manifold-constrained Hamilton-Jacobi reachability value functions and uses them for decentralized collision-free multi-robot motion planning under task constraints.

  3. RoboBallet: Planning for Multi-Robot Reaching with Graph Neural Networks and Reinforcement Learning

    cs.RO 2025-09 conditional novelty 6.0

    A graph-neural-network policy trained with reinforcement learning solves joint task allocation, scheduling, and motion planning for multi-robot reaching, scaling to eight arms and 40 tasks with zero-shot generalization.