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

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

筛选
英文 中文
UIO based robust fault diagnosis approach for aero-engine fiber-optic sensor 基于UIO的航空发动机光纤传感器鲁棒故障诊断方法
2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653947
Chen He, Xiaodong Zhang, Binghui Jia
{"title":"UIO based robust fault diagnosis approach for aero-engine fiber-optic sensor","authors":"Chen He, Xiaodong Zhang, Binghui Jia","doi":"10.1109/CoASE.2013.6653947","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653947","url":null,"abstract":"The purpose of this study is to develop a model-based method for detecting optical fiber sensor fault in aero-engine linear discrete time invariant (LDTI) system considering both disturbances and uncertainties. Firstly, the fiber-optic sensors are analyzed and utilized to measure the aero-engine compressor output and aero-engine compressor is reduced to a 4-input 3-output single-spool state space linear model. Secondly, the discrete robust unknown input observer (DRUIO) is designed for the fault detection based on a linear matrix inequality (LMI) approach. The performance of the observer is demonstrated by applying the design procedure to a nonlinear gas turbine model. And the result shows that less than 2% sensor fault can be detected with disturbance.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129131339","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
Transient scheduling of single armed cluster tools: Algorithms for wafer residency constraints 单臂集群工具的暂态调度:晶圆驻留约束算法
2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653901
H. Jin, J. R. Morrison
{"title":"Transient scheduling of single armed cluster tools: Algorithms for wafer residency constraints","authors":"H. Jin, J. R. Morrison","doi":"10.1109/CoASE.2013.6653901","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653901","url":null,"abstract":"The wafer handling robot actions in cluster tools used for semiconductor manufacturing should serve to maximize throughput while maintaining good wafer quality. Since excessive delay in a process chamber may cause deterioration in wafer quality, wafer delays should be maintained in an acceptable range, or preferably, should be minimized. We focus on addressing these concerns for all wafers in a lot, including those in both the transient and possibly cyclic regime. As the general problem is computationally complex, we first assume that the robot sequence is given and develop a multistage linear programming (LP) model to minimize the total makespan, subject to wafer residency constraints, and subsequently the average delay. Forging into less tractable territory, we next develop a branch and bound algorithm to find an optimal robot sequence with minimum wafer delay. This approach enables us to solve problems that were not previously solvable. Simulation studies demonstrate that when the number of process modules grows to more than five, the branch and bound algorithm may fail to find an optimal solution due to computational complexity. In this case, we suggest a transient sequence based on cyclic policies together with the LP model; it is within 2% of optimal.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"40 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121174287","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
Energy-optimal velocity profiles for electric city buses 电动城市公交车的能量最优速度曲线
2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653956
Antti Lajunen
{"title":"Energy-optimal velocity profiles for electric city buses","authors":"Antti Lajunen","doi":"10.1109/CoASE.2013.6653956","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653956","url":null,"abstract":"This paper introduces a method for defining energy-optimal velocity profiles for electric city buses. The method is founded on the use of dynamic programming and vehicle simulation. Typical driving patterns of cit y buses are used for defining the energy-optimal velocity profiles. Based on the characteristics and limitations of the driving patterns, the energy-optimal velocity profiles are calculated with the aid of dynamic programming simulation by minimizing the energy consumption. In this first part of the research, models of electric and conventional diesel city buses are used. Later, also parallel and series hybrid city buses are taken into consideration. The simulation results show that the energy-optimal driving could improve the energy efficiency on average around 17% for electric city buses and about 19% for diesel city buses in the Braunschweig driving cycle.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"44 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116343600","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}
引用次数: 14
A unified control framework of HVAC system for thermal and acoustic comforts in office building 办公楼暖通空调系统热声舒适统一控制框架
2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653964
Yin Zhao, Qianchuan Zhao, L. Xia, Zhijin Cheng, Fulin Wang, Fangting Song
{"title":"A unified control framework of HVAC system for thermal and acoustic comforts in office building","authors":"Yin Zhao, Qianchuan Zhao, L. Xia, Zhijin Cheng, Fulin Wang, Fangting Song","doi":"10.1109/CoASE.2013.6653964","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653964","url":null,"abstract":"Intelligent building system attracts more and more attention in both academic and industrial communities. Learning human comfort requirements and incorporating it into building control system is one of the important issues. In the traditional HVAC control system, the thermal comfort and the acoustic comfort are often conflicted and we lack of a scheme to trade off them well. In this paper, we propose a unified control framework based on reinforcement learning to balance the multiple dimension comforts, including the thermal and acoustic comforts. We utilize the user's complaints in thermal and acoustic sensations as feedback and combine the current environment and devices information to learn the personalized optimal control policy using online Q-learning. The challenge caused by the complaints is coped with an incorporated perception estimation scheme in the Q-learning reward design. Both simulation results and the field experimental results demonstrate the effectiveness of the algorithm, especially in the adaptivity to the individual tradeoff between thermal and acoustic comfort.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126109322","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}
引用次数: 5
Reduction of automated test generation for Simulink/Stateflow to reachability and its novel resolution 减少对Simulink/Stateflow的自动测试生成的可达性和它的新分辨率
2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6654006
Meng Li, Ratnesh Kumar
{"title":"Reduction of automated test generation for Simulink/Stateflow to reachability and its novel resolution","authors":"Meng Li, Ratnesh Kumar","doi":"10.1109/CoASE.2013.6654006","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6654006","url":null,"abstract":"Simulink/Stateflow is a popular commercial model-based development tool for many industrial domains. For safety and security concerns, verification and testing must be performed on the Simulink/Stateflow designs and the generated code. In this paper, we present a test generation approach for Simulink/Stateflow by reduction to reachability in a Hybrid Automaton, with its locations representing the computations of the Simulink/Stateflow model, and edges representing the computation-succession. A novel reachability resolution method is presented based on the refinement of the hybrid automaton such that the reachability is reduced to the reachability in the underlying graph (without the dynamics), whenever the refinement step terminates. The approach yields a technique that is effective in terms of achieving test coverage and efficient in terms of test generation time.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131356917","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
Tactical planning of bloodmobile collection systems 血车采集系统的战术规划
2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653957
E. Alfonso, V. Augusto, Xiaolan Xie
{"title":"Tactical planning of bloodmobile collection systems","authors":"E. Alfonso, V. Augusto, Xiaolan Xie","doi":"10.1109/CoASE.2013.6653957","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653957","url":null,"abstract":"This paper addresses the problem of tactical planning of mobile whole blood collection in a region in order to guarantee the regional self-sufficiency over a yearly planning horizon. Two MILP models (Mixed integer linear programming) are proposed is to determine when a mobile collection must be organized at a location by taking into account human resource capacity, stock level and regulation constraints. The first model evaluates a collection plan where the number of mobile collections at each location is given. The second model has additional decision of the number of collections at each location and evaluates the amount of blood collected by taking into account demographics, donor generosity and donor availability. Numerical experiments are then performed to assess the efficiency of the proposed models with field data from the French Blood Service (EFS, Etablissement Français du Sang) in the Auvergne-Loire Region.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"403 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133565097","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
Scheduling of time constrained dual-arm cluster tools with wafer revisiting 带晶圆重访的时间约束双臂集束工具的调度
2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653916
Yan Qiao, N. Wu, Mengchu Zhou
{"title":"Scheduling of time constrained dual-arm cluster tools with wafer revisiting","authors":"Yan Qiao, N. Wu, Mengchu Zhou","doi":"10.1109/CoASE.2013.6653916","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653916","url":null,"abstract":"This work intends to schedule a dual-arm cluster tool for the atomic layer deposition (ALD) process with wafer residency time constraints. ALD is a typical wafer revisiting process. Based on the analysis of system properties, a novel scheduling strategy called modified 1-wafer cyclic scheduling is derived. With this strategy, necessary and sufficient schedulability conditions are established. If schedulable, scheduling algorithms are presented to obtain a feasible and optimal schedule. By the proposed method, a schedule can be found by just simple calculation. An illustrative example is given to show the application of the proposed approach.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133306321","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
A mixed-integer linear programming model for automatic routing decisions in oil production optimization 石油生产优化自动路径决策的混合整数线性规划模型
2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653923
T. L. Silva, E. Camponogara, A. Teixeira, S. Sunjerga
{"title":"A mixed-integer linear programming model for automatic routing decisions in oil production optimization","authors":"T. L. Silva, E. Camponogara, A. Teixeira, S. Sunjerga","doi":"10.1109/CoASE.2013.6653923","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653923","url":null,"abstract":"Production optimization of gas-lifted oil wells with routing and pressure constraints is a complex problem, which has attracted the interest of engineers and scientists alike. To this end, a mixed-integer nonlinear model is developed to automatically decide upon flowing well production to a single or multiple manifolds (in the paper referred to as automatic routing). To bypass the complexity of the problem due to its nonlinear and discrete characteristics, a mixed-integer linear reformulation is proposed using piecewise-linear approximations. The resulting formulation splits flows in the pipelines based on the pressure differences which is also observed in commercial multiphase flow simulators. Finally, a computational analysis shows that significant gains can be obtained in oil production by considering automatic routing in the optimization model.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132729659","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
Electrophoresis-based motion planning and control of a nanowire in fluid suspension 流体悬浮液中纳米线的电泳运动规划与控制
2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653994
Kaiyan Yu, Xiang Lu, J. Yi, J. Shan
{"title":"Electrophoresis-based motion planning and control of a nanowire in fluid suspension","authors":"Kaiyan Yu, Xiang Lu, J. Yi, J. Shan","doi":"10.1109/CoASE.2013.6653994","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653994","url":null,"abstract":"Automated manipulation of nanowires or nanotubes would enable the scalable manufacturing of nanodevices for a variety of applications. This paper presents electrophoresis-based motion planning and control of a single nanowire in liquid suspension with a simple, generic set of electrodes. We first present a dynamic model of nanowires motion in dilute suspension with a set of N × N controllable electrodes. Since the motion planning of a nanowire from one position to the target location is NP-hard, we present two heuristic algorithms and then compare these algorithms with the rapidly-exploring random tree (RRT) and A*-based approaches. The results show that the proposed algorithms obtain suboptimal minimum time trajectories. The experimental and numerical results confirm the analytical findings.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115427297","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}
引用次数: 8
Performance evaluation of knowledge-based kitting via simulation 基于仿真的知识装配性能评价
2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653905
T. Kramer, Z. Kootbally, S. Balakirsky, C. Schlenoff, Anthony Pietromartire, Satyandra K. Gupta
{"title":"Performance evaluation of knowledge-based kitting via simulation","authors":"T. Kramer, Z. Kootbally, S. Balakirsky, C. Schlenoff, Anthony Pietromartire, Satyandra K. Gupta","doi":"10.1109/CoASE.2013.6653905","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653905","url":null,"abstract":"The IEEE Robotics and Automation Society's (RAS) Ontologies for Robotics and Automation Working Group is dedicated to developing a knowledge representation for robotics and automation. As part of this working group, the Industrial Robots sub-group is tasked with studying industrial applications of the knowledge representation. One of the first areas of interest for this subgroup is the area of kit building or kitting. This is a process that brings parts that will be used in assembly operations together in a kit and then moves the kit to the area where the parts are used in the final assembly. It is anticipated that utilization of the knowledge representation will allow for the development of higher performing kitting systems. While our previous efforts were aimed at designing the basis for performance methods and metrics that may be utilized to determine the performance of kitting systems, this paper presents a system that evaluates the performance of kitting systems through simulation using specific metrics.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116925213","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
首页 上一页 下一页 尾页
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学术官方微信