Pub Date : 2019-08-01DOI: 10.1109/COASE.2019.8842957
Siyang Gao, Jianzhong Du, Chun-Hung Chen
In this research, we consider the ranking and selection problem in the presence of covariates. It is an important problem in personalized decision making. The performance of each design alternative depends on the values of the covariates to the simulation model for which the relationship is hard to describe analytically. Therefore the optimal design under each possible covariate value needs to be estimated by simulation. This work first introduces three measures to evaluate the selection quality over the covariate space and investigates their rate functions of convergence. By optimizing the rate functions, an asymptotically optimal budget allocation rule is developed and a corresponding selection algorithm is devised. We further show that the selection algorithm can recover the asymptotical optimal allocation in the limit. The high efficiency of the selection algorithm is illustrated via numerical testing.
{"title":"Selecting the Optimal System Design under Covariates","authors":"Siyang Gao, Jianzhong Du, Chun-Hung Chen","doi":"10.1109/COASE.2019.8842957","DOIUrl":"https://doi.org/10.1109/COASE.2019.8842957","url":null,"abstract":"In this research, we consider the ranking and selection problem in the presence of covariates. It is an important problem in personalized decision making. The performance of each design alternative depends on the values of the covariates to the simulation model for which the relationship is hard to describe analytically. Therefore the optimal design under each possible covariate value needs to be estimated by simulation. This work first introduces three measures to evaluate the selection quality over the covariate space and investigates their rate functions of convergence. By optimizing the rate functions, an asymptotically optimal budget allocation rule is developed and a corresponding selection algorithm is devised. We further show that the selection algorithm can recover the asymptotical optimal allocation in the limit. The high efficiency of the selection algorithm is illustrated via numerical testing.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"33 1","pages":"547-552"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81335571","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843052
Chao-Bo Yan
Since the high energy consumption is prominent in production systems, reducing the energy consumption is of great significance. In this paper, the energy consumption optimization problem in a two-machine Bernoulli line with general lowerand upper-bounds of machine efficiencies is investigated. Specifically, the problem is formulated as a constrained nonlinear programming; taking advantage of existing results of the optimization model without additional limits on machine efficiencies, the structure of the feasible region and properties of the objective function on the feasible region are analyzed; based on the structure of the feasible region and properties of the objective function obtained, a method is developed to solve the energy consumption optimization problem in the two-machine Bernoulli line with general limits on machine efficiencies.
{"title":"Energy Consumption optimization in Two-Machine Bernoulli Serial Lines with Limits on Machine Efficiency","authors":"Chao-Bo Yan","doi":"10.1109/COASE.2019.8843052","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843052","url":null,"abstract":"Since the high energy consumption is prominent in production systems, reducing the energy consumption is of great significance. In this paper, the energy consumption optimization problem in a two-machine Bernoulli line with general lowerand upper-bounds of machine efficiencies is investigated. Specifically, the problem is formulated as a constrained nonlinear programming; taking advantage of existing results of the optimization model without additional limits on machine efficiencies, the structure of the feasible region and properties of the objective function on the feasible region are analyzed; based on the structure of the feasible region and properties of the objective function obtained, a method is developed to solve the energy consumption optimization problem in the two-machine Bernoulli line with general limits on machine efficiencies.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"26 1","pages":"85-90"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81430172","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843116
Daniel Ahlers, Florens Wasserfall, N. Hendrich, Jianwei Zhang
Additive manufacturing processes are inherently subject to discretization effects. For most technologies, stairstepping artifacts impair the surface quality of 3D printed objects, especially when the surface slope is close to horizontal.In this paper we propose a novel Fused Deposition Modeling (FDM) slicing approach that combines nonplanar and planar layers, increasing printing quality and resulting in smoother, stronger object surfaces. Our slicing algorithm automatically detects which parts of the object should be printed with nonplanar layers and uses a geometric model of the printhead and extruder to generate collision-free toolpaths.Our open source implementation is based on the popular Slic3r tool and can be used on all common three-axis 3D printers. We present typical printing results and compare surface quality as well as slicing and printing times with traditional and adaptive planar slicing.
{"title":"3D Printing of Nonplanar Layers for Smooth Surface Generation","authors":"Daniel Ahlers, Florens Wasserfall, N. Hendrich, Jianwei Zhang","doi":"10.1109/COASE.2019.8843116","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843116","url":null,"abstract":"Additive manufacturing processes are inherently subject to discretization effects. For most technologies, stairstepping artifacts impair the surface quality of 3D printed objects, especially when the surface slope is close to horizontal.In this paper we propose a novel Fused Deposition Modeling (FDM) slicing approach that combines nonplanar and planar layers, increasing printing quality and resulting in smoother, stronger object surfaces. Our slicing algorithm automatically detects which parts of the object should be printed with nonplanar layers and uses a geometric model of the printhead and extruder to generate collision-free toolpaths.Our open source implementation is based on the popular Slic3r tool and can be used on all common three-axis 3D printers. We present typical printing results and compare surface quality as well as slicing and printing times with traditional and adaptive planar slicing.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"86 1","pages":"1737-1743"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88201377","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 : 2019-08-01DOI: 10.1109/COASE.2019.8842913
Marius Oei, Y. Klett, Nadine Harder, D. Flemming, O. Sawodny
In this work, the use of foldcore sandwich elements for building ventilation is investigated. Lightweight folded structures as an alternative to conventional sandwich core materials with the potential to be used for air or fluid transport have been investigated in aerospace engineering. Their high specific stiffness and strength in combination with multifunctional properties permits a reduction of system mass without sacrificing structural performance. Applied to the context of civil engineering, the embodied energy inherent to complex ventilation system may be reduced by the use of multifunctional, lightweight components. This work proposes an application in ultra-lightweight buildings as wall, ceiling or façde elements with integrated air ducts and large two-dimensional ventilation outlets by perforating the room-facing surface layer of the sandwich. The resulting element combines convective and radiative heating in a novel way by thermally coupling the airflow of the space heater with the room-facing surface. The mentioned properties are investigated in theory by forming a 1-dimensional distributed parameter fluid-dynamical model resulting in a boundary value problem. This is extended by a formulation of the heat transfer between fluid and surface layer. The models are evaluated and their parameters identified in practice by analyzing a prototype on a test bench. The results are integrated into a building energy performance simulation in Modelica to enable simulative studies of the impact on building occupant comfort.
{"title":"Modelling the Flow and Heat Transfer Characteristics of Perforated Foldcore Sandwich Composites for Application in Room Air Conditioning","authors":"Marius Oei, Y. Klett, Nadine Harder, D. Flemming, O. Sawodny","doi":"10.1109/COASE.2019.8842913","DOIUrl":"https://doi.org/10.1109/COASE.2019.8842913","url":null,"abstract":"In this work, the use of foldcore sandwich elements for building ventilation is investigated. Lightweight folded structures as an alternative to conventional sandwich core materials with the potential to be used for air or fluid transport have been investigated in aerospace engineering. Their high specific stiffness and strength in combination with multifunctional properties permits a reduction of system mass without sacrificing structural performance. Applied to the context of civil engineering, the embodied energy inherent to complex ventilation system may be reduced by the use of multifunctional, lightweight components. This work proposes an application in ultra-lightweight buildings as wall, ceiling or façde elements with integrated air ducts and large two-dimensional ventilation outlets by perforating the room-facing surface layer of the sandwich. The resulting element combines convective and radiative heating in a novel way by thermally coupling the airflow of the space heater with the room-facing surface. The mentioned properties are investigated in theory by forming a 1-dimensional distributed parameter fluid-dynamical model resulting in a boundary value problem. This is extended by a formulation of the heat transfer between fluid and surface layer. The models are evaluated and their parameters identified in practice by analyzing a prototype on a test bench. The results are integrated into a building energy performance simulation in Modelica to enable simulative studies of the impact on building occupant comfort.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"10 1","pages":"1269-1274"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88202769","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843236
N. Kimura, Ryo Sakai, Shinichi Katsumata, Nobuhiro Chihara
We propose a deep learning-based method that simultaneously determines a target object to be picked up by an autonomous manipulator and the velocity of an automated guided vehicle (AGV) that passes in front of the manipulator while the AGV carries a carton case containing the target and other objects. Our method can efficiently perform automated piece-picking operations in warehouses without the AGV needing to pause in front of the manipulator. In our method, for preparing supervised data sets with color images of objects that are randomly piled up in the carton case, a simulator checks whether each object is “pickable” or not by trying to plan the manipulator’s motion to have its hand reach the object while avoiding surrounding obstacles by using the depth images in consideration of the carton case’s movement and velocity. Then, we make each of multiple deep convolutional neural networks (DCNNs) corresponding to multiple levels of velocity learn to detect grasp points for only pickable objects from an RGB image. In our experimental test, using our method, a prototype of the system successfully picked ordered objects up without the AGV pausing while the AGV changed its velocity depending on the layout of the objects in the carton case.
{"title":"Simultaneously Determining Target Object and Transport Velocity for Manipulator and Moving Vehicle in Piece-Picking Operation","authors":"N. Kimura, Ryo Sakai, Shinichi Katsumata, Nobuhiro Chihara","doi":"10.1109/COASE.2019.8843236","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843236","url":null,"abstract":"We propose a deep learning-based method that simultaneously determines a target object to be picked up by an autonomous manipulator and the velocity of an automated guided vehicle (AGV) that passes in front of the manipulator while the AGV carries a carton case containing the target and other objects. Our method can efficiently perform automated piece-picking operations in warehouses without the AGV needing to pause in front of the manipulator. In our method, for preparing supervised data sets with color images of objects that are randomly piled up in the carton case, a simulator checks whether each object is “pickable” or not by trying to plan the manipulator’s motion to have its hand reach the object while avoiding surrounding obstacles by using the depth images in consideration of the carton case’s movement and velocity. Then, we make each of multiple deep convolutional neural networks (DCNNs) corresponding to multiple levels of velocity learn to detect grasp points for only pickable objects from an RGB image. In our experimental test, using our method, a prototype of the system successfully picked ordered objects up without the AGV pausing while the AGV changed its velocity depending on the layout of the objects in the carton case.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"23 1","pages":"1066-1073"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87614018","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843074
Christopher Robinson, Indika B. Wijayasinghe, D. Popa
As robotic agents become increasingly present in human environments, task completion rates during human-robot interaction is an important topic of research. Safe collaborative robots executing tasks under human supervision often augment their perception and planning capabilities through traded or shared control schemes. In this paper, we present a quantitatively defined model for sliding-scale autonomy, in which levels of autonomy are determined by the relative efficacy of autonomous subroutines. We experimentally test the resulting Variable Autonomy Planning (VAP) algorithm against a traditional traded control scheme in a pick-and-place task. Results show that prioritizing autonomy levels with higher success rates as encoded into VAP, allows users to effectively and intuitively select optimal autonomy levels for efficient task completion.
{"title":"Quantitative Variable Autonomy Levels for Traded Control in a Pick-and-Place Task","authors":"Christopher Robinson, Indika B. Wijayasinghe, D. Popa","doi":"10.1109/COASE.2019.8843074","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843074","url":null,"abstract":"As robotic agents become increasingly present in human environments, task completion rates during human-robot interaction is an important topic of research. Safe collaborative robots executing tasks under human supervision often augment their perception and planning capabilities through traded or shared control schemes. In this paper, we present a quantitatively defined model for sliding-scale autonomy, in which levels of autonomy are determined by the relative efficacy of autonomous subroutines. We experimentally test the resulting Variable Autonomy Planning (VAP) algorithm against a traditional traded control scheme in a pick-and-place task. Results show that prioritizing autonomy levels with higher success rates as encoded into VAP, allows users to effectively and intuitively select optimal autonomy levels for efficient task completion.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"56 1","pages":"697-702"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89261448","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843252
Yinan Wu, Gongzhuang Peng, Heming Zhang
Nowadays the increasing demand for high-reliability service compositions in manufacturing networks has brought new challenges for fault tolerance methods. It involves the real-time detection and rapid recovery of manufacturing services to deal with the unavoidable failures and errors. Appropriate dynamic fault tolerance methods need to be adopted to mask faults immediately after they occur in order to improve the reliability of the manufacturing network. Aiming at solving this problem, a dynamic fault tolerance method based on the pathfinding algorithm is thus put forward. First, a network model is constructed to explicitly describe the manufacturing services and their relationships. Then the dynamic fault tolerance problem can be modeled as a Multi-Constrained Optimal Path (MCOP) selection problem. On this basis, a novel Dynamic A* Search based Fault Tolerance (DAS_FT) algorithm is proposed to solve the NP-Complete MCOP problem. The propose d algorithm can find the suitable replacement schemes for failed service compositions with the help of the redundant resources in the manufacturing network, which will satisfy the Quality of Service (QoS) constraints of the manufacturing task at the same time. A set of computational experiments are designed to evaluate the proposed DAS_FT and other popular algorithms such as NSGA II and MFPB_HOSTP, which are applied to the same dataset. The results obtained illustrate that the DAS_FT algorithm can improve the reliability of the manufacturing network effectively. In addition, the DAS_FT can efficiently find the replacement schemes with better QoS compared with NSGA II and MFPB_HOSTP.
{"title":"A heuristic pathfinding algorithm for dynamic fault tolerance in manufacturing networks","authors":"Yinan Wu, Gongzhuang Peng, Heming Zhang","doi":"10.1109/COASE.2019.8843252","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843252","url":null,"abstract":"Nowadays the increasing demand for high-reliability service compositions in manufacturing networks has brought new challenges for fault tolerance methods. It involves the real-time detection and rapid recovery of manufacturing services to deal with the unavoidable failures and errors. Appropriate dynamic fault tolerance methods need to be adopted to mask faults immediately after they occur in order to improve the reliability of the manufacturing network. Aiming at solving this problem, a dynamic fault tolerance method based on the pathfinding algorithm is thus put forward. First, a network model is constructed to explicitly describe the manufacturing services and their relationships. Then the dynamic fault tolerance problem can be modeled as a Multi-Constrained Optimal Path (MCOP) selection problem. On this basis, a novel Dynamic A* Search based Fault Tolerance (DAS_FT) algorithm is proposed to solve the NP-Complete MCOP problem. The propose d algorithm can find the suitable replacement schemes for failed service compositions with the help of the redundant resources in the manufacturing network, which will satisfy the Quality of Service (QoS) constraints of the manufacturing task at the same time. A set of computational experiments are designed to evaluate the proposed DAS_FT and other popular algorithms such as NSGA II and MFPB_HOSTP, which are applied to the same dataset. The results obtained illustrate that the DAS_FT algorithm can improve the reliability of the manufacturing network effectively. In addition, the DAS_FT can efficiently find the replacement schemes with better QoS compared with NSGA II and MFPB_HOSTP.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"75 1","pages":"1580-1585"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80199574","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 : 2019-08-01DOI: 10.1109/COASE.2019.8842869
Lijie Zhou, Chengran Lin, Biao Hu, Zhengcai Cao
The scheduling problem of a semiconductor production line with a constrained waiting time is studied in this paper. This problem can be regarded as an expanded flexible job-shop scheduling problem, which can often be described by a mixed integer nonlinear programming model. An improved cuckoo search algorithm is proposed to minimize the weighted completion time including the penalty of constrained waiting time violation. In the algorithm, we propose using an onedimensional chaotic search strategy to make full use of the local space information. In addition, we introduce backtracking search into our algorithm to ensure a desired diversification of population. Experimental results demonstrate that our proposed approaches outperform several other state-of-the-art meta-heuristics.
{"title":"A Cuckoo Search-Based Scheduling Algorithm for a Semiconductor Production Line with Constrained Waiting Time","authors":"Lijie Zhou, Chengran Lin, Biao Hu, Zhengcai Cao","doi":"10.1109/COASE.2019.8842869","DOIUrl":"https://doi.org/10.1109/COASE.2019.8842869","url":null,"abstract":"The scheduling problem of a semiconductor production line with a constrained waiting time is studied in this paper. This problem can be regarded as an expanded flexible job-shop scheduling problem, which can often be described by a mixed integer nonlinear programming model. An improved cuckoo search algorithm is proposed to minimize the weighted completion time including the penalty of constrained waiting time violation. In the algorithm, we propose using an onedimensional chaotic search strategy to make full use of the local space information. In addition, we introduce backtracking search into our algorithm to ensure a desired diversification of population. Experimental results demonstrate that our proposed approaches outperform several other state-of-the-art meta-heuristics.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"32 1","pages":"338-343"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77832769","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 : 2019-08-01DOI: 10.1109/COASE.2019.8842963
J. Crowley, Yegeta Zeleke, Berk Altm, R. Sanfelice
We propose a set-based predictive control frame-work to predict inbound dynamic obstacles and optimize trajectories in the interest of safely guiding a vehicle towards a target. To account for uncertainties, the set-based controller generalizes conventional model predictive control and predicts the set that the state of a dynamical system might belong to. This generalization is used to formulate collision avoidance as a hard constraint in the set-based predictive control algorithm. As a proof-of-concept, the proposed framework is applied to a ground vehicle attempting to reach a target while anticipating and evading collisions with obstacles in the operating environment. Other applications of the controller and the associated optimal control problem are discussed.
{"title":"Set-Based Predictive Control for Collision Detection and Evasion","authors":"J. Crowley, Yegeta Zeleke, Berk Altm, R. Sanfelice","doi":"10.1109/COASE.2019.8842963","DOIUrl":"https://doi.org/10.1109/COASE.2019.8842963","url":null,"abstract":"We propose a set-based predictive control frame-work to predict inbound dynamic obstacles and optimize trajectories in the interest of safely guiding a vehicle towards a target. To account for uncertainties, the set-based controller generalizes conventional model predictive control and predicts the set that the state of a dynamical system might belong to. This generalization is used to formulate collision avoidance as a hard constraint in the set-based predictive control algorithm. As a proof-of-concept, the proposed framework is applied to a ground vehicle attempting to reach a target while anticipating and evading collisions with obstacles in the operating environment. Other applications of the controller and the associated optimal control problem are discussed.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"48 1","pages":"541-546"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85572414","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843082
Giovanni Lugaresi, Gianluca Aglio, Federico Folgheraiter, A. Matta
Recently, the connection between manufacturing systems and their digital counterparts has become of great significance for planning and control activities in a short-term scope. However, the alignment of a digital model with a very dynamic system is not always guaranteed, and traditional validation techniques cannot be used since they are designed for off-line simulators and rely on the availability of a large amount of data. This work develops a novel validation procedure inspired by signal-processing theory and a novel approach called quasi Trace Driven Simulation. The procedure is coherent with a Real-Time Simulation framework since it does not require large datasets to provide a good solution. The approach has been tried on test cases which demonstrated its applicability to a manufacturing environment.
{"title":"Real-time Validation of Digital Models for Manufacturing Systems: a Novel Signal-processing-based Approach","authors":"Giovanni Lugaresi, Gianluca Aglio, Federico Folgheraiter, A. Matta","doi":"10.1109/COASE.2019.8843082","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843082","url":null,"abstract":"Recently, the connection between manufacturing systems and their digital counterparts has become of great significance for planning and control activities in a short-term scope. However, the alignment of a digital model with a very dynamic system is not always guaranteed, and traditional validation techniques cannot be used since they are designed for off-line simulators and rely on the availability of a large amount of data. This work develops a novel validation procedure inspired by signal-processing theory and a novel approach called quasi Trace Driven Simulation. The procedure is coherent with a Real-Time Simulation framework since it does not require large datasets to provide a good solution. The approach has been tried on test cases which demonstrated its applicability to a manufacturing environment.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"488 1","pages":"450-455"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85585200","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
扫码关注我们
求助内容：
应助结果提醒方式：