Sep 2026· IEEE International Conference on Emerging Technologies and Factory Automation· pp. 1-8· 0 citations· 14 references
TL;DR
An assembly-specific planning method that achieves makespans competitive with reference methods while substantially reducing per-configuration cost is presented, indicating the method's suitability for large-scale design-space exploration.
Abstract
Designing a multi-robot assembly cell requires evaluating many candidate structural configurations. These configurations differ in robot set, robot placement, tooling, and the layout of task-relevant resources. Their performance is measured by the makespan of the best assembly procedure they admit. Procedure generation requires jointly solving task-to-robot assignment, sequencing, scheduling, and collision-aware motion planning, making the evaluation computationally expensive. Existing methods target single fixed configurations and do not support efficient repeated evaluation across design alternatives. This paper presents an assembly-specific planning method for that purpose. Assembly tasks are decomposed into discretized motion primitives with precomputed pairwise collision relations. For each candidate design, executable procedures are generated under collision-free constraints and evaluated by makespan. A structural change invalidates only the directly affected primitives, enabling selective reuse of the collision memory across structurally different cell configurations. The method achieves makespans competitive with reference methods while substantially reducing per-configuration cost. A sweep of 3675 candidate component layouts is completed in 6.3 hours, indicating the method's suitability for large-scale design-space exploration.
Wrap is presented, a multi-robot assembly planner for multi-part assemblies, given the inter-part ordering-dependencies, the part meshes, and their initial state, and a linear program is formulated to reason about valid grasps for supporting the forces that occur during assembly.
V. N. Hartmann, Hua-Peng Su, Yi-Jiang Huang et al.· 0 citations
Assembling a welded steel structure with robots requires deciding whether an entire assembly—dozens of parts, each needing a collision-free pick-up, press-fit placement, and welding—is executable at all, and under which positioning of the workpiece. We describe and evaluate the planning system deployed in an industrial...
M. Bulganbayev, R. Suliyev, N. M. Fonseca Ferreira et al.· Robotics· 0 citations
Humanoid and service robots operating in clut- tered human environments may encounter motion planning problems that are infeasible when all surrounding objects are treated as fixed obstacles. The Minimum Constraint Removal problem, which we refer to as MCR, addresses this situation by identifying the minimum number of...
Antony Thomas, Fulvio Mastrogiovanni, M. Baglietto· 0 citations
Multi-robot systems have shown increasing viability in construction due to their ability to execute high-precision actions while reducing human exposure to hazardous tasks. However, these environments have high-dimensional configuration spaces and possess substantial collision-avoidance constraints, which include other...
Karthik Shaji, Chisung Kim, John D'Amato et al.· 0 citations
A trajectory planning method that shifts the most resource-intensive geometric constraint processing operations from the real-time planning stage to a preprocessing stage by precomputing constraints in the generalized coordinate space is proposed.
L. Rybak, D. Malyshev, Dmitry Dyakonov et al.· Machines· 0 citations
Robots have significant potential to automate construction processes. However, their industry adoption remains limited, partly because of the programming effort required to adapt robots to diverse tasks. This paper presents a skill sequence planning method that enables a heterogeneous team of multi-functional robots to...
Xi Wang, Bo Fu, Carol C. Menassa et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.