Pub Date : 2021-08-23DOI: 10.1109/CASE49439.2021.9551477
Ilham Rabhi, A. Roussy, F. Pasqualini, C. Alegret
Semiconductor manufacturing is a continuously challenging and competitive industry. It is important to detect any anomalies in the production facilities, or fabs, as they occur to avoid defect accumulations and loss of performance. In this paper we present a literature review of classification methods and detailed the chosen method which is One Class-Support Vector Machine (OC-SVM). This method is used for out-of-control detection in semiconductor manufacturing. The method is tested via an application using industrial data of the studied fab.
{"title":"Out-Of-Control Detection In Semiconductor Manufacturing using One-Class Support Vector Machines","authors":"Ilham Rabhi, A. Roussy, F. Pasqualini, C. Alegret","doi":"10.1109/CASE49439.2021.9551477","DOIUrl":"https://doi.org/10.1109/CASE49439.2021.9551477","url":null,"abstract":"Semiconductor manufacturing is a continuously challenging and competitive industry. It is important to detect any anomalies in the production facilities, or fabs, as they occur to avoid defect accumulations and loss of performance. In this paper we present a literature review of classification methods and detailed the chosen method which is One Class-Support Vector Machine (OC-SVM). This method is used for out-of-control detection in semiconductor manufacturing. The method is tested via an application using industrial data of the studied fab.","PeriodicalId":232083,"journal":{"name":"2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132404728","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-08-23DOI: 10.1109/CASE49439.2021.9551585
Tajima Shungo, H. Date
This study addresses the problem of automating the sewing process in the garment industry. While automatic feeding during sewing has been achieved, overlapping and feeding two a pair of cloths still require a human operator. The difficulty lies in manipulating a soft material. Instead of using a generic robot finger, we use a horizontal dual-arm manipulator with rollers as end effectors, which always hold down the cloth during manipulation. We validated our system through experiments with a prototype that can feed and sew a single piece of cloth in a single operation.
{"title":"Development of Fabric Feed Mechanism Using Horizontal Articulated Dual Manipulator for Automated Sewing","authors":"Tajima Shungo, H. Date","doi":"10.1109/CASE49439.2021.9551585","DOIUrl":"https://doi.org/10.1109/CASE49439.2021.9551585","url":null,"abstract":"This study addresses the problem of automating the sewing process in the garment industry. While automatic feeding during sewing has been achieved, overlapping and feeding two a pair of cloths still require a human operator. The difficulty lies in manipulating a soft material. Instead of using a generic robot finger, we use a horizontal dual-arm manipulator with rollers as end effectors, which always hold down the cloth during manipulation. We validated our system through experiments with a prototype that can feed and sew a single piece of cloth in a single operation.","PeriodicalId":232083,"journal":{"name":"2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133588542","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-08-23DOI: 10.1109/CASE49439.2021.9551416
Feifan Wang, Yu-Li Huang, Feng Ju
Proton therapy is a highly targeted radiation treatment for tumors. In a typical proton therapy system, multiple gantries share a beam accelerator. A patient is often called back to a gantry immediately after the gantry becomes available, and each treatment requires multiple beams. This causes gantries to compete for the beam and results in long beam wait time, which negatively impacts treatment quality and patient satisfaction. In this study, we propose a rollout-based gantry call-back control method, considering both beam wait time and beam utilization. When a gantry becomes available, an optimal call-back delay time is applied to mitigate beam request conflicts. Simulation experiments suggest the proposed method can be used to find the trade-off between beam wait time and the bean utilization and improve proton therapy care delivery process.
{"title":"Rollout-based Gantry Call-back Control for Proton Therapy Systems","authors":"Feifan Wang, Yu-Li Huang, Feng Ju","doi":"10.1109/CASE49439.2021.9551416","DOIUrl":"https://doi.org/10.1109/CASE49439.2021.9551416","url":null,"abstract":"Proton therapy is a highly targeted radiation treatment for tumors. In a typical proton therapy system, multiple gantries share a beam accelerator. A patient is often called back to a gantry immediately after the gantry becomes available, and each treatment requires multiple beams. This causes gantries to compete for the beam and results in long beam wait time, which negatively impacts treatment quality and patient satisfaction. In this study, we propose a rollout-based gantry call-back control method, considering both beam wait time and beam utilization. When a gantry becomes available, an optimal call-back delay time is applied to mitigate beam request conflicts. Simulation experiments suggest the proposed method can be used to find the trade-off between beam wait time and the bean utilization and improve proton therapy care delivery process.","PeriodicalId":232083,"journal":{"name":"2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130766676","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-08-23DOI: 10.1109/CASE49439.2021.9551456
Yair Herbst, Shunit Polinsky, A. Fischer, Y. Medan, R. Schneor, Joshua A. Kahn, A. Wolf
The process of fitting a prosthetic hand that is comfortable, functional, easy to use, has an acceptable appearance and overall improves the amputees' quality of life is a complex, tedious and costly process. The very high price tag due to the time spent on manually fitting the device by a trained specialist makes these devices inaccessible to large portions of the population. We present a concept and preliminary results for a fully automated fitting and manufacturing pipeline for a personalized low-cost prosthetic hand. The hand is personalized in almost every aspect, from appearance to user interface, control and feedback. The pipeline only requires a 3D printer, RealSense cameras, a few basic mechanical components, and basic tools for the model assembly. The user scan-driven data and the user preferences initiate a fully-automated pipeline which culminates in a customized, easy-to-assemble PCB design and ready to print STL files, including the optimized orientation, support and layout, such that the final parts are only one click away. We believe that the proposed pipeline and design can highly impact the accessibility of prosthetic hands and could potentially be expanded to other medical applications.
{"title":"Scan-Driven Fully-Automated Pipeline for a Personalized, 3D Printed Low-Cost Prosthetic Hand","authors":"Yair Herbst, Shunit Polinsky, A. Fischer, Y. Medan, R. Schneor, Joshua A. Kahn, A. Wolf","doi":"10.1109/CASE49439.2021.9551456","DOIUrl":"https://doi.org/10.1109/CASE49439.2021.9551456","url":null,"abstract":"The process of fitting a prosthetic hand that is comfortable, functional, easy to use, has an acceptable appearance and overall improves the amputees' quality of life is a complex, tedious and costly process. The very high price tag due to the time spent on manually fitting the device by a trained specialist makes these devices inaccessible to large portions of the population. We present a concept and preliminary results for a fully automated fitting and manufacturing pipeline for a personalized low-cost prosthetic hand. The hand is personalized in almost every aspect, from appearance to user interface, control and feedback. The pipeline only requires a 3D printer, RealSense cameras, a few basic mechanical components, and basic tools for the model assembly. The user scan-driven data and the user preferences initiate a fully-automated pipeline which culminates in a customized, easy-to-assemble PCB design and ready to print STL files, including the optimized orientation, support and layout, such that the final parts are only one click away. We believe that the proposed pipeline and design can highly impact the accessibility of prosthetic hands and could potentially be expanded to other medical applications.","PeriodicalId":232083,"journal":{"name":"2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131216179","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-08-23DOI: 10.1109/CASE49439.2021.9551663
Sheila Sutjipto, Jon Woolfrey, Marc G. Carmichael, G. Paul
The objective of introducing robotic manipulators into human-centric domains is to improve the efficacy of tasks in a safe and practical manner. The shift toward collaborative manipulator platforms has facilitated physical human-robot interaction (pHRI) in such environments. Often, these platforms are kinematically redundant and possess more degrees of freedom (DOF) than needed to complete a desired task. When no additional task is defined, it is possible for the manipulator to converge upon joint configurations that are unfavourable for the collaborative task. Consequently, there is potential for the posture of the manipulator to affect the interaction experienced. This paper investigates an inertia-based optimization control method for redundant manipulators interacting with an active agent. The inertia-based reconfiguration is evaluated through simulations and quantified with real-life experiments conducted with a robot-robot dyad. It was found that resolving redundancy to reconfigure the Cartesian inertia reduced the energy expenditure of the active agent during the interaction.
{"title":"Cartesian Inertia Optimization via Redundancy Resolution for Physical Human-Robot Interaction","authors":"Sheila Sutjipto, Jon Woolfrey, Marc G. Carmichael, G. Paul","doi":"10.1109/CASE49439.2021.9551663","DOIUrl":"https://doi.org/10.1109/CASE49439.2021.9551663","url":null,"abstract":"The objective of introducing robotic manipulators into human-centric domains is to improve the efficacy of tasks in a safe and practical manner. The shift toward collaborative manipulator platforms has facilitated physical human-robot interaction (pHRI) in such environments. Often, these platforms are kinematically redundant and possess more degrees of freedom (DOF) than needed to complete a desired task. When no additional task is defined, it is possible for the manipulator to converge upon joint configurations that are unfavourable for the collaborative task. Consequently, there is potential for the posture of the manipulator to affect the interaction experienced. This paper investigates an inertia-based optimization control method for redundant manipulators interacting with an active agent. The inertia-based reconfiguration is evaluated through simulations and quantified with real-life experiments conducted with a robot-robot dyad. It was found that resolving redundancy to reconfigure the Cartesian inertia reduced the energy expenditure of the active agent during the interaction.","PeriodicalId":232083,"journal":{"name":"2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)","volume":"41 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131260056","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}
The many-to-many hub location routing problem (MMHLRP) has been attracting interest as a way to improve the efficiency of long-distance delivery. Since more commodities are delivered to urban areas than to rural areas, it is important in actual business to improve the efficiency of deliveries in which the commodities are unevenly distributed. In this work, we propose a network design algorithm utilizing customized hierarchical clustering for MMHLRP. The results of numerical experiments show that the proposed algorithm reduces the total cost compared to the conventional gravity rule-based clustering algorithm when the commodities are distributed unevenly.
{"title":"Hierarchical Clustering-Based Network Design Algorithm for Many-To-Many Hub Location Routing Problem","authors":"Akane Seto, Kazuya Uyama, Junko Hosoda, Naoko Miyashita","doi":"10.1109/CASE49439.2021.9551550","DOIUrl":"https://doi.org/10.1109/CASE49439.2021.9551550","url":null,"abstract":"The many-to-many hub location routing problem (MMHLRP) has been attracting interest as a way to improve the efficiency of long-distance delivery. Since more commodities are delivered to urban areas than to rural areas, it is important in actual business to improve the efficiency of deliveries in which the commodities are unevenly distributed. In this work, we propose a network design algorithm utilizing customized hierarchical clustering for MMHLRP. The results of numerical experiments show that the proposed algorithm reduces the total cost compared to the conventional gravity rule-based clustering algorithm when the commodities are distributed unevenly.","PeriodicalId":232083,"journal":{"name":"2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128304289","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-08-23DOI: 10.1109/CASE49439.2021.9551642
Yue Li, Zilong Zhuang, W. Qin
With the continuous growth of express demand, the impact of its fluctuations is becoming more and more significant. The traditional H&S networks cannot respond intelligently to the demand changes. Therefore, a new network design method combining information and automation needs to be developed urgently. This paper considers a multi-hub version and proposes a hybrid network to dynamically design the hubs' locations and the straight connections between nodes. A mixed integer linear programming model is formulated, and a two-stage genetic algorithm is developed to solve the small and large-scale instances of the hybrid H&S network design problem. The MILP and heuristic algorithm are tested on instances provided by an express delivery giant from China. Experimental results verify the effectiveness and economy of the hybrid H&S network and the ability of the proposed heuristic algorithm to quickly find the approximate optimal solution.
{"title":"The Design of Hybrid Hub-and-spoke Networks for Large-scale Dynamic Express Logistics: A Case Study of Chinese Express*","authors":"Yue Li, Zilong Zhuang, W. Qin","doi":"10.1109/CASE49439.2021.9551642","DOIUrl":"https://doi.org/10.1109/CASE49439.2021.9551642","url":null,"abstract":"With the continuous growth of express demand, the impact of its fluctuations is becoming more and more significant. The traditional H&S networks cannot respond intelligently to the demand changes. Therefore, a new network design method combining information and automation needs to be developed urgently. This paper considers a multi-hub version and proposes a hybrid network to dynamically design the hubs' locations and the straight connections between nodes. A mixed integer linear programming model is formulated, and a two-stage genetic algorithm is developed to solve the small and large-scale instances of the hybrid H&S network design problem. The MILP and heuristic algorithm are tested on instances provided by an express delivery giant from China. Experimental results verify the effectiveness and economy of the hybrid H&S network and the ability of the proposed heuristic algorithm to quickly find the approximate optimal solution.","PeriodicalId":232083,"journal":{"name":"2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131987231","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-08-23DOI: 10.1109/CASE49439.2021.9551670
Ning Li, Z. Wang
Because different items of the perishable products have different deterioration extents in an inventory system, the deterioration process of these perishable products cannot be captured accurately by a single number like deterioration rate. Instead, it is more appropriate to capture their deterioration process on different freshness levels by employing the freshness transition function. Especially, time-temperature indicator (TTI) technology can detect the freshness deterioration process accurately. Therefore, the freshness transition function of perishable products can be constructed based on the data collected by the TTIs. The accuracy of a freshness transition function depends on the detection quality of the TTIs deployed in the perishable inventory system and affects the performance of the pricing decision, because this decision is made based on the observation accuracy of the products' freshness. In this research, we develop the method of optimal pricing decision to obtain the maximum total profit based on the freshness transition function. This method is implemented in three steps: constructing the freshness transition function, designing the pricing optimization policy based on Deep Q-network method, and analyzing the impact of the accuracy of the freshness transition function on the performance of the pricing decision. Finally, we conduct some numerical experiments to examine the performance of the proposed optimal pricing method based on the freshness transition function and found that (1) the retailers should increase the price to obtain more total profit within a sale cycle; (2) the accuracy of the freshness transition function has great influence on the proposed pricing optimization policy.
{"title":"Price Optimization for Perishable Products with Freshness Transition Function *","authors":"Ning Li, Z. Wang","doi":"10.1109/CASE49439.2021.9551670","DOIUrl":"https://doi.org/10.1109/CASE49439.2021.9551670","url":null,"abstract":"Because different items of the perishable products have different deterioration extents in an inventory system, the deterioration process of these perishable products cannot be captured accurately by a single number like deterioration rate. Instead, it is more appropriate to capture their deterioration process on different freshness levels by employing the freshness transition function. Especially, time-temperature indicator (TTI) technology can detect the freshness deterioration process accurately. Therefore, the freshness transition function of perishable products can be constructed based on the data collected by the TTIs. The accuracy of a freshness transition function depends on the detection quality of the TTIs deployed in the perishable inventory system and affects the performance of the pricing decision, because this decision is made based on the observation accuracy of the products' freshness. In this research, we develop the method of optimal pricing decision to obtain the maximum total profit based on the freshness transition function. This method is implemented in three steps: constructing the freshness transition function, designing the pricing optimization policy based on Deep Q-network method, and analyzing the impact of the accuracy of the freshness transition function on the performance of the pricing decision. Finally, we conduct some numerical experiments to examine the performance of the proposed optimal pricing method based on the freshness transition function and found that (1) the retailers should increase the price to obtain more total profit within a sale cycle; (2) the accuracy of the freshness transition function has great influence on the proposed pricing optimization policy.","PeriodicalId":232083,"journal":{"name":"2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134546648","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-08-23DOI: 10.1109/CASE49439.2021.9551626
Alexander Dürr, Liam Neric, Volker Krueger, E. A. Topp
We address the problem of insufficient quality of robot simulators to produce precise sensor readings for joint positions, velocities and torques. Realistic simulations of sensor readings are particularly important for real time robot control laws and for data intensive Reinforcement Learning of robot movements in simulation. We systematically construct two architectures based on Long Short-Term Memory to model the difference between simulated and real sensor readings for online and offline application. Our solution is easy to integrate into existing Robot Operating System frameworks and its formulation is neither robot nor task specific. We demonstrate robust behavior and transferability of the learned model between individual Franka Emika Panda robots. Our experiments show a reduction in torque mean squared error of at least one order of magnitude. The collected data set, the plug-and-play Realeasy model for the Panda robot and a reproducible real-time docker setup are shared alongside the code.22https://sites.google.com/ulund.org/realeasy
{"title":"Realeasy: Real-Time capable Simulation to Reality Domain Adaptation","authors":"Alexander Dürr, Liam Neric, Volker Krueger, E. A. Topp","doi":"10.1109/CASE49439.2021.9551626","DOIUrl":"https://doi.org/10.1109/CASE49439.2021.9551626","url":null,"abstract":"We address the problem of insufficient quality of robot simulators to produce precise sensor readings for joint positions, velocities and torques. Realistic simulations of sensor readings are particularly important for real time robot control laws and for data intensive Reinforcement Learning of robot movements in simulation. We systematically construct two architectures based on Long Short-Term Memory to model the difference between simulated and real sensor readings for online and offline application. Our solution is easy to integrate into existing Robot Operating System frameworks and its formulation is neither robot nor task specific. We demonstrate robust behavior and transferability of the learned model between individual Franka Emika Panda robots. Our experiments show a reduction in torque mean squared error of at least one order of magnitude. The collected data set, the plug-and-play Realeasy model for the Panda robot and a reproducible real-time docker setup are shared alongside the code.22https://sites.google.com/ulund.org/realeasy","PeriodicalId":232083,"journal":{"name":"2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129396147","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-08-23DOI: 10.1109/CASE49439.2021.9551475
Siqi Guo, Feng Cui, Na Geng, Zhibin Jiang
Cellular reconfigurable manufacturing systems (CRMS) are designed to deal with dynamic demand. This paper tries to optimize cell formation decision in CRMSs with alternative routing. A mixed integer nonlinear programming model is developed to simultaneously optimize cell formation, equipment configuration, and product mix plan. The objective is to maximize profit. The linearization methods are proposed and then the model is solved by Gurobi. Numerical experiment and sensitive analysis are conducted to show the efficiency and effectiveness of the proposed approach.
{"title":"Cell Formation for Cellular Reconfigurable Manufacturing Systems with Alternative Routing","authors":"Siqi Guo, Feng Cui, Na Geng, Zhibin Jiang","doi":"10.1109/CASE49439.2021.9551475","DOIUrl":"https://doi.org/10.1109/CASE49439.2021.9551475","url":null,"abstract":"Cellular reconfigurable manufacturing systems (CRMS) are designed to deal with dynamic demand. This paper tries to optimize cell formation decision in CRMSs with alternative routing. A mixed integer nonlinear programming model is developed to simultaneously optimize cell formation, equipment configuration, and product mix plan. The objective is to maximize profit. The linearization methods are proposed and then the model is solved by Gurobi. Numerical experiment and sensitive analysis are conducted to show the efficiency and effectiveness of the proposed approach.","PeriodicalId":232083,"journal":{"name":"2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115922176","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
扫码关注我们
求助内容：
应助结果提醒方式：