Large-Scale Multi-Robot Assembly Planning for Autonomous Manufacturing
- URL: http://arxiv.org/abs/2311.00192v1
- Date: Tue, 31 Oct 2023 23:42:14 GMT
- Title: Large-Scale Multi-Robot Assembly Planning for Autonomous Manufacturing
- Authors: Kyle Brown, Dylan M. Asmar, Mac Schwager, and Mykel J. Kochenderfer
- Abstract summary: Mobile autonomous robots have the potential to revolutionize manufacturing processes.
employing large robot fleets in manufacturing requires addressing challenges including collision-free movement in a shared workspace.
We propose a full algorithmic stack for large-scale multi-robot assembly planning that addresses these challenges and can synthesize construction plans for complex assemblies with thousands of parts in a matter of minutes.
- Score: 45.270764017583346
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Mobile autonomous robots have the potential to revolutionize manufacturing
processes. However, employing large robot fleets in manufacturing requires
addressing challenges including collision-free movement in a shared workspace,
effective multi-robot collaboration to manipulate and transport large payloads,
complex task allocation due to coupled manufacturing processes, and spatial
planning for parallel assembly and transportation of nested subassemblies. We
propose a full algorithmic stack for large-scale multi-robot assembly planning
that addresses these challenges and can synthesize construction plans for
complex assemblies with thousands of parts in a matter of minutes. Our approach
takes in a CAD-like product specification and automatically plans a full-stack
assembly procedure for a group of robots to manufacture the product. We propose
an algorithmic stack that comprises: (i) an iterative radial layout
optimization procedure to define a global staging layout for the manufacturing
facility, (ii) a graph-repair mixed-integer program formulation and a modified
greedy task allocation algorithm to optimally allocate robots and robot
sub-teams to assembly and transport tasks, (iii) a geometric heuristic and a
hill-climbing algorithm to plan collaborative carrying configurations of robot
sub-teams, and (iv) a distributed control policy that enables robots to execute
the assembly motion plan collision-free. We also present an open-source
multi-robot manufacturing simulator implemented in Julia as a resource to the
research community, to test our algorithms and to facilitate multi-robot
manufacturing research more broadly. Our empirical results demonstrate the
scalability and effectiveness of our approach by generating plans to
manufacture a LEGO model of a Saturn V launch vehicle with 1845 parts, 306
subassemblies, and 250 robots in under three minutes on a standard laptop
computer.
Related papers
- COHERENT: Collaboration of Heterogeneous Multi-Robot System with Large Language Models [49.24666980374751]
COHERENT is a novel LLM-based task planning framework for collaboration of heterogeneous multi-robot systems.
A Proposal-Execution-Feedback-Adjustment mechanism is designed to decompose and assign actions for individual robots.
The experimental results show that our work surpasses the previous methods by a large margin in terms of success rate and execution efficiency.
arXiv Detail & Related papers (2024-09-23T15:53:41Z) - Robotic warehousing operations: a learn-then-optimize approach to large-scale neighborhood search [84.39855372157616]
This paper supports robotic parts-to-picker operations in warehousing by optimizing order-workstation assignments, item-pod assignments and the schedule of order fulfillment at workstations.
We solve it via large-scale neighborhood search, with a novel learn-then-optimize approach to subproblem generation.
In collaboration with Amazon Robotics, we show that our model and algorithm generate much stronger solutions for practical problems than state-of-the-art approaches.
arXiv Detail & Related papers (2024-08-29T20:22:22Z) - A Meta-Engine Framework for Interleaved Task and Motion Planning using Topological Refinements [51.54559117314768]
Task And Motion Planning (TAMP) is the problem of finding a solution to an automated planning problem.
We propose a general and open-source framework for modeling and benchmarking TAMP problems.
We introduce an innovative meta-technique to solve TAMP problems involving moving agents and multiple task-state-dependent obstacles.
arXiv Detail & Related papers (2024-08-11T14:57:57Z) - RoboScript: Code Generation for Free-Form Manipulation Tasks across Real
and Simulation [77.41969287400977]
This paper presents textbfRobotScript, a platform for a deployable robot manipulation pipeline powered by code generation.
We also present a benchmark for a code generation benchmark for robot manipulation tasks in free-form natural language.
We demonstrate the adaptability of our code generation framework across multiple robot embodiments, including the Franka and UR5 robot arms.
arXiv Detail & Related papers (2024-02-22T15:12:00Z) - RoboGen: Towards Unleashing Infinite Data for Automated Robot Learning via Generative Simulation [68.70755196744533]
RoboGen is a generative robotic agent that automatically learns diverse robotic skills at scale via generative simulation.
Our work attempts to extract the extensive and versatile knowledge embedded in large-scale models and transfer them to the field of robotics.
arXiv Detail & Related papers (2023-11-02T17:59:21Z) - Cooperative Task and Motion Planning for Multi-Arm Assembly Systems [32.56644393804845]
Multi-robot assembly systems are becoming increasingly appealing in manufacturing.
Planning for these systems in a manner that ensures each robot is simultaneously productive, and not idle, is challenging.
We present a task and motion planning framework that jointly plans safe, low-makespan plans for a team of robots to assemble complex spatial structures.
arXiv Detail & Related papers (2022-03-04T18:12:49Z) - Predicting Sample Collision with Neural Networks [5.713670854553366]
We present a framework to address the cost of expensive primitive operations in sampling-based motion planning.
We evaluate our framework on multiple planning problems with a variety of robots in 2D and 3D workspaces.
arXiv Detail & Related papers (2020-06-30T14:56:14Z) - Optimal Sequential Task Assignment and Path Finding for Multi-Agent
Robotic Assembly Planning [42.38068056643171]
We study the problem of sequential task assignment and collision-free routing for large teams of robots in applications with inter-task precedence constraints.
We propose a hierarchical algorithm for computing makespan-optimal solutions to the problem.
arXiv Detail & Related papers (2020-06-16T00:45:07Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.