PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
September 10, 2025Science Robotics15 citations

RoboBallet: Planning for multirobot reaching with graph neural networks and reinforcement learning

View Full Paper
MLMatthew LaiKGKeegan GoZLZhibin Li

Key Points

  • Automated task allocation improves performance in collision-prone environments, enabling efficient multi-robot coordination.
  • The framework employs a graph neural network policy, trained through reinforcement learning for trajectory generation.
  • Simulation tests involved eight robots executing 40 reaching tasks, illustrating the approach's effectiveness in dynamic settings.
  • Enhanced planning speed and scalability may facilitate adaptive responses and workcell optimization in industrial applications.

Abstract

Modern robotic manufacturing requires collision-free coordination of multiple robots to complete numerous tasks in shared, obstacle-rich workspaces. Although individual tasks may be simple in isolation, automated joint task allocation, scheduling, and motion planning under spatiotemporal constraints remain computationally intractable for classical methods at real-world scales. Existing multiarm systems deployed in industry rely on human intuition and experience to design feasible trajectories manually in a labor-intensive process. To address this challenge, we propose a reinforcement learning (RL) framework to achieve automated task and motion planning, tested in an obstacle-rich environment with eight robots performing 40 reaching tasks in a shared workspace, where any robot can perform any task in any order. Our approach builds on a graph neural network (GNN) policy trained via RL on procedurally generated environments with diverse obstacle layouts, robot configurations, and task distributions. It uses a graph representation of scenes and a graph policy neural network trained through RL to generate trajectories of multiple robots, jointly solving the subproblems of task allocation, scheduling, and motion planning. Trained on large randomly generated task sets in simulation, our policy generalizes zero-shot to unseen settings with varying robot placements, obstacle geometries, and task poses. We further demonstrate that the high-speed capability of our solution enables its use in workcell layout optimization, improving solution times. The speed and scalability of our planner also open the door to capabilities such as fault-tolerant planning and online perception-based replanning, where rapid adaptation to dynamic task sets is required.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Lai et al. (2025) studied this question.

synapsesocial.com/papers/68c188579b7b07f3a06123adhttps://doi.org/10.1126/scirobotics.ads1204
Ask AI
Helpful
Bookmark
Share
View Full Paper