Scheduling and Path Planning Algorithms for a Rotary Packaging System with Delta Pickers

The throughput of commercial packaging systems is inherently constrained to approximately two picks per second per picker due to fundamental physical limitations. This paper presents a novel rotary packaging system that leverages optimized scheduling and path planning algorithms to overcome these constraints. Initially, an overview of the mechanical design is provided, and the notation to define the problem setting is given. Based on this, the scheduling and path planning algorithms are systematically derived. Each pick and place process is decomposed into five distinct phases, alternating between constrained optimal paths and belt synchronization, respectively. Direct collocation is employed to compute the optimal paths. The proposed approach is validated through numerical simulations and experimental testing on a physical demonstrator. Finally, potential directions for further performance improvements and system enhancements are discussed.

Authors

Institutions

Publication Details

Published
2025-08-25
DOI
https://doi.org/10.1109/ccta53793.2025.11151282
Citations
1
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
1.24
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scheduling and Path Planning Algorithms for a Rotary Packaging System with Delta Pickers

F. Kerber, Stefan Fischer
1 citations
Advanced Manufacturing and Logistics Optimization
1.24
article

Scheduling and Path Planning Algorithms for a Rotary Packaging System with Delta Pickers

F. Kerber, Stefan Fischer
article en
1 citations

Abstract

The throughput of commercial packaging systems is inherently constrained to approximately two picks per second per picker due to fundamental physical limitations. This paper presents a novel rotary packaging system that leverages optimized scheduling and path planning algorithms to overcome these constraints. Initially, an overview of the mechanical design is provided, and the notation to define the problem setting is given. Based on this, the scheduling and path planning algorithms are systematically derived. Each pick and place process is decomposed into five distinct phases, alternating between constrained optimal paths and belt synchronization, respectively. Direct collocation is employed to compute the optimal paths. The proposed approach is validated through numerical simulations and experimental testing on a physical demonstrator. Finally, potential directions for further performance improvements and system enhancements are discussed.

Technische Hochschule Augsburg (DE), University of Augsburg (DE)
Openalex Percentile: Top 15%
Advanced Manufacturing and Logistics Optimization
1.24
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.