A k-nearest neighbour technique for experience-based adaptation of assembly stations
View/ Open
Accepted manuscript (498.1Kb)
Download
Publication date
2014-01Rights
© 2014 Brazilian Society for Automatics–SBA. This is a post-peer-review, pre-copyedit version of an article published in Journal of Control, Automation and Electrical Systems. The final authenticated version is available online at: https://doi.org/10.1007/s40313-014-0142-6 from Springer website.Peer-Reviewed
YesOpen Access status
openAccessAccepted for publication
2014-06-27
Metadata
Show full item recordAbstract
We present a technique for automatically acquiring operational knowledge on how to adapt assembly systems to new production demands or recover from disruptions. Dealing with changes and disruptions affecting an assembly station is a complex process which requires deep knowledge of the assembly process, the product being assembled and the adopted technologies. Shop-floor operators typically perform a series of adjustments by trial and error until the expected results in terms of performance and quality are achieved. With the proposed approach, such adjustments are captured and their effect on the station is measured. Adaptation knowledge is then derived by generalising from individual cases using a variant of the k-nearest neighbour algorithm. The operator is informed about potential adaptations whenever the station enters a state similar to one contained in the experience base, that is, a state on which adaptation information has been captured. A case study is presented, showing how the technique enables to reduce adaptation times. The general system architecture in which the technique has been implemented is described, including the role of the different software components and their interactions.Version
Accepted manuscriptCitation
Scrimieri D, Ratchev SM (2014) A k-Nearest Neighbour Technique for Experience-Based Adaptation of Assembly Stations. Journal of Control, Automation and Electrical Systems. 25 (6): 679-688.Link to Version of Record
https://doi.org/10.1007/s40313-014-0142-6Type
Articleae974a485f413a2113503eed53cd6c53
https://doi.org/10.1007/s40313-014-0142-6