A Unified Framework for Automated Assembly Sequence and Production Line Planning using Graph-based Optimization

• URL: http://arxiv.org/abs/2512.13219v1
• Date: Mon, 15 Dec 2025 11:32:45 GMT
• Title: A Unified Framework for Automated Assembly Sequence and Production Line Planning using Graph-based Optimization
• Abstract summary: PyCAALP is a framework for automated Assembly Sequence Planning (ASP) and Production Line Planning (PLP)<n>The framework integrates kinematic boundary conditions, such as potential part collisions, to guarantee the feasibility of automated assembly planning.<n>The framework promotes further collaboration and adoption in both industrial and production research applications.
• Score: 0.688175992229959
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper presents PyCAALP (Python-based Computer-Aided Assembly Line Planning), a framework for automated Assembly Sequence Planning (ASP) and Production Line Planning (PLP), employing a graph-based approach to model components and joints within production modules. The framework integrates kinematic boundary conditions, such as potential part collisions, to guarantee the feasibility of automated assembly planning. The developed algorithm computes all feasible production sequences, integrating modules for detecting spatial relationships and formulating geometric constraints. The algorithm incorporates additional attributes, including handling feasibility, tolerance matching, and joint compatibility, to manage the high combinatorial complexity inherent in assembly sequence generation. Heuristics, such as Single-Piece Flow assembly and geometrical constraint enforcement, are utilized to further refine the solution space, facilitating more efficient planning for complex assemblies. The PLP stage is formulated as a Mixed-Integer Program (MIP), balancing the total times of a fixed number of manufacturing stations. While some complexity reduction techniques may sacrifice optimality, they significantly reduce the MIPs computational time. Furthermore, the framework enables customization of engineering constraints and supports a flexible trade-off between ASP and PLP. The open-source nature of the framework, available at https://github.com/TUM-utg/PyCAALP, promotes further collaboration and adoption in both industrial and production research applications.

Related papers

• CAD-Based Relation Learning and Geometric-Symbolic Planning for Robotic Assembly [0.8594140167290097]
  This paper presents a hybrid ASP framework combining learning-based relation extraction with geometric-symbolic reasoning.<n>A neural network predicts semantic relations from point clouds, while human-in-the-loop verification enables correction of uncertain predictions and planning failures.<n>Results demonstrate that the proposed hybrid framework enables efficient robotic assembly sequence planning from imperfect CAD data while substantially reducing planning time.
  arXiv  Detail & Related papers  (2026-09-15T14:43:25Z)
• Sim2Schedule: A Simulator-Guided LLM Framework for Autonomous Open-Pit Mine Scheduling [1.529342790344802]
  This work introduces a simulator-driven Large Language Model (LLM) scheduling framework.<n>The framework produces complete, interpretable extraction and processing schedules without cloud-based inference, domain-specific fine-tuning, or retraining.<n>It recovers between 94% and 99% of the MILP optimal NPV while scaling linearly in time.
  arXiv  Detail & Related papers  (2026-06-09T01:20:38Z)
• PlanningBench: Generating Scalable and Verifiable Planning Data for Evaluating and Training Large Language Models [52.48858778580074]
  Planning is a fundamental capability for large language models (LLMs)<n>PlanningBench is a framework for generating scalable, diverse, verifiable planning data for both evaluation and training.
  arXiv  Detail & Related papers  (2026-05-20T08:10:15Z)
• Beyond ReAct: A Planner-Centric Framework for Complex Tool-Augmented LLM Reasoning [31.679428422518082]
  We propose a Planner-centric Plan-Execute paradigm to resolve local optimization bottlenecks.<n>A novel Planner model performs global Directed Acyclic Graph (DAG) planning for complex queries.<n>We also introduce ComplexTool-Plan, a large-scale benchmark dataset featuring complex queries.<n>When integrated with a capable executor, our framework achieves state-of-the-art performance on the StableToolBench benchmark for complex user queries.
  arXiv  Detail & Related papers  (2025-11-13T07:22:27Z)
• Vectorized Online POMDP Planning [4.097364225798782]
  POMDP is a framework for planning under partial observability problems.<n>We propose Vectorized Online POMDP Planner (VOPP), a novel parallel online solver.<n>VOPP represents all data structures related to planning as a collection of tensors and implements all planning steps as fully vectorized computations.
  arXiv  Detail & Related papers  (2025-10-31T05:21:39Z)
• Unlocking Symbol-Level Precoding Efficiency Through Tensor Equivariant Neural Network [84.22115118596741]
  We propose an end-to-end deep learning (DL) framework with low inference complexity for symbol-level precoding.<n>We show that the proposed framework captures substantial performance gains of optimal SLP, while achieving an approximately 80-times speedup over conventional methods.
  arXiv  Detail & Related papers  (2025-10-02T15:15:50Z)
• CollaPipe: Adaptive Segment-Optimized Pipeline Parallelism for Collaborative LLM Training in Heterogeneous Edge Networks [57.95170323315603]
  We introduce CollaPipe, a distributed learning framework that integrates collaborative pipeline parallelism with federated aggregation to support self-evolving networks.<n>In CollaPipe, the encoder part is adaptively partitioned into variable-sized segments and deployed across mobile devices for pipeline-parallel training, while the decoder is deployed on edge servers to handle generative tasks.<n>To enhance training efficiency, we formulate a joint optimization problem that adaptively allocates model segments, micro-batches, bandwidth, and transmission power.
  arXiv  Detail & Related papers  (2025-09-24T07:54:01Z)
• A Production Scheduling Framework for Reinforcement Learning Under Real-World Constraints [0.0]
  Real-world production environments introduce additional complexities that cause traditional scheduling approaches to be less effective.<n>Reinforcement learning (RL) holds potential in addressing these challenges, as it allows agents to learn adaptive scheduling strategies.<n>We propose a modular framework that extends classical JSSP formulations by incorporating key real-world constraints.<n>JobShopLab is an open-source tool for both research and industrial applications.
  arXiv  Detail & Related papers  (2025-06-16T14:50:26Z)
• Efficient LLM Collaboration via Planning [56.081879390960204]
  Small and large models take turns acting as planner and executor, exchanging plans in a multi-stage cascade to collaboratively solve tasks.<n>We demonstrate that COPE achieves performance comparable to large proprietary models, while drastically reducing the inference API cost.
  arXiv  Detail & Related papers  (2025-06-13T08:35:50Z)
• Syntactic and Semantic Control of Large Language Models via Sequential Monte Carlo [90.78001821963008]
  A wide range of LM applications require generating text that conforms to syntactic or semantic constraints.<n>We develop an architecture for controlled LM generation based on sequential Monte Carlo (SMC)<n>Our system builds on the framework of Lew et al. (2023) and integrates with its language model probabilistic programming language.
  arXiv  Detail & Related papers  (2025-04-17T17:49:40Z)
• Combinatorial Optimization via LLM-driven Iterated Fine-tuning [47.66752049943335]
  We present a novel way to integrate flexible, context-dependent constraints into optimization by leveraging Large Language Models (LLMs)<n>Our framework balances locally constraints with rigorous global optimization more effectively than baseline sampling methods.
  arXiv  Detail & Related papers  (2025-03-10T04:58:18Z)
• LLMs for Cold-Start Cutting Plane Separator Configuration [15.48177941218929]
  Mixed integer linear programming solvers expose hundreds of parameters that have an outsized impact on performance.<n>Existing machine learning approaches require training on thousands of related instances, poorly and can be difficult to integrate into existing solver.<n>We propose a large language model (LLM)-based framework that configures cutting plane separators using problem descriptions and solver-specific summaries.
  arXiv  Detail & Related papers  (2024-12-16T18:03:57Z)
• Control and Automation for Industrial Production Storage Zone: Generation of Optimal Route Using Image Processing [49.1574468325115]
  This article focuses on developing an industrial automation method for a zone of a production line model using the DIP. The neo-cascade methodology employed allowed for defining each of the stages in an adequate way, ensuring the inclusion of the relevant methods for its development. The system was based on the OpenCV library; tool focused on artificial vision, which was implemented on an object-oriented programming (OOP) platform based on Java language.
  arXiv  Detail & Related papers  (2024-03-15T06:50:19Z)

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.