Realisability of production recipes

de Silva, Lavindra, Felli, Paolo, Chaplin, Jack C., Logan, Brian, Sanderson, David and Ratchev, Svetan (2016) Realisability of production recipes. In: 22nd European Conference in Artificial Intelligence (ECAI 2016), 29 Aug-2 Sept 2016, The Hague, Netherlands.

Full text not available from this repository.


There is a rising demand for customised products with a high degree of complexity. To meet these demands, manufacturing lines are increasingly becoming autonomous, networked, and intelligent, with production lines being virtualised into a manufacturing cloud, and advertised either internally to a company, or externally in a public cloud. In this paper, we present a novel approach to two key problems in such future manufacturing systems: the realisability problem (whether a product can be manufactured by a set of manufacturing resources) and the control problem (how a particular product should be manufactured). We show how both production recipes specifying the steps necessary to manufacture a particular product, and manufacturing resources and their topology can be formalised as labelled transition systems, and define a novel simulation relation which captures what it means for a recipe to be realisable on a production topology. We show how a controller that can orchestrate the resources in order to manufacture the product on the topology can be extracted from the simulation relation, and give an algorithm to compute a simulation relation and a controller.

Item Type: Conference or Workshop Item (Paper)
Schools/Departments: University of Nottingham, UK > Faculty of Engineering > Department of Mechanical, Materials and Manufacturing Engineering
University of Nottingham, UK > Faculty of Science > School of Computer Science
Related URLs:
Depositing User: Chaplin, Jack
Date Deposited: 26 Jul 2016 10:42
Last Modified: 04 May 2020 18:05

Actions (Archive Staff Only)

Edit View Edit View