Spillover Algorithm: A Decentralized Coordination Approach for Multi-Robot Production Planning in Open Shared Factories
Marin Lujak, Alberto Fern\'andez, Eva Onaindia

TL;DR
This paper introduces the Spillover Algorithm, a novel decentralized method for multi-robot production planning in open factories, effectively coordinating multiple stakeholders while safeguarding private information.
Contribution
It presents the first decentralized algorithm for multi-robot production planning in multi-stakeholder environments, addressing privacy concerns and computational efficiency.
Findings
Outperforms centralized methods in privacy preservation.
Achieves comparable or better solutions than commercial solvers.
Demonstrates scalability in complex factory scenarios.
Abstract
Open and shared manufacturing factories typically dispose of a limited number of robots that should be properly allocated to tasks in time and space for an effective and efficient system performance. In particular, we deal with the dynamic capacitated production planning problem with sequence independent setup costs where quantities of products to manufacture and location of robots need to be determined at consecutive periods within a given time horizon and products can be anticipated or backordered related to the demand period. We consider a decentralized multi-agent variant of this problem in an open factory setting with multiple owners of robots as well as different owners of the items to be produced, both considered self-interested and individually rational. Existing solution approaches to the classic constrained lot-sizing problem are centralized exact methods that require sharing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
