发布求助
文献互助 智能选刊 最新文献

2012 IEEE International Conference on Automation Science and Engineering (CASE)最新文献

筛选
英文 中文
Input shaping control for suppression of boom vibrations 用于抑制臂架振动的输入成形控制
2012 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386502
K. Moon
{"title":"Input shaping control for suppression of boom vibrations","authors":"K. Moon","doi":"10.1109/CoASE.2012.6386502","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386502","url":null,"abstract":"This paper shows that motion induced boom vibrations can be effectively suppressed by an input shaping control scheme. As typical heavy equipments such as excavators use pressurized hydraulic fluid; an operator control unit; and a boom cylinder coupled to the boom arm. The vibratory motion of boom manipulator systems provides a negative influence in operational efficiency as well as on the operator's health. However, the boom vibratory motion is difficult to suppress using conventional feedback controllers due to hydraulic circuit time delay. This paper describes an input shaping controller that monitors the hydraulic pressure profile of the boom cylinder to sense boom vibrations. The input shaping controller generates a command input to help cancel out the boom vibrations.","PeriodicalId":430428,"journal":{"name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126405955","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}
引用次数: 3
Scheduling of Petri nets as a multi-objective shortest path problem Petri网的多目标最短路径调度问题
2012 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386386
Uno Wikborg, Tae-Eog Lee
{"title":"Scheduling of Petri nets as a multi-objective shortest path problem","authors":"Uno Wikborg, Tae-Eog Lee","doi":"10.1109/CoASE.2012.6386386","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386386","url":null,"abstract":"Petri nets are widely used for modeling and analysis of discrete event dynamic systems such as complex automated manufacturing systems or cluster tools for semiconductor manufacturing. We define a data structure for noncyclic Petri net scheduling problems and then transform the scheduling problem into an equivalent multi-objective shortest path (MSP) problem in the state transition graph. Solving the MSP problem will find a path which minimizes the completion time for tokens at each subsequence step, and hence when the corresponding resource becomes available or ready for the next task. This will ultimately minimize the firing epoch of the final destination transition, corresponding to the makespan. We extend a label correction algorithm for existing multi-objective shortest path problems to handle the path dependent edge lengths in the graph and dynamic objectives. We then apply the Petri net-based scheduling method to noncyclic cluster tool scheduling problems. We demonstrate the efficiency of the scheduling method as compared to a branch and bound method.","PeriodicalId":430428,"journal":{"name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127922247","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}
引用次数: 4
Early warning system modeling for patient bispectral index prognosis in anesthesia and the operating room 麻醉及手术室患者双谱指数预后预警系统建模
2012 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386383
Joshua Reese, Yong Wang, Lin Li, H. Darabi, Erik Osland, M. Ozcan, V. Baughman, G. Edelman
{"title":"Early warning system modeling for patient bispectral index prognosis in anesthesia and the operating room","authors":"Joshua Reese, Yong Wang, Lin Li, H. Darabi, Erik Osland, M. Ozcan, V. Baughman, G. Edelman","doi":"10.1109/CoASE.2012.6386383","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386383","url":null,"abstract":"Bispectral index (BIS) is a popular technology widely used in hospitals to monitor depth of patients' anesthesia during surgeries. Maintaining a proper, steady state of the patient's BIS level is critical for patient safety. In this paper an autoregressive moving average model is implemented on patient BIS data for the prognosis of the depth of anesthesia. This prognosis will enable anesthesiologists to make adjustments to the anesthetics prior to a shift in the BIS for the purpose of maintaining steady state BIS. This proposed method will alleviate the current demand for anesthesiologists to make their own predictions during surgery based on past experiences.","PeriodicalId":430428,"journal":{"name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"11 suppl_1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128179116","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}
引用次数: 0
A symbolic approach to large-scale discrete event systems modeled as finite automata with variables 用有变量的有限自动机建模的大规模离散事件系统的符号方法
2012 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386479
Z. Fei, S. Miremadi, K. Åkesson, B. Lennartson
{"title":"A symbolic approach to large-scale discrete event systems modeled as finite automata with variables","authors":"Z. Fei, S. Miremadi, K. Åkesson, B. Lennartson","doi":"10.1109/CoASE.2012.6386479","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386479","url":null,"abstract":"The state-space explosion problem, resulting from the reachability computation of the synthesis task, is one of the main obstacles preventing the supervisory control theory (SCT) from having an industrial breakthrough. To alleviate this problem, a well-known strategy is to utilize binary decision diagrams (BDDs) to compute supervisors symbolically. Based on this principle, we present in this paper an efficient reachability approach to large-scale discrete event systems modeled as finite automata with variables. By making use of the disjunctive partitioning technique, the proposed approach partitions the transition relation of a considered system into a set of partial transition relations according to included events. Then those partial transition relations are selected systematically to perform the reachability computation. Experimental results show that more iterations might be required to compute the fixed point, but the intermediate BDDs are smaller. The approach has been implemented in the supervisory control tool Supremica and the efficiency is demonstrated on a set of industrially relevant benchmark problems.","PeriodicalId":430428,"journal":{"name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132322379","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}
引用次数: 2
Treatment of missing values for association rule-based tool commonality analysis in semiconductor manufacturing 半导体制造中基于关联规则的工具通用性分析缺失值的处理
2012 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386510
Rong-Huei Chen, Chih-Ming Fan
{"title":"Treatment of missing values for association rule-based tool commonality analysis in semiconductor manufacturing","authors":"Rong-Huei Chen, Chih-Ming Fan","doi":"10.1109/CoASE.2012.6386510","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386510","url":null,"abstract":"In semiconductor manufacturing, there are hundreds of processing steps with multiple tools at most steps. Association rule-based tool commonality analysis (TCA) is believed to be an effective approach to identify tool excursions for yield enhancement. However, we found that missing values frequently occurred in industry practice will lead to high false positive and false negative rates in association rule-based TCA. Incorrect identification of root cause of yield loss not only loses engineer's trust on TCA but also delays the process improvement opportunity. A Markov-chain based Missing Value Estimation (MC-MVE) method is proposed in this paper to improve the effectiveness of association rule-based TCA. MC-MVE adopts an iterative approach to estimate the probabilistic state of the missing values, with the state transition probability derived by a Bernoulli distribution, until convergence criteria. The real case study shows that MC-MVE has a better accuracy for recovering missing values to improve the identification accuracy in TCA.","PeriodicalId":430428,"journal":{"name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130162887","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}
引用次数: 6
Executable simulation lifecycle management framework using extensible and interoperable simulation language 可执行的仿真生命周期管理框架，使用可扩展和可互操作的仿真语言
2012 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386481
Hyunsoo Lee, A. Banerjee
{"title":"Executable simulation lifecycle management framework using extensible and interoperable simulation language","authors":"Hyunsoo Lee, A. Banerjee","doi":"10.1109/CoASE.2012.6386481","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386481","url":null,"abstract":"There has been some recent change in focus in R&D from the concept of managing product lifecycle data to identifying and representing crucial data and using it for simulation to study dynamic process behavior and characteristics. One of the relatively new concepts that has evolved to address this change is Simulation Lifecycle Management (SLM) concept, which can be considered as the next version of PDM/PLM systems currently used in R&D. There are relatively few research studies or related frameworks that can adequately support the SLM concepts. This paper proposes an executable and interoperable SLM framework using an eXtensible Petri Net Markup Language (xPNML). Unlike other proprietary simulation languages, xPNML has advantages in terms of interoperability, flexibility and incorporation of simulation parameters. An executable SLM framework using xPNML is shown here using a conceptual scenario. The use of modular concept of xPNML is discussed to demonstrate concise and consistent simulation model development.","PeriodicalId":430428,"journal":{"name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134523491","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}
引用次数: 0
Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops 基于可变邻域搜索的复杂作业车间并行移动瓶颈启发式子问题求解方法
2012 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386462
Andrew Bilyk, L. Mönch
{"title":"Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops","authors":"Andrew Bilyk, L. Mönch","doi":"10.1109/CoASE.2012.6386462","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386462","url":null,"abstract":"The shifting bottleneck heuristic (SBH) for complex job shops decomposes the overall scheduling problem into a series of scheduling problems related to machine groups. These smaller, more tractable, scheduling problems are called subproblems. The heuristic is based on a disjunctive graph that is used to model the relationship between the sub-problems. In this paper, we use a parallel implementation of the SBH to assess the impact of a variable neighborhood search-based subproblem solution procedure (SSP) on global performance measures like the total weighted tardiness. Based on designed simulation experiments, we demonstrate the advantage of using high-quality SSPs.","PeriodicalId":430428,"journal":{"name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"620 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133889526","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}
引用次数: 4
Scheduling model for systems with complex alternative behaviour 具有复杂可选行为的系统调度模型
2012 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386474
Oskar Wigström, B. Lennartson
{"title":"Scheduling model for systems with complex alternative behaviour","authors":"Oskar Wigström, B. Lennartson","doi":"10.1109/CoASE.2012.6386474","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386474","url":null,"abstract":"In this paper we propose a flexible model for scheduling problems, which allows the modeling of systems with complex alternative behaviour. This model could for example facilitate the step from process planning model to optimization model. We show how automatic constraint generation can be performed for both Constraint Programming and Mixed Integer Linear Programming (MILP) models. Also, for the MILP case, a new formulation for mutual exclusion of resources is proposed. This new formulation works well for proving optimality in systems with multiple capacity resources. Some benchmarks for such job shop scheduling problems as well as systems with a large number of alternatives are also presented.","PeriodicalId":430428,"journal":{"name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"249 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131831651","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}
引用次数: 7
On the assignment problem of arbitrary processing time operations in partially overlapping manufacturing resources 部分重叠制造资源中任意加工时间作业的分配问题
2012 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386373
Wafa Ghonaim, H. Ghenniwa, W. Shen
{"title":"On the assignment problem of arbitrary processing time operations in partially overlapping manufacturing resources","authors":"Wafa Ghonaim, H. Ghenniwa, W. Shen","doi":"10.1109/CoASE.2012.6386373","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386373","url":null,"abstract":"The frequent transfers' challenge of workpieces between multiple resources is quite evident in the production process of customized parts. In fact, special jobs' transfers and processing, often, require workpiece unloading, transport and loading with, rather, idling and reconfiguration of resources that impact much job completion time and resource utilization. The overlapping capabilities of machine tools, otherwise, are common with, typically, few special tooling. In such settings, the overlapping and special tooling capabilities intensify the complexity of the assignment problem, mainly, when allocating the operations of arbitrary processing times. This work targets the efficient assignment of unrelated jobs of operations with arbitrary processing time to multiple resources of partially overlapping capabilities. The work introduces a formal model and a more efficient solution approach for minimizing jobs' transfer and balancing workloads. The sequencing problem of the assigned unrelated jobs would be, then, an orthogonal problem, of less significance, that can be tackled separately.","PeriodicalId":430428,"journal":{"name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132619364","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}
引用次数: 1
Implementation of Time Domain Passivity Approach on Rate-Mode bilateral teleoperation 时域无源方法在速率模式双边遥操作中的实现
2012 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386414
H. Quang, J. Ryu
{"title":"Implementation of Time Domain Passivity Approach on Rate-Mode bilateral teleoperation","authors":"H. Quang, J. Ryu","doi":"10.1109/CoASE.2012.6386414","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386414","url":null,"abstract":"Rate Mode is utilized in many telemanipulation applications where the master workspace is limited compare with the slave workspace. Beside transparent, stability is the main issue of teleoperation systems and time delay communication is the main factor lead to the instability of the system. Many methods have been proposed in order to stabilize the rate mode teleoperation system working under varying time delay and data - cropped telecommunication environments. In this paper, Time Domain Passivity Approached and recently proposed energy based framework are implemented to stabilize the teleoperation system under variable time delay communication. Experiments have also been done and showed that the proposed method helps operators to control the speed of slave robot much easier and smoother without any unstable behaviour.","PeriodicalId":430428,"journal":{"name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"31 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132940143","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书