This work eliminates manual parameter provisioning and enables real-time adaptation, providing a self-tuning paradigm for FC storage operations, and presents an adaptive parameter tuning framework based on Extremum Seeking Control that continuously adjusts planner parameters in response to measured throughput.
Abstract
Robotic Fulfillment Centers (FCs) store inventory on shelves (pods) arranged in dense blocks. Retrieving a target pod that is buried deep in a block requires moving obstructing pods out of the way (i.e., digout). Multi-robot planners use parameterized cost functions to control digout behavior, producing a spectrum of strategies: at one extreme, obstructing pods are sent to other blocks (using more robots in travel lanes); at the other, pods are shuffled within the block (avoiding lane congestion but increasing extraction time). Each point on this spectrum has different downstream consequences for floor congestion and throughput. The optimal operating point depends on the specific facility configuration and shifts with operational conditions such as varying station demand and congestion patterns, making offline tuning impractical. We present an adaptive parameter tuning framework based on Extremum Seeking Control (ESC) that continuously adjusts planner parameters in response to measured throughput. ESC performs model-free optimization by perturbing parameters with sinusoidal dither signals and correlating perturbations with performance changes to estimate gradients, making it robust to the multi-minute delayed effects and credit assignment challenges inherent in large FC operations. Simulation studies demonstrate that the adaptive policy improves upon fixed policies across several conditions. We observe an improvement in throughput by an average of 5.0% across map and robot fleet size variations, and by 8.4% under dynamic operating conditions. This work eliminates manual parameter provisioning and enables real-time adaptation, providing a self-tuning paradigm for FC storage operations.
As more companies embrace the use of autonomous mobile robots to organize their smart warehouses, one of the
major issues facing them is the coordination of these fleets under very restrictive throughputs. Task allocation and path
planning go hand in hand: if tasks are assigned without considering congestion, then ea...
Mohanad Ibrahim Elassadi· International Journal of Inn...· 0 citations
This work considers rectangular 2D grids, where uniform-sized loads are first stored, up to full capacity, and subsequently retrieved according to prescribed arrival and departure sequences, and develops an online prioritized multi-agent path planning algorithm for this problem.
William Zhang, Tzvika Geft, Jingjin Yu et al.· 0 citations
Addressing the challenge of arranging large-scale heterogeneous cargo in modern logistics distribution, this paper constructs a static loading optimization model that integrates spatial, mechanical, and safety constraints, using a single vehicle type as the research context. By analyzing the physical properties of 3,00...
Yiyang Zhao· International Conference on...· 0 citations
Additive manufacturing (AM) enables compact hydraulic components whose internal fluid channels can follow free-form 3D paths rather than conventionally drilled holes. A representative case is multi-group channel layout in rotary direct-drive servo valves: once a channel is placed it permanently occupies volume, so late...
In the highly dynamic production environment of intelligent logistics centers, autonomous mobile robots (AMRs) serve as the core carriers connecting automated storage systems with assembly lines. Their operational efficiency directly determines the overall production cycle of the entire facility. In actual working cond...
Tai-Lin Li, Shi-Yu Wang, Bo-Te Liu et al.· Processes· 0 citations
This work model the concerned problem with the objective of minimizing fuzzy makespan and design an adaptive large-neighborhood-based variable neighborhood descent algorithm to efficiently solve it, which adopts three-dimensional coupling encoding and multi-stage heuristic decoding mechanisms.
Zhi-Heng Cai, Zi-Yan Zhao, Yue-Xing Su et al.· Mathematics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.