{"title":"Robot tasks sequence planning using Petri nets","authors":"J. Rosell, N. Muñoz, A. Gambin","doi":"10.1109/ISATP.2003.1217182","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217182","url":null,"abstract":"The automatic programming of robots to assemble products must cope with assembly planning and task planning problems. These problems are not independent, since an assembly operation may be performed by a different robot task depending on the previous assembly operations performed. Therefore, the cost of assembly operations vary depending on the assembly sequence. This paper deals with the problem of finding the optimum sequence of robot tasks taking into account this variable cost of assembly operations. The proposed approach can cope with products with AND/OR/XOR relations and uses Petri nets as a modelling methodology. The search of a near-optimum sequence of robot tasks is done with an heuristic search of the reachability tree of the Petri net.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131711356","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}
{"title":"A parallel hybrid metaheuristic for the single machine scheduling problem","authors":"Viorel Mlnzu, Liviu Beldiman","doi":"10.1109/ISATP.2003.1217200","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217200","url":null,"abstract":"This paper proposes a parallel hybrid metaheuristic-based scheduling system for the Single Machine Scheduling Problem, with a High-level Relay Hybrid structure. A genetic algorithm performs the diversification phase of the optimization. At the end of this phase, the population contains good solutions placed in different regions of the search space. A parallel Kangaroo algorithm performs the intensification phase. Every individual solution from this population is considered as an initial solution for the Kangaroo algorithm, which has an empirical diversification tool, but is a fast and simple local optimizer.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124966210","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}
{"title":"Economical justification of flexible microassembly cells","authors":"S. Chollet, F. Bourgeois, J. Jacot","doi":"10.1109/ISATP.2003.1217186","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217186","url":null,"abstract":"Cost is a most important factor to take into account when choosing an assembly system. Traditional choice between manual and automatic assembly with several degrees of partial automation is no longer possible in microassembly. Automation is crucial for precision and quality in handling and attachment of microcomponents. We show the economical interest of a very flexible semi-automatic assembly cell, and when it is most cost-effective. We propose a realization based on a high precision robot and an Intuitive Programming Interface.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128769472","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}
{"title":"Bin packing extensions for solving an industrial line balancing problem","authors":"C. Boutevin, M. Gourgand, S. Norre","doi":"10.1109/ISATP.2003.1217197","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217197","url":null,"abstract":"This paper deals with the relation between the bin packing problem and an industrial line balancing problem. In many papers, the bin packing problem has been linked to the Simple Assembly Line Balancing Problem (one range of vehicles). To make this relation with a more complex industrial line balancing problem, we propose to extend the classical bin packing model in order to take into account specificities of our problem. After that, this new line balancing problem is solved with optimization methods dedicated to the bin packing problem. In order to integrate precedence constraints between operations, these methods are adapted by coupling them with methods for P/spl bsol/Prec/spl bsol/Cmax. The methods have been tested on real instances and have given good results.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128381099","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}
{"title":"Detection of errors in case hardening processes brought on by cooling lubricant residues","authors":"H. Bley, P. Braun, N. Fischer","doi":"10.1109/ISATP.2003.1217209","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217209","url":null,"abstract":"Life cycle of case hardened steel work pieces depends on the quality of hardening. A large influencing factor on the quality of hardening is the cleanliness of the work pieces. In manufacturing a large amount of auxiliary materials such as cooling lubricants and drawing compounds are used to ensure correct execution of cutting and forming processes. Especially the residues of cooling lubricants are carried into following processes on the surfaces of the machined parts. Stable and controlled conditions cannot be guaranteed for these subsequent processes as the residues' influence on the process performance is known insufficiently, leading to a high uncertainty and consequently high expense factor. Therefore, information is needed about the type and amount of contamination. In practice the influence of these cooling lubricants on case hardening steels is a well-known phenomenon but correlation of the residue volume and resulting hardness are not known. A short overview of the techniques to detect cooling lubricant residues will be given in this paper and a method to detect the influence of the residues on the hardening process of case hardening steels will be shown. An example will be given for case hardening steel 16MnCr5 (1.7131). The medium of contamination is ARAL SAROL 470 EP.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127750256","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}
{"title":"Optimum disassembly sequence with sequence-dependent disassembly costs","authors":"A. Lambert","doi":"10.1109/ISATP.2003.1217203","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217203","url":null,"abstract":"This research deals with disassembly sequencing, in particular the search for the optimum disassembly sequence. The existing exact method, which is based on mathematical programming is extended to deal with situations, in which the costs of disassembly operations are sequence-dependent. This is frequently applicable in practice, due to features such as tool exchange and reorientation/redirection. Existing methods have been compared with a new approach that is discussed and successfully tested. Iteration has been applied, as it is the appropriate tool for the elimination of cyclic quasi-solutions. It is observed that a limited amount of iterations is required for eliminating cyclic quasi-solutions. A rapid convergence can be observed. This is illustrated here with a case from the literature. The new method is suitable both in assembly, repair, and end-of-life disassembly, notably in considering selective disassembly and design for life cycle. By this, optimum disassembly sequences can quickly be obtained, because the use of integer variables is avoided here. The model can be treated as a binary linear programming problem.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131629156","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}
{"title":"Simultaneous manufacturing in batch production","authors":"A. Almeida, C. Ramos, S. do Carmo Silva","doi":"10.1109/ISATP.2003.1217225","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217225","url":null,"abstract":"This paper is concerned with the implementation of Simultaneous Manufacturing philosophy in batch production of job-shop like manufacturing systems. It addresses the processing of jobs, either simple, requiring the manufacture of a batch of parts, i.e. simple products, or complex, comprehending the parts fabrication and their multistage assembly into a batch of products. In this work the simultaneous manufacturing philosophy was implemented through the widespread use of batch overlapping, which proved particularly effective in reducing job throughput time, maintaining operating simplicity and requiring reduced coordination.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124352726","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}
{"title":"Description and performances of a four-degrees-of-freedom piezoelectric gripper","authors":"J. Agnus, P. De Lit, C. Clévy, N. Chaillet","doi":"10.1109/ISATP.2003.1217189","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217189","url":null,"abstract":"The aim of the research conducting to this paper was to design a simple, efficient and cheap microrobot, with a view to mass production. The devised microprehensile microrobot on chip (MMOC) is able to grip, hold and release submillimetric-sized objects. It is a two-fingered micro-gripper, with fingers able to move independently one from each other in two orthogonal directions. The gripper thus has four degrees of freedom. The paper describes the functioning principle of the MMOC and details its elementary piezoelectric actuator, which is compared to existing piezoelectric tubes. The realised prototype is then presented and its performances are commented.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124427281","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}
{"title":"A method for dealing with multi-objective optimization problem of disassembly processes","authors":"L. Duta, F. Filip, J. Henrioud","doi":"10.1109/ISATP.2003.1217205","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217205","url":null,"abstract":"Disassembly of manufactured goods induces both disassembly costs and revenues from the parts saved by the process. Thus, a good trade-off has to be found that depends, both on the depth of the disassembly and on the sequence of operations. This optimization problem depends upon the structure of the disassembly system: if it is made of a single workstation, the costs depend mainly upon the process duration. If the system is a line, the costs depend mainly upon the line balancing, when it is highly manual. In this paper, the authors consider the line structure and propose an algorithm which allow one to find a disassembly sequence that optimizes a very simple function integrating the income from the parts, the material produced by the process and the cycle time of the disassembly line. An example is given to illustrate the proposed algorithm.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115233967","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}
{"title":"A proposal of grasping information interface for remote pointing task","authors":"S. Sato, M. Kitajima, Y. Fukui","doi":"10.1109/ISATP.2003.1217207","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217207","url":null,"abstract":"Grasping-and-moving are fundamental hand operations necessary for performing tasks using modern man-machine interfaces. However, behavioral information associated with grasping, such as force, posture, etc., has not been utilized for traditional interfaces. Although behavioral information should have potential utility in developing task-adaptive and operator-adaptive interfaces; it is known that how people grasp devices is dependent on the purpose of these tasks. This paper describes a computer mouse as a typical pointing device, whose approaching speed, or gain, is adjusted depending on the nature of the task. This paper suggests that the grasping-and-moving tasks should consist of two phases. The first or approaching phase is when the operator moves the mouse pointer close to the target with a small grasping force. The second or positioning phase follows when the operator makes a fine adjustment of the pointer to locate it within the target area using a larger grasping force. This proposed new computer mouse has a sensor to detect the operator's grasping force and uses it to control the gain of the mouse. Two sets of experiments were conducted; one for confirming the assumption that the grasping force should be small while approaching the target and large while positioning it; and the other for confirming that the proposed mouse should be effective in reducing the time necessary for pointing various kinds of objects.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116390325","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}