Unbounded orchestrations of transdeucers for manufacturing

Alechina, Natasha; Br�zdil, Tom�; De Giacomo, Giuseppe; Felli, Paolo; Logan, Brian; Vardi, Moshe Y.

Abstract

There has recently been increasing interest in using reactive synthesis techniques to automate the production of manufacturing process plans. Previous work has assumed that the set of manufacturing resources is known and fixed in advance. In this paper, we consider the more general problem of whether a controller can be synthesized given sufficient resources. In the unbounded setting, only the types of available manufacturing resources are given, and we want to know whether it is possible to manufacture a product using only resources of those type(s), and, if so, how many resources of each type are needed. We model manufacturing processes and facilities as transducers (automata with output), and show that the unbounded orchestration problem is decidable and the (Pareto) optimal set of resources necessary to manufacture a product is computable for uni-transducers. However, for multitransducers, the problem is undecidable.

Citation

Alechina, N., Brázdil, T., De Giacomo, G., Felli, P., Logan, B., & Vardi, M. Y. (2019). Unbounded orchestrations of transdeucers for manufacturing.

• Conference Name: Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19)
• Start Date: Jan 27, 2019
• End Date: Feb 1, 2019
• Acceptance Date: Oct 31, 2018
• Publication Date: Jan 31, 2019
• Deposit Date: Dec 7, 2018
• Publicly Available Date: Dec 7, 2018
• Publisher: Association for the Advancement of Artificial Intelligence
• Public URL: https://nottingham-repository.worktribe.com/output/1383132
• Related Public URLs: https://aaai.org/Conferences/AAAI-19/