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

2006 IEEE International Conference on Automation Science and Engineering最新文献

筛选
英文 中文
A Class of Optimal Operation Planning for Kanban Managed Multi-Stage Production System 一类看板管理多阶段生产系统的最优作业计划
2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI: 10.1109/COASE.2006.326910
Yunmei Fang, Yueh-Jaw Lin
{"title":"A Class of Optimal Operation Planning for Kanban Managed Multi-Stage Production System","authors":"Yunmei Fang, Yueh-Jaw Lin","doi":"10.1109/COASE.2006.326910","DOIUrl":"https://doi.org/10.1109/COASE.2006.326910","url":null,"abstract":"This paper deals with the evaluation of an operation planning for a multi-stage, single-product kanban managed production system with varying production rates at different work-stages. Raw materials are replenished at the first work-stage and processed through multi-work-stages to generate the finished products. Simultaneous releases of kanbans are considered to determine the orders of raw parts at all stages. The study pursued is to determine the optimal orders of raw materials at the first work-stage with a varying (linear) demand pattern to minimize the total inventory cost incurred due to raw materials, finished products and work-in-process (WIP) inventories. This decision eventually determines the number of kanbans at each stage, and the economic deliveries of the finished products. This paper further studies the effect of the configuration of the production rates at different work-stages on the total inventory cost. Simulation results verify the effectiveness of the proposed optimal operation planning mechanism for the multi-stage kanban managed production system","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128199690","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
Design and Analysis of a Welding Robot 焊接机器人的设计与分析
2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI: 10.1109/COASE.2006.326924
M. Bahrami-Samani, M. Agahi, S. M. A. Moosavian
{"title":"Design and Analysis of a Welding Robot","authors":"M. Bahrami-Samani, M. Agahi, S. M. A. Moosavian","doi":"10.1109/COASE.2006.326924","DOIUrl":"https://doi.org/10.1109/COASE.2006.326924","url":null,"abstract":"In this paper, the design and implementation of a novel welding robot is presented. The robot welds boiler pipes of power plants. The automation of this process is needed because of the high rework expense to repair defective connections, which are unavoidable in manual welding. The mechanism of the robot is capable of maneuvering between the pipes and adjusting to the specified range of pipes' diameter; it is also low in weight and portable which offers the operator the opportunity to work in variable manufacturing conditions. Moreover, the selection of a wide range of welding machines is possible. This paper shows how the robot is modeled and the description of the mechanism is given. The way in which the welding path is designed given the spatial trajectory and arc welding conditions is described. The welding, geometric and dynamic parameters define the essential simulation program, to optimize the mechanism and satisfy the constraints. The controller design algorithm is also investigated and the modified transpose Jacobian controlling algorithm is considered for this purpose. Its performance is compared to similar standard methods. The results illustrate the competitive performance of this algorithm i.e. the method is not only numerically simple but also is model independent.","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121447357","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}
引用次数: 17
Tremor Suppression of Elbow Joint via Functional Electrical Stimulation: A Simulation Study 功能性电刺激对肘关节震颤抑制的模拟研究
2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI: 10.1109/COASE.2006.326877
Dingguo Zhang, W. T. Ang
{"title":"Tremor Suppression of Elbow Joint via Functional Electrical Stimulation: A Simulation Study","authors":"Dingguo Zhang, W. T. Ang","doi":"10.1109/COASE.2006.326877","DOIUrl":"https://doi.org/10.1109/COASE.2006.326877","url":null,"abstract":"In this paper, we propose a 1-DOF musculoskeletal model of the elbow joint that consists of a pair of antagonist muscles and one skeleton. Simulation based on the proposed model is performed to study the feasibility of tremor suppression via functional electrical stimulation (FES). In order to effectively attenuate pathological tremor of the movement disorder patients with minimal effect in the voluntary movement, we propose a fuzzy logical controller (FLC), a proportional-derivative (PD) controller and a compensator to regulate the stimulator. Current simulation results have shown satisfactory performance for the postural tremor suppression","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"77 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134283652","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}
引用次数: 36
Visual Positioning Using Four-Point Planar Patterns 使用四点平面图形的视觉定位
2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI: 10.1109/COASE.2006.326949
De Xu, Youfu Li, M. Tan
{"title":"Visual Positioning Using Four-Point Planar Patterns","authors":"De Xu, Youfu Li, M. Tan","doi":"10.1109/COASE.2006.326949","DOIUrl":"https://doi.org/10.1109/COASE.2006.326949","url":null,"abstract":"The existence of multi-resolutions for the perspective-n-point (PnP) problem makes the position-based visual control based on PnP positioning method difficult for practical applications. In this paper, two simple four-point patterns are designed to ensure unique solution for the PnP problem. One is a triangle planar pattern, which consists of three points and their centroid. Another is quadrangle planar pattern. A recursive least square algorithm with a forgetting factor is introduced to improve the solution accuracy. The positioning accuracy based on PnP positioning method is investigated for the two patterns. The method presented in this paper has the advantages of minimum set of known points providing unique solution and linear pose estimation. Experiments are performed to verify the effectiveness of the proposed patterns and method.","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132157958","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
Nested Partitions Method for the Local Pickup and Delivery Problem 本地取货和送货问题的嵌套分区方法
2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI: 10.1109/COASE.2006.326911
Liang Pi, Yunpeng Pan, Leyuan Shi
{"title":"Nested Partitions Method for the Local Pickup and Delivery Problem","authors":"Liang Pi, Yunpeng Pan, Leyuan Shi","doi":"10.1109/COASE.2006.326911","DOIUrl":"https://doi.org/10.1109/COASE.2006.326911","url":null,"abstract":"We consider a problem in which a set of loads are to be moved by vehicles in a local service area in an optimal manner so as to maximize the overall profit over a given planning horizon. The problem is a general transportation problem with nonhomogeneous resources, and mixed integer linear programming (MILP) formulations are adopted, which can then be solved using off-the-shelf MILP solvers. Furthermore, we embark on a new approach based on a specialization of the nested partitions (NP) method - a meta-heuristic for combinatorial optimization problems. We also propose a number of NP-oriented techniques: (i) linear programming (LP) solution-based biased sampling, which turns to LP solution information for guidance toward good solutions, (ii) sampling-based (or LP solution-based) partitioning that uses sampling results (or the LP solution information) for purposes of deriving effective partitioning schemes, flexible backtracking, etc. These techniques, when used in conjunction with NP, can substantially enhance its efficacy. Our computational results show that on problems of realistic scale, our adapted NP approach overwhelmingly outperforms the standard approach of applying a commercial solver (ILOG CPLEX 9.1 in our experiments) to MILP formulations in terms of both computation time and solution quality","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127847449","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
Modeling and Analysis of Enterprise Processes 企业流程建模与分析
2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI: 10.1109/COASE.2006.326914
L. Zhang
{"title":"Modeling and Analysis of Enterprise Processes","authors":"L. Zhang","doi":"10.1109/COASE.2006.326914","DOIUrl":"https://doi.org/10.1109/COASE.2006.326914","url":null,"abstract":"In this paper a new extended Petri-net (EPNet) was proposed for the requirements of enterprise process modeling and analysis. EPNet is powerful in expression and analysis. EPNet extended the workflow net (WF_net) by adding some new elements and the corresponding mechanisms. All workflow patterns could be directly supported in EPNet. Control variable (CV) was introduced in EPNet for communication among tasks. Dynamical routing was supported in EPNet by extending task with entry function and jump function. In analysis, the soundness of EPNet consisted of consistency verification and analysis of liveness and boundness of corresponding Petri-net. Finally, an application example was introduced to illustrate how to apply the proposed method to describe and analysis real enterprise processes","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117162957","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
PARALLEL POPULATIONS GENETIC ALGORITHM FOR MINIMIZING ASSEMBLY VARIATION IN SELECTIVE ASSEMBLY 选择装配中装配变异最小的并行种群遗传算法
2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI: 10.1109/COASE.2006.326931
S. Ponnambalam, S. S. Sankar, S. Sriram, M. Gurumarimuthu
{"title":"PARALLEL POPULATIONS GENETIC ALGORITHM FOR MINIMIZING ASSEMBLY VARIATION IN SELECTIVE ASSEMBLY","authors":"S. Ponnambalam, S. S. Sankar, S. Sriram, M. Gurumarimuthu","doi":"10.1109/COASE.2006.326931","DOIUrl":"https://doi.org/10.1109/COASE.2006.326931","url":null,"abstract":"Selective assembly is a means by which high-precision assemblies are made from relatively low-precision components. This is accomplished by partitioning produced components into groups prior to random assembly. The mating components in the selective groups are then assembled at random. In this work, a parallel population genetic algorithm is developed to find the best combination of selective groups which will lead to overall minimum variation in the assembly tolerance, with minimum number of generation cycles during the GA search process. An attempt is also made to further speed up the convergence and diversification process of the GA by maintaining more number of concurrent parallel populations in the proposed methodology. It is proved that the proposed parallel populations genetic algorithm is much faster than the normal GA with single population.","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117314621","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}
引用次数: 16
Efficient learning algorithms for episodic tasks with acyclic state spaces 无循环状态空间情景任务的高效学习算法
2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI: 10.1109/COASE.2006.326917
S. Reveliotis, T. Bountourelis
{"title":"Efficient learning algorithms for episodic tasks with acyclic state spaces","authors":"S. Reveliotis, T. Bountourelis","doi":"10.1109/COASE.2006.326917","DOIUrl":"https://doi.org/10.1109/COASE.2006.326917","url":null,"abstract":"This paper considers the problem of computing an optimal policy for a Markov decision process (MDP), under lack of complete a priori knowledge of (i) the branching probability distributions determining the evolution of the process state upon the execution of the different actions, and (ii) the probability distributions characterizing the immediate rewards returned by the environment as a result of the execution of these actions at different states of the process. In addition, it is assumed that the underlying task evolves in a repetitive, episodic manner, with each episode starting from a well-defined initial state and evolving over an acyclic state space. A novel efficient algorithm for this problem is proposed, and its convergence properties and computational complexity are rigorously characterized in the formal framework of computational learning theory","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"11 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116824662","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
Performance analysis of complex supply chain networks with multi-product 多产品复杂供应链网络的性能分析
2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI: 10.1109/COASE.2006.326955
Yifan Wu, M. Dong
{"title":"Performance analysis of complex supply chain networks with multi-product","authors":"Yifan Wu, M. Dong","doi":"10.1109/COASE.2006.326955","DOIUrl":"https://doi.org/10.1109/COASE.2006.326955","url":null,"abstract":"Inventory control is one of the main issues in multi-stage manufacturing and supply chain systems, and many literatures have developed different methods to solve such problems. However, most of the work focuses on systems with single type of product. In real world, industries always produce multiple types of products at one location. This paper develops a network model with multi-class inventory queues for the performance analysis of multi-stage supply chain networks with multi-product. A job queue decomposition method is employed to analyze the major performance measures and an approach for aggregating input streams and separating output streams is proposed to link all the sites or nodes in the supply chain network together. Numerical results show that the proposed method works well.","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132447615","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
Research of Multi-operation Quality Control based on Minimum Quality Loss 基于最小质量损失的多工序质量控制研究
2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI: 10.1109/COASE.2006.326921
Chun Chen, Liping Zhao, Yiyong Yao
{"title":"Research of Multi-operation Quality Control based on Minimum Quality Loss","authors":"Chun Chen, Liping Zhao, Yiyong Yao","doi":"10.1109/COASE.2006.326921","DOIUrl":"https://doi.org/10.1109/COASE.2006.326921","url":null,"abstract":"Aiming at the problem of mutual influence between multi-operation and the optimization of quality control in product manufacturing process, quality transfer model between the preceding operation and the succeeding operation is established based on two kinds of quality. Partial quality of the succeeding operation is analyzed quantitatively through analysis and calculation of this model, so that quality control in the succeeding operation is implemented without the preceding influence. And quality loss model of multi-operation is introduced using Duncan cost model and Taguchi quality loss function. The loss model takes into account quality loss of multi-operation in product manufacturing process from the point of view of overall optimization. Based on analysis of the model, grid-search approach is applied and minimum quality loss is calculated as optimization objective so that control chart is designed optimally. Then the sample size, the sampling interval between successive samples, and the control limit coefficients of the chart are determined for multi-operation quality control. Finally, the model is analyzed by an instance of coating operation in purifier manufacturing process, and the result shows that the model is effective on reducing the manufacturing cost and guaranteeing the product quality","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"4 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114133867","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
首页 上一页 下一页 尾页
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学术官方微信
小红书