Pub Date : 2011-10-13DOI: 10.1109/CASE.2011.6042531
M. Rakotondrabe, Y. Haddab, C. Clévy, P. Lutz
This paper provides a general overview of the material covered in the fullday workshop with the same title devoted to the field of automation in microassembly and packaging at the micro/nanoscale.
{"title":"Automation of assembly and packaging at the micro/nano-scale","authors":"M. Rakotondrabe, Y. Haddab, C. Clévy, P. Lutz","doi":"10.1109/CASE.2011.6042531","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042531","url":null,"abstract":"This paper provides a general overview of the material covered in the fullday workshop with the same title devoted to the field of automation in microassembly and packaging at the micro/nanoscale.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115396526","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 : 2011-10-13DOI: 10.1109/CASE.2011.6042438
R. Falconi, Andrea Paoli, C. Bonivento
Achieving sustainable mobility is one of the challenges of the 21st century; a crucial goal is to mitigate traffic congestions while improving safety. The increasing needs for efficient traffic management strategies and for efficient, reliable and safe traffic infrastructures is changing the point of view on mathematical models from bare simulation tools to sophisticated design and optimization tools. Moreover the attention is rapidly moving the focus from centralized supervision strategies, to decentralized control strategies. In this paper we present a modular microscopic mathematical model for heterogeneous vehicular traffic on road networks, able to describe vehicles interactions with the network infrastructure (roads, traffic lights, etc.) and with other vehicles according to the well known potential fields approach. The modeling tool is able to capture different vehicles interactions and traffic phenomena such as queues, overtaking and car crashes. The obtained modeling tool has a strong control-oriented and optimization-oriented characterization and appears promising for traffic supervision and control design and for addressing optimization problems when designing the traffic infrastructure.
{"title":"Potential field-based microscopic modeling of road networks with heterogeneous vehicular traffic","authors":"R. Falconi, Andrea Paoli, C. Bonivento","doi":"10.1109/CASE.2011.6042438","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042438","url":null,"abstract":"Achieving sustainable mobility is one of the challenges of the 21st century; a crucial goal is to mitigate traffic congestions while improving safety. The increasing needs for efficient traffic management strategies and for efficient, reliable and safe traffic infrastructures is changing the point of view on mathematical models from bare simulation tools to sophisticated design and optimization tools. Moreover the attention is rapidly moving the focus from centralized supervision strategies, to decentralized control strategies. In this paper we present a modular microscopic mathematical model for heterogeneous vehicular traffic on road networks, able to describe vehicles interactions with the network infrastructure (roads, traffic lights, etc.) and with other vehicles according to the well known potential fields approach. The modeling tool is able to capture different vehicles interactions and traffic phenomena such as queues, overtaking and car crashes. The obtained modeling tool has a strong control-oriented and optimization-oriented characterization and appears promising for traffic supervision and control design and for addressing optimization problems when designing the traffic infrastructure.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124101398","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 : 2011-10-13DOI: 10.1109/CASE.2011.6042406
H. Yonezawa, Hamada Koichi, Manabu Zennami, Katsuhisa Ida, N. Higuchi, Yoshihito Sugano, M. Yamada, Toshihiro Fujita
In an effort to optimize our production system, in 2000 we introduced a robot cell production system controlled by low carbon-footprint Senju (thousand-handed) Kannon Model robots on our manufacturing line. Since then, over a period of 11 years, we have successfully produced more than 52 million product units, using this cell production system. During this period, we have made many improvements to the system, such shortening the takt time in the production process. Then, in a new quest for improvement, we focused our attention on the production system's operating conditions. More specifically, we have carried out research and development studies on the prospect of minimizing production systemdowntime, to improve our operating efficiency, and on running the production system non-stop for long periods of time.
{"title":"Long-term operational experience with a robot cell production system controlled by low carbon-footprint Senju (thousand-handed) Kannon Model robots and an approach to improving operating efficiency","authors":"H. Yonezawa, Hamada Koichi, Manabu Zennami, Katsuhisa Ida, N. Higuchi, Yoshihito Sugano, M. Yamada, Toshihiro Fujita","doi":"10.1109/CASE.2011.6042406","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042406","url":null,"abstract":"In an effort to optimize our production system, in 2000 we introduced a robot cell production system controlled by low carbon-footprint Senju (thousand-handed) Kannon Model robots on our manufacturing line. Since then, over a period of 11 years, we have successfully produced more than 52 million product units, using this cell production system. During this period, we have made many improvements to the system, such shortening the takt time in the production process. Then, in a new quest for improvement, we focused our attention on the production system's operating conditions. More specifically, we have carried out research and development studies on the prospect of minimizing production systemdowntime, to improve our operating efficiency, and on running the production system non-stop for long periods of time.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123534806","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 : 2011-10-13DOI: 10.1109/CASE.2011.6042476
G. Perboli, T. Crainic, R. Tadei
In this paper, we introduce GASP - Greedy Adaptive Search Procedure, a metaheuristic able to efficiently address two and three-dimensional multiple container packing problems. GASP combines the simplicity of greedy algorithms with learning mechanisms aimed to guide the overall method towards good solutions. Extensive experiments indicate that GASP attains near-optimal solutions in very short computational times, and improves state-of-the-art results in comparable computational times.
{"title":"An efficient metaheuristic for multi-dimensional multi-container packing","authors":"G. Perboli, T. Crainic, R. Tadei","doi":"10.1109/CASE.2011.6042476","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042476","url":null,"abstract":"In this paper, we introduce GASP - Greedy Adaptive Search Procedure, a metaheuristic able to efficiently address two and three-dimensional multiple container packing problems. GASP combines the simplicity of greedy algorithms with learning mechanisms aimed to guide the overall method towards good solutions. Extensive experiments indicate that GASP attains near-optimal solutions in very short computational times, and improves state-of-the-art results in comparable computational times.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121380311","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 : 2011-10-13DOI: 10.1109/CASE.2011.6042496
D. Anghinolfi, M. Paolucci, S. Sacone, S. Siri
In this paper we deal with the operational planning of transportation operations in an intermodal network. The objective is to satisfy a given transportation demand by using road vehicles and trains, in order to minimize the total transportation cost and meeting a set of operational constraints. We propose a linear integer programming model and an Ant Colony Optimization metaheuristic approach in a pure and a hybrid version. We present and compare the results obtained testing all the approaches on a benchmark set made of randomly generated problem instances. The tests show the appreciable behavior of the IP model, that however requires a considerable amount of time, and the ability of the hybrid ACO to generate high quality solutions for all the benchmark instances with a quite reduced computational effort.
{"title":"Integer programming and ant colony optimization for planning intermodal freight transportation operations","authors":"D. Anghinolfi, M. Paolucci, S. Sacone, S. Siri","doi":"10.1109/CASE.2011.6042496","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042496","url":null,"abstract":"In this paper we deal with the operational planning of transportation operations in an intermodal network. The objective is to satisfy a given transportation demand by using road vehicles and trains, in order to minimize the total transportation cost and meeting a set of operational constraints. We propose a linear integer programming model and an Ant Colony Optimization metaheuristic approach in a pure and a hybrid version. We present and compare the results obtained testing all the approaches on a benchmark set made of randomly generated problem instances. The tests show the appreciable behavior of the IP model, that however requires a considerable amount of time, and the ability of the hybrid ACO to generate high quality solutions for all the benchmark instances with a quite reduced computational effort.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128942067","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 : 2011-10-13DOI: 10.1109/CASE.2011.6042493
C. Vasile, A. Pavel, C. Buiu
A multi-agent control architecture for swarm robotics applications which includes an innovative human-swarm interface is proposed. The architecture is designed to allow an operator to monitor and guide a robotic swarm to accomplish its missions. The system is composed of three types of agents, a graphical user interface agent, and a pair of a local and a social agent for each robot in the swarm. The local agent implements low level robot-specific functionalities like movement, obstacle avoidance and localization. The control algorithm is implemented in the social agent and is based on an adapted distributed version of the Particle Swarm Optimization technique. An original method, Gravity Points Method, for representing goals which are used by the human-swarm interface is also proposed. Experimental results using simulated e-puck robots are presented and directions for further developments are given.
{"title":"Integrating human swarm interaction in a distributed robotic control system","authors":"C. Vasile, A. Pavel, C. Buiu","doi":"10.1109/CASE.2011.6042493","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042493","url":null,"abstract":"A multi-agent control architecture for swarm robotics applications which includes an innovative human-swarm interface is proposed. The architecture is designed to allow an operator to monitor and guide a robotic swarm to accomplish its missions. The system is composed of three types of agents, a graphical user interface agent, and a pair of a local and a social agent for each robot in the swarm. The local agent implements low level robot-specific functionalities like movement, obstacle avoidance and localization. The control algorithm is implemented in the social agent and is based on an adapted distributed version of the Particle Swarm Optimization technique. An original method, Gravity Points Method, for representing goals which are used by the human-swarm interface is also proposed. Experimental results using simulated e-puck robots are presented and directions for further developments are given.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130432300","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 : 2011-10-13DOI: 10.1109/CASE.2011.6042474
M. Seker, E. Zergeroglu
In this work, we have investigated the dynamics behavior and the control problem of a specific type of DC to DC converters known as the flyback converter. Flyback converters are basically a transformer-isolated version of the standard buck-boost converter. As opposed to the classical sliding mode controllers used for DC/DC converters, we proposed an alternative sliding mode controller that takes the combination of the output voltage and the intermediate transformer output current as the error signal to be regulated. Simulation results are presented to illustrate the effectiveness of the proposed method.
{"title":"A new sliding mode controller for the DC to DC flyback converter","authors":"M. Seker, E. Zergeroglu","doi":"10.1109/CASE.2011.6042474","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042474","url":null,"abstract":"In this work, we have investigated the dynamics behavior and the control problem of a specific type of DC to DC converters known as the flyback converter. Flyback converters are basically a transformer-isolated version of the standard buck-boost converter. As opposed to the classical sliding mode controllers used for DC/DC converters, we proposed an alternative sliding mode controller that takes the combination of the output voltage and the intermediate transformer output current as the error signal to be regulated. Simulation results are presented to illustrate the effectiveness of the proposed method.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127521045","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 : 2011-10-13DOI: 10.1109/CASE.2011.6042507
Yu-Ting Kao, Shun-Cheng Zhan, Shi-Chung Chang, Jen-Hsuan Ho, Peng Wang, P. Luh, Simon Wang, Fenix Wang, Joey Chang
Furnace tools often constitute a bottleneck of a semiconductor wafer fab. They are characterized by long processing times with batching requirements. The problem is further complicated by stringent limitations on waiting times before furnace processing and the heterogeneous tool configuration. A novel integer programming model of allocating furnace tools to process steps over time for achieving production targets is first formulated. The formulation adopts difference equations to describe flows of wafers-in-process (WIPs) and availability of individual tools. Waiting time limitation is captured by an inequality for every time slot that the number of wafers processed in the next time slots within the limitation must be no less than the available WIPs of the current time slot. Constraints on batching decision couple among constraints of wafer flow, tool availability and bounds of batch size. After converting all the constraints to linear forms, an optimization tool suite is then applied to solving test problems derived from a real fab with a stopping criterion of no more than 5% difference from optimality. Comparisons with a currently practiced heuristic show that the near optimal furnace allocations lead to 18.5% more processing in average and 39.6% shorter average waiting time in certain cases than those of the heuristic. Computation times are all within 30 seconds over a personal computer with a Intel P8700@2.53 GHz CPU. Such computation efficiency indicates a strong potential for applications to dynamic allocations in a fab.
{"title":"Near optimal furnace tool allocation with batching and waiting time constraints","authors":"Yu-Ting Kao, Shun-Cheng Zhan, Shi-Chung Chang, Jen-Hsuan Ho, Peng Wang, P. Luh, Simon Wang, Fenix Wang, Joey Chang","doi":"10.1109/CASE.2011.6042507","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042507","url":null,"abstract":"Furnace tools often constitute a bottleneck of a semiconductor wafer fab. They are characterized by long processing times with batching requirements. The problem is further complicated by stringent limitations on waiting times before furnace processing and the heterogeneous tool configuration. A novel integer programming model of allocating furnace tools to process steps over time for achieving production targets is first formulated. The formulation adopts difference equations to describe flows of wafers-in-process (WIPs) and availability of individual tools. Waiting time limitation is captured by an inequality for every time slot that the number of wafers processed in the next time slots within the limitation must be no less than the available WIPs of the current time slot. Constraints on batching decision couple among constraints of wafer flow, tool availability and bounds of batch size. After converting all the constraints to linear forms, an optimization tool suite is then applied to solving test problems derived from a real fab with a stopping criterion of no more than 5% difference from optimality. Comparisons with a currently practiced heuristic show that the near optimal furnace allocations lead to 18.5% more processing in average and 39.6% shorter average waiting time in certain cases than those of the heuristic. Computation times are all within 30 seconds over a personal computer with a Intel P8700@2.53 GHz CPU. Such computation efficiency indicates a strong potential for applications to dynamic allocations in a fab.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127867930","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 : 2011-10-13DOI: 10.1109/CASE.2011.6042400
Ahmed Nazeem, S. Reveliotis
Most of the past research on the problem of deadlock avoidance for sequential resource allocation systems (RAS) has acknowledged the fact that the maximally permissive deadlock avoidance policy (DAP) possesses super-polynomial complexity for most RAS classes, and it has resorted to solutions that trade off maximal permissiveness for computational tractability. In this work, we seek the effective implementation of the maximally permissive DAP for sequential RAS, by distinguishing between the off-line and the on-line computation required for the specification of this policy, and developing a representation of the derived result that will require minimal on-line computation. The particular representation that we adopt is that of a compact classifier that will effect the underlying dichotomy of the reachable state space into safe and unsafe subspaces. The reported results establish that the proposed method can support the effective deployment of maximally permissive DAP for RAS with very large state spaces.
{"title":"Designing maximally permissive deadlock avoidance policies for sequential resource allocation systems through classification theory","authors":"Ahmed Nazeem, S. Reveliotis","doi":"10.1109/CASE.2011.6042400","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042400","url":null,"abstract":"Most of the past research on the problem of deadlock avoidance for sequential resource allocation systems (RAS) has acknowledged the fact that the maximally permissive deadlock avoidance policy (DAP) possesses super-polynomial complexity for most RAS classes, and it has resorted to solutions that trade off maximal permissiveness for computational tractability. In this work, we seek the effective implementation of the maximally permissive DAP for sequential RAS, by distinguishing between the off-line and the on-line computation required for the specification of this policy, and developing a representation of the derived result that will require minimal on-line computation. The particular representation that we adopt is that of a compact classifier that will effect the underlying dichotomy of the reachable state space into safe and unsafe subspaces. The reported results establish that the proposed method can support the effective deployment of maximally permissive DAP for RAS with very large state spaces.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"159 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114051718","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 : 2011-10-13DOI: 10.1109/CASE.2011.6042498
M. P. Fanti, G. Stecco, W. Ukovich
This paper deals with the problem of scheduling the internal operations in Distribution Centers (DC). Internal operations of the DC consist essentially in de-consolidating inbound cases, sorting products according to customer requests and consolidating outbound cases. The objective is to minimize the total operation time determining the optimal sequence of the internal operations.
{"title":"Solving scheduling problems in distribution centers using symmetry breaking constraints","authors":"M. P. Fanti, G. Stecco, W. Ukovich","doi":"10.1109/CASE.2011.6042498","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042498","url":null,"abstract":"This paper deals with the problem of scheduling the internal operations in Distribution Centers (DC). Internal operations of the DC consist essentially in de-consolidating inbound cases, sorting products according to customer requests and consolidating outbound cases. The objective is to minimize the total operation time determining the optimal sequence of the internal operations.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124203201","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
扫码关注我们
求助内容：
应助结果提醒方式：