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

On the equilibrium probabilities of deterministic flow lines with random arrivals 随机到达的确定性流线的均衡概率

2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6654007

Woo-sung Kim, J. R. Morrison

{"title":"On the equilibrium probabilities of deterministic flow lines with random arrivals","authors":"Woo-sung Kim, J. R. Morrison","doi":"10.1109/CoASE.2013.6654007","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6654007","url":null,"abstract":"Flow lines serve as fundamental models for many manufacturing systems. However, while they have been studied for decades, for flow lines with randomness, exact performance measures are only available when there are three servers or less. In this paper, we study the steady state behavior of flow lines with deterministic service and a renewal arrival process. Using a recursion based on an exact channel decomposition of the system, we demonstrate that the delays in each server possess the Markovian property. Restricting our scope to discrete-time flow lines under a renewal arrival process, we can exploit this property to obtain a multidimensional discrete-time time-homogeneous Markov chain for the server delays. For this Markov chain, it is possible to obtain a finite collection of balance equations that can be solved numerically for the equilibrium probabilities. As an example, we demonstrate how to derive the equilibrium probabilities for single channel flow lines with geometric interarrival times. To our knowledge, these are the first exact results that can be applied to flow lines consisting of more than three servers.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"33 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":"131211531","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

Stackelberg game formulation of prize competition design for seeking shortest path solutions 寻求最短路径的有奖竞赛设计的Stackelberg博弈公式

2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6654073

Ting-Yu Ho, Shi-Chung Chang

{"title":"Stackelberg game formulation of prize competition design for seeking shortest path solutions","authors":"Ting-Yu Ho, Shi-Chung Chang","doi":"10.1109/CoASE.2013.6654073","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6654073","url":null,"abstract":"Prize competitions have been an open approach of soliciting expertise and creativity from the public to increase business success or solve problems. In spite of many successes, there are yet needs for an effective design methodology. To investigate methodology development, we consider a problem of shortest path solution seeking consisting of one path solution seeker (PSS) and multiple providers (PSPs). PSS has a coarse overall grasp of a transportation network and each PSP knows part of the network in detail and has a good path finding capacity. To find short path between two cities, the PSS divides the network into several sections and holds prize competitions in all sections to solicit shortest path solutions among specified pairs of cities. PSS further connects procured solutions into one desired shortest path. Moreover, to protect PSPs' intellectual rights, they first submit the distance of path only. Then the PSP with shortest path submission in each section turns over the route of path and is awarded the prize. In this paper, we formulate the optimal prize setting problem for PSS considering competitive submission strategies of PSPs. We model the hierarchical behaviors between PSS and PSPs as a Stackelberg game. Stackelberg equilibrium can be further investigated based on the model and serve the purpose of prize competition design for applications to collective innovation seeking.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"102 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":"115607200","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

Applications and requirements of industrial robots in meat processing 工业机器人在肉类加工中的应用与要求

2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653967

Sang Choi, George Zhang, T. Fuhlbrigge, T. Watson, Richard Tallian

引用次数: 22

A method for generating tool paths for milling pockets in prismatic parts using multiple tools 一种使用多刀具在棱柱形零件中生成铣槽刀具路径的方法

2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653959

J. C. E. Ferreira, R. Lopez

{"title":"A method for generating tool paths for milling pockets in prismatic parts using multiple tools","authors":"J. C. E. Ferreira, R. Lopez","doi":"10.1109/CoASE.2013.6653959","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653959","url":null,"abstract":"A significant amount of mechanical parts is manufactured by milling, and the process of 2.5D rough milling is responsible for removing most of the material, while the finishing stage can be performed in machines with up to 5 axes. 2.5D milling is defined as the process composed of a series of 2D paths on the XY plane at different Z levels. A high material removal helps to reduce manufacturing time, which is very important for a company to compete in today's market, where it is necessary that the manufacturing processes become faster and more flexible. The generation of tool paths for 2.5D milling is a topic of great importance in the manufacture of parts, because a large amount of mechanical parts have surfaces parallel or normal to a single plan. This work seeks to contribute to reducing the machining time by generating paths for multiple tools where a tool with a larger diameter removes as much material as possible in a short time, and subsequently smaller diameter milling tools are used to remove the remaining material. The implemented method is based on the use of Boolean operations to determine the areas to be machined. Different pockets were machined using the paths generated by the proposed method, and up to three different cutter diameters were considered. The paths generated were compared with the paths generated by a commercial software, and the following factors were considered: machining time, tool flank wear, and surface roughness.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"49 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120891175","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

ReFrESH: A self-adaptive architecture for autonomous embedded systems 一种用于自主嵌入式系统的自适应架构

2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6654042

Yanzhe Cui, R. Voyles, M. Mahoor

引用次数: 7

Incentive compatible mechanisms for power cut allocation in smart grids 智能电网停电分配的激励兼容机制

2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6654021

Chetan Yadati, D. Kaur, N. Balakrishnan, A. Sarkar, Y. Narahari

引用次数: 0

A two-stage approach for VMAT treatment plan optimization VMAT治疗方案优化的两阶段方法

2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653940

Bofei Sun, Jie Song, G. Zhu, Leyuan Shi

引用次数: 4

Exploiting robustness in Petri net-based closed-loop systems to accommodate control specification changes 利用基于Petri网的闭环系统的鲁棒性来适应控制规范的变化

2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653990

Jun Li, Mengchu Zhou, X. Dai

{"title":"Exploiting robustness in Petri net-based closed-loop systems to accommodate control specification changes","authors":"Jun Li, Mengchu Zhou, X. Dai","doi":"10.1109/CoASE.2013.6653990","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653990","url":null,"abstract":"Supervisory control reconfiguration has been paid more attention due to its capacity of handling the uncertainties including resource failures, capability degradation, and task changes in discrete event systems. However, the robustness of closed-loop systems in response to some specification changes was not addressed in the prior studies. This paper presents a reconfiguration method based on Petri nets and integer programming for supervisory control of resource allocation systems with changeable resource allocation relationships (control specifications). First, we propose a reconfiguration mechanism. It updates the P-invariant-based supervisor and evolves the state of the closed-loop system. The latter adapts to the certain changes in specifications by the self-regulation of the closed-loop system's state. It utilizes fully the robustness in a closed-loop system and avoids unnecessary modification of a supervisor. Then, a reconfiguration model with robustness analysis is proposed based on integer programming. By using it, a firing sequence of transitions as a serial of reconfiguration actions can be found. The execution of the sequence implements the state evolution of a closed-loop system. There is no need for making additional efforts to analyze state reachability of the system, since the firability condition of transitions is incorporated into the model. Finally, the method is illustrated through an example of a hospital emergency service system.","PeriodicalId":191166,"journal":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","volume":"111 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":"121125700","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

Design and fabrication of an assistive device for arm rehabilitation using twisted string system 一种基于绞绳系统的手臂康复辅助装置的设计与制造

2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653983

R. Shisheie, Lei Jiang, L. Banta, M. Cheng

引用次数: 15

Reconfiguring a modular robot into a humanoid formation: A multi-body dynamic perspective on motion scheduling for modules and their assemblies 将模块化机器人重新配置为类人机器人:模块及其组件运动调度的多体动力学视角

2013 IEEE International Conference on Automation Science and Engineering (CASE) Pub Date : 2013-11-07 DOI: 10.1109/CoASE.2013.6653891

P. Moubarak, E. Alvarez, P. Ben-Tzvi

引用次数: 8