Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613641
Jakob Danielsson, T. Seceleanu, Marcus Jägemar, M. Behnam, Mikael Sjödin
In this paper, we present a last-level cache partitioning controller for multi-core systems. Our objective is to control the Quality of Service (QoS) of applications in multi-core systems by monitoring run-time performance and continuously re-sizing cache partition sizes according to the applications' needs. We discuss two different use-cases; one that promotes application fairness and another one that prioritizes applications according to the system engineers' desired execution behavior. We display the performance drawbacks of maintaining a fair schedule for all system tasks and its performance implications for system applications. We, therefore, implement a second control algorithm that enforces cache partition assignments according to user-defined priorities rather than system fairness. Our experiments reveal that it is possible, with non-instrusive (0.3-0.7% CPU utilization) cache controlling measures, to increase performance according to setpoints and maintain the QoS for specific applications in an over-saturated system.
{"title":"Automatic Quality of Service Control in Multi-core Systems using Cache Partitioning","authors":"Jakob Danielsson, T. Seceleanu, Marcus Jägemar, M. Behnam, Mikael Sjödin","doi":"10.1109/ETFA45728.2021.9613641","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613641","url":null,"abstract":"In this paper, we present a last-level cache partitioning controller for multi-core systems. Our objective is to control the Quality of Service (QoS) of applications in multi-core systems by monitoring run-time performance and continuously re-sizing cache partition sizes according to the applications' needs. We discuss two different use-cases; one that promotes application fairness and another one that prioritizes applications according to the system engineers' desired execution behavior. We display the performance drawbacks of maintaining a fair schedule for all system tasks and its performance implications for system applications. We, therefore, implement a second control algorithm that enforces cache partition assignments according to user-defined priorities rather than system fairness. Our experiments reveal that it is possible, with non-instrusive (0.3-0.7% CPU utilization) cache controlling measures, to increase performance according to setpoints and maintain the QoS for specific applications in an over-saturated system.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116920918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613405
Boris Brankovic, C. Binder, D. Draxler, C. Neureiter
Engineering of vehicular embedded systems is a difficult task, as the ongoing integration of Cyber-physical Systems (CPS) or automation potentials during vehicle development leads to increasing complexity. In particular, to develop current or future Electric Vehicles (EV) is challenging due to different domains to consider while engineering the sub-components of the vehicle itself. Thus, in order to enable a mutual development of vehicular embedded systems on multiple abstraction levels, the Software Platform Embedded Systems (SPES) has been introduced. To cope with the complexity, this framework introduces viewpoints and hierarchy layers in shape of a matrix. However, while additionally multiple domains have to be considered when developing an EV, the SPES methodology is also missing specifications, impeding its application in actual industrial scenarios. To deal with both of the mentioned issues, this paper introduces an approach for Model-based Systems Engineering of electric vehicle systems based on SPES. By doing so, this framework is further refined by an architecture definition based on the ISO 42010 and a corresponding development process. By utilizing the EV use case, the outcome is thereby validated towards its industrial feasibility, which will enhance the applicability of SPES on the one hand and contribute to the Automotive area by dealing with the increasing complexity while engineering vehicular embedded systems on the other hand.
{"title":"Towards a System-of-Systems Architecture Definition enabling Cross-Domain Embedded Vehicle Engineering","authors":"Boris Brankovic, C. Binder, D. Draxler, C. Neureiter","doi":"10.1109/ETFA45728.2021.9613405","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613405","url":null,"abstract":"Engineering of vehicular embedded systems is a difficult task, as the ongoing integration of Cyber-physical Systems (CPS) or automation potentials during vehicle development leads to increasing complexity. In particular, to develop current or future Electric Vehicles (EV) is challenging due to different domains to consider while engineering the sub-components of the vehicle itself. Thus, in order to enable a mutual development of vehicular embedded systems on multiple abstraction levels, the Software Platform Embedded Systems (SPES) has been introduced. To cope with the complexity, this framework introduces viewpoints and hierarchy layers in shape of a matrix. However, while additionally multiple domains have to be considered when developing an EV, the SPES methodology is also missing specifications, impeding its application in actual industrial scenarios. To deal with both of the mentioned issues, this paper introduces an approach for Model-based Systems Engineering of electric vehicle systems based on SPES. By doing so, this framework is further refined by an architecture definition based on the ISO 42010 and a corresponding development process. By utilizing the EV use case, the outcome is thereby validated towards its industrial feasibility, which will enhance the applicability of SPES on the one hand and contribute to the Automotive area by dealing with the increasing complexity while engineering vehicular embedded systems on the other hand.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117020836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613218
Ioana Hustiu, C. Mahulea, M. Kloetzer
We consider the problem of obtaining independent trajectories for robots from a team, such that their movement satisfies a global co-safe Linear Temporal Logic (LTL) mission over some regions of interest from the environment. For this, the environment is abstracted into a discrete event system using an underlying partition and an available method is used for decomposing the LTL formula into more parts that can be independently satisfied by a robot. Then, we translate these parts into a conjunction of Boolean formulas and use another approach for planning a team based on Boolean specifications and Petri net models. The proposed combination among the two methods yields independent robot trajectories that are optimal with respect to the number of traversed cells from the partition. The advantages are also illustrated through simulation examples.
{"title":"Optimal task allocation for distributed co-safe LTL specifications","authors":"Ioana Hustiu, C. Mahulea, M. Kloetzer","doi":"10.1109/ETFA45728.2021.9613218","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613218","url":null,"abstract":"We consider the problem of obtaining independent trajectories for robots from a team, such that their movement satisfies a global co-safe Linear Temporal Logic (LTL) mission over some regions of interest from the environment. For this, the environment is abstracted into a discrete event system using an underlying partition and an available method is used for decomposing the LTL formula into more parts that can be independently satisfied by a robot. Then, we translate these parts into a conjunction of Boolean formulas and use another approach for planning a team based on Boolean specifications and Petri net models. The proposed combination among the two methods yields independent robot trajectories that are optimal with respect to the number of traversed cells from the partition. The advantages are also illustrated through simulation examples.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117216511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613724
S. Malakuti, Prerna Juhlin, Jens Doppelhamer, Johannes O. Schmitt, Thomas Goldschmidt, Aleksander Ciepal
The lifecycle data of industrial devices is typically maintained in separate data sources operating in silos. The lack of interoperability between the data sources due to the usage of different APIs, data formats and data models results in time-consuming and error-prone manual data exchange efforts. The notion of digital twins is known to be a solution to the data silo problem and the associated interoperability issues. Despite many studies on digital twins, there is still a need for common architectures that offer means for defining digital twins, ingesting backend data in the digital twins, and enabling interoperable data exchange across the lifecycle of the devices via their digital twins. This paper aims to close this gap by proposing a cloud-based architecture, a common information meta-model for defining the digital twins, and variety of APIs to query the lifecycle data of interest via the digital twins.
{"title":"An Architecture and Information Meta-model for Back-end Data Access via Digital Twins","authors":"S. Malakuti, Prerna Juhlin, Jens Doppelhamer, Johannes O. Schmitt, Thomas Goldschmidt, Aleksander Ciepal","doi":"10.1109/ETFA45728.2021.9613724","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613724","url":null,"abstract":"The lifecycle data of industrial devices is typically maintained in separate data sources operating in silos. The lack of interoperability between the data sources due to the usage of different APIs, data formats and data models results in time-consuming and error-prone manual data exchange efforts. The notion of digital twins is known to be a solution to the data silo problem and the associated interoperability issues. Despite many studies on digital twins, there is still a need for common architectures that offer means for defining digital twins, ingesting backend data in the digital twins, and enabling interoperable data exchange across the lifecycle of the devices via their digital twins. This paper aims to close this gap by proposing a cloud-based architecture, a common information meta-model for defining the digital twins, and variety of APIs to query the lifecycle data of interest via the digital twins.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131051604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613168
E. Villagrossi, N. Pedrocchi, M. Beschi
The paper introduces a robotic manipulation framework suitable for the execution of manipulation tasks. Based on the ROS platform, the framework provides advanced motion planning and control functionalities for robotic systems to guarantee a high level of autonomy during the execution of an action. The integrated motion planning module can handle multiple motion planners to generate collision-free trajectories for a given planning scene that can be dynamically uploaded. In the same way, the robot controllers can be changed online on the base of the robot behavior required by the action under execution. The motion control of the robotic system is fully demanded to the manipulation framework relieving the upper control layers from the management of low-level functionalities and the task geometrical information. The framework can be used downstream to a task planner or as a standalone library to simplify the robot programming in complex manipulation tasks.
{"title":"Simplify the robot programming through an action-and-skill manipulation framework","authors":"E. Villagrossi, N. Pedrocchi, M. Beschi","doi":"10.1109/ETFA45728.2021.9613168","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613168","url":null,"abstract":"The paper introduces a robotic manipulation framework suitable for the execution of manipulation tasks. Based on the ROS platform, the framework provides advanced motion planning and control functionalities for robotic systems to guarantee a high level of autonomy during the execution of an action. The integrated motion planning module can handle multiple motion planners to generate collision-free trajectories for a given planning scene that can be dynamically uploaded. In the same way, the robot controllers can be changed online on the base of the robot behavior required by the action under execution. The motion control of the robotic system is fully demanded to the manipulation framework relieving the upper control layers from the management of low-level functionalities and the task geometrical information. The framework can be used downstream to a task planner or as a standalone library to simplify the robot programming in complex manipulation tasks.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131183591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613449
A. Bonci, Renat Kermenov, S. Longhi, Giacomo Nabissi
The field of Permanent Magnet Synchronous Motors (PMSMs) diagnosis is of research interest because widely used both in the Industrial environment and in electric vehicles. Amongst various Fault Detection (FD) techniques, the Motor Current Signature Analysis (MCSA) received lots of attention because some defecting frequencies may be monitored through the motor currents in case of steady-state functioning. This latter assumption is not always fulfilled, such e.g. in robotic systems driven by PMSMs, where constant speed assumption is unrealistic in most of the cases. Furthermore, MCSA in not suitable for systems working under non-stationary conditions without using advanced processing techniques. This work investigates the use of load torque information for motor diagnostic purposes under not constant speed assumption. Simulations and experimental results are presented regarding the use of the proposed Motor Torque Analysis (MTA) to overcome these limits.
{"title":"Motor Torque Analysis for diagnosis in PMSMs under non-stationary conditions","authors":"A. Bonci, Renat Kermenov, S. Longhi, Giacomo Nabissi","doi":"10.1109/ETFA45728.2021.9613449","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613449","url":null,"abstract":"The field of Permanent Magnet Synchronous Motors (PMSMs) diagnosis is of research interest because widely used both in the Industrial environment and in electric vehicles. Amongst various Fault Detection (FD) techniques, the Motor Current Signature Analysis (MCSA) received lots of attention because some defecting frequencies may be monitored through the motor currents in case of steady-state functioning. This latter assumption is not always fulfilled, such e.g. in robotic systems driven by PMSMs, where constant speed assumption is unrealistic in most of the cases. Furthermore, MCSA in not suitable for systems working under non-stationary conditions without using advanced processing techniques. This work investigates the use of load torque information for motor diagnostic purposes under not constant speed assumption. Simulations and experimental results are presented regarding the use of the proposed Motor Torque Analysis (MTA) to overcome these limits.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132724851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613205
Jakob Giner, Raphael Lamprecht, Viola Gallina, Catherine Laflamme, Lennard Sielaff, W. Sihn
As the automation of production lines in modern manufacturing environments becomes ubiquitous, their flexibility and resilience become increasingly important. Consequently, the scheduling of maintenance activities is growing more complex and at the same time ever more crucial for ensuring adequate system availability. In this paper a digital model of a production environment is presented, using building blocks and restrictions that can be found in most modern production environments. Maintenance and repair activities in the model are scheduled by a reinforcement learning agent for different proof-of-concept scenarios, which can be optimised using measures such as maximizing production capacity and minimizing maintenance costs. The results of this paper provide the basis for further work to improve the working conditions of human maintenance planners by providing a reliable decision support system which facilitates the task of scheduling planned and unplanned maintenance activities.
{"title":"Demonstrating Reinforcement Learning for Maintenance Scheduling in a Production Environment","authors":"Jakob Giner, Raphael Lamprecht, Viola Gallina, Catherine Laflamme, Lennard Sielaff, W. Sihn","doi":"10.1109/ETFA45728.2021.9613205","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613205","url":null,"abstract":"As the automation of production lines in modern manufacturing environments becomes ubiquitous, their flexibility and resilience become increasingly important. Consequently, the scheduling of maintenance activities is growing more complex and at the same time ever more crucial for ensuring adequate system availability. In this paper a digital model of a production environment is presented, using building blocks and restrictions that can be found in most modern production environments. Maintenance and repair activities in the model are scheduled by a reinforcement learning agent for different proof-of-concept scenarios, which can be optimised using measures such as maximizing production capacity and minimizing maintenance costs. The results of this paper provide the basis for further work to improve the working conditions of human maintenance planners by providing a reliable decision support system which facilitates the task of scheduling planned and unplanned maintenance activities.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113932844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613492
K. KrishneGowda, E. Peter, Matthias Scheide, L. Wimmer, R. Kays, E. Grass, R. Kraemer
We propose a closed-loop industrial radio system with a star topology for factory automation using Parallel Sequence Spread Spectrum (PSSS) technology. This system implements all significant concepts for synchronization, duplex-communication, channel estimation/equalization based on an innovative transceiver concept. The industrial environment tends to have non-line of sight channels that lead to RMS delay spreads of less than 100 ns. Here, we propose a channel equalization scheme to compensate for these delay spreads. Another challenging aspect is the implementation of a code division duplexing (CDD) scheme. We propose a closed-loop system architecture that can achieve the targets set by Industry 4.0 bodies such as IWSAN. This paper gives an overview of the closed-loop systems concept.
{"title":"Parallel Sequence Spread Spectrum based Ultra-Reliable Low Latency Communication for Factory Automation","authors":"K. KrishneGowda, E. Peter, Matthias Scheide, L. Wimmer, R. Kays, E. Grass, R. Kraemer","doi":"10.1109/ETFA45728.2021.9613492","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613492","url":null,"abstract":"We propose a closed-loop industrial radio system with a star topology for factory automation using Parallel Sequence Spread Spectrum (PSSS) technology. This system implements all significant concepts for synchronization, duplex-communication, channel estimation/equalization based on an innovative transceiver concept. The industrial environment tends to have non-line of sight channels that lead to RMS delay spreads of less than 100 ns. Here, we propose a channel equalization scheme to compensate for these delay spreads. Another challenging aspect is the implementation of a code division duplexing (CDD) scheme. We propose a closed-loop system architecture that can achieve the targets set by Industry 4.0 bodies such as IWSAN. This paper gives an overview of the closed-loop systems concept.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"634 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122950291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613439
Zarina Chokparova, L. Urbas
Information plays a significant role in modern process industries due to the demand for flexibility and mobility in production. Therefore, it is important to preserve the privacy and security of the information exchanged and shared between partners in value chains, for instance asset chains or supply chains. Since many companies have their own technological solutions and methods for operation and control, this information is regarded as their intellectual property. For the protection of recipes, material flows, or operational and control variables during the manufacturing of products, various methods are available. These techniques include anonymization and encryption solutions. To deal with mathematical models and the computation of formulas, homomorphic encryption schemes can be applied to the data which have to be shared within a value chain. Based on the experience of previous implementations of homomorphic crypto system in different domains, the opportunities for adaptation of encryption methods in process industries are considered. This paper proposes the application of homomorphic encryption in a value chain and defines a specific protocol that enables the Paillier cryptosystem on a time series. A use case is designed for confidential information exchange between a secret owner and a value provider in a value chain. The architecture of confidentiality-preserving information sharing satisfies the zero-knowledge proof requirement and shows low similarity between original and recovered messages.
{"title":"Utilization of Homomorphic Cryptosystems for Information Exchange in Value Chains","authors":"Zarina Chokparova, L. Urbas","doi":"10.1109/ETFA45728.2021.9613439","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613439","url":null,"abstract":"Information plays a significant role in modern process industries due to the demand for flexibility and mobility in production. Therefore, it is important to preserve the privacy and security of the information exchanged and shared between partners in value chains, for instance asset chains or supply chains. Since many companies have their own technological solutions and methods for operation and control, this information is regarded as their intellectual property. For the protection of recipes, material flows, or operational and control variables during the manufacturing of products, various methods are available. These techniques include anonymization and encryption solutions. To deal with mathematical models and the computation of formulas, homomorphic encryption schemes can be applied to the data which have to be shared within a value chain. Based on the experience of previous implementations of homomorphic crypto system in different domains, the opportunities for adaptation of encryption methods in process industries are considered. This paper proposes the application of homomorphic encryption in a value chain and defines a specific protocol that enables the Paillier cryptosystem on a time series. A use case is designed for confidential information exchange between a secret owner and a value provider in a value chain. The architecture of confidentiality-preserving information sharing satisfies the zero-knowledge proof requirement and shows low similarity between original and recovered messages.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128418612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613282
Tobias Gerlach, D. Eggink
Joining element and assembly design remain largely a manual process. This increases risks of more costly and longer development trajectories. Current automation solutions do not consider historical data and traditional machine learning approaches have limitations. Meanwhile, generative adversary networks became benchmark methodologies to perform generation tasks in computer vision. Products in manufacturing industry may contain thousands of spot welds, thus design automation enables engineers to focus on their core competencies. This work presents a methodology to predict spot weld locations using generative adversarial networks. A 2D-based approach implements a variant of StarGAN_v2 to predict locations. It uses domain-based prediction concepts that integrate clustering of geometrical and product manufacturing information, as well as reference guided style generation. Results indicate that generative adversarial networks can predict spot weld positions based on 2D image data.
{"title":"Generative Adversarial Networks for spot weld design","authors":"Tobias Gerlach, D. Eggink","doi":"10.1109/ETFA45728.2021.9613282","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613282","url":null,"abstract":"Joining element and assembly design remain largely a manual process. This increases risks of more costly and longer development trajectories. Current automation solutions do not consider historical data and traditional machine learning approaches have limitations. Meanwhile, generative adversary networks became benchmark methodologies to perform generation tasks in computer vision. Products in manufacturing industry may contain thousands of spot welds, thus design automation enables engineers to focus on their core competencies. This work presents a methodology to predict spot weld locations using generative adversarial networks. A 2D-based approach implements a variant of StarGAN_v2 to predict locations. It uses domain-based prediction concepts that integrate clustering of geometrical and product manufacturing information, as well as reference guided style generation. Results indicate that generative adversarial networks can predict spot weld positions based on 2D image data.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115866999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：