Pub Date : 1999-07-21DOI: 10.1109/ISATP.1999.782932
J.M. Dorador, R. Young
Sharing of information is an important issue in supporting the improvement in product development. The use of information models is an approach to support the intensive share of information required in concurrent engineering through the life cycle of the product. The paper explores the definition of the structure of information models for supporting the related processes of design for assembly and assembly process planning. This research takes the view that the information models required to support DFA and APP is captured in a product model and in a manufacturing model. A product model is the representation of the information about a product and the manufacturing model captures the facilities and capabilities of the enterprise. The key problem discussed is the structure of these information models that would allow not only the information support for the functionality of DFA and APP, but also their interaction in a shared environment.
{"title":"Information models to support the interaction between design for assembly and assembly process planning","authors":"J.M. Dorador, R. Young","doi":"10.1109/ISATP.1999.782932","DOIUrl":"https://doi.org/10.1109/ISATP.1999.782932","url":null,"abstract":"Sharing of information is an important issue in supporting the improvement in product development. The use of information models is an approach to support the intensive share of information required in concurrent engineering through the life cycle of the product. The paper explores the definition of the structure of information models for supporting the related processes of design for assembly and assembly process planning. This research takes the view that the information models required to support DFA and APP is captured in a product model and in a manufacturing model. A product model is the representation of the information about a product and the manufacturing model captures the facilities and capabilities of the enterprise. The key problem discussed is the structure of these information models that would allow not only the information support for the functionality of DFA and APP, but also their interaction in a shared environment.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127325134","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 : 1999-07-21DOI: 10.1109/ISATP.1999.782958
J. T. Tenreiro Machado, A. Galhano
A new method for the study and optimization of manipulator trajectories is developed. The novel feature resides on the modeling formulation. Standard system descriptions are based on a set of differential equations which, in general, require laborious computations and may be difficult to analyze. Moreover, the derived algorithms are suited to 'deterministic' tasks, such as those appearing in a repetitive work, and are not well adapted to a 'random' operation that occurs in intelligent systems interacting with a non-structured and changing environment. These facts motivate the development of alternative models based on distinct concepts. The proposed embedding of statistics and Fourier transform gives a new perspective towards the calculation and optimization of the robot trajectories in manipulating tasks.
{"title":"Fourier analysis of robot trajectories in random tasks","authors":"J. T. Tenreiro Machado, A. Galhano","doi":"10.1109/ISATP.1999.782958","DOIUrl":"https://doi.org/10.1109/ISATP.1999.782958","url":null,"abstract":"A new method for the study and optimization of manipulator trajectories is developed. The novel feature resides on the modeling formulation. Standard system descriptions are based on a set of differential equations which, in general, require laborious computations and may be difficult to analyze. Moreover, the derived algorithms are suited to 'deterministic' tasks, such as those appearing in a repetitive work, and are not well adapted to a 'random' operation that occurs in intelligent systems interacting with a non-structured and changing environment. These facts motivate the development of alternative models based on distinct concepts. The proposed embedding of statistics and Fourier transform gives a new perspective towards the calculation and optimization of the robot trajectories in manipulating tasks.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115245330","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 : 1999-07-21DOI: 10.1109/ISATP.1999.782986
J. Tavares, C. Ramos, J. Neves
We propose a methodology to solve the facility layout design problem by using constraint logic programming (CLP), which has proved to be a technology that gives good results when applied to a combinatorial problem optimisation. Methods to solve facility layout problems have to deal with a large set of factors, namely sales and production estimations, manufacturing process compatibilities, delivery dates, quality, spatial requirements, economics, management, human resources and environment. These factors make the facility layout design an extremely complex problem to solve. This complexity motivated the development of a methodology to solve the facility layout design problem using CLP.
{"title":"Constraint programming approach to solve facility layout design problems","authors":"J. Tavares, C. Ramos, J. Neves","doi":"10.1109/ISATP.1999.782986","DOIUrl":"https://doi.org/10.1109/ISATP.1999.782986","url":null,"abstract":"We propose a methodology to solve the facility layout design problem by using constraint logic programming (CLP), which has proved to be a technology that gives good results when applied to a combinatorial problem optimisation. Methods to solve facility layout problems have to deal with a large set of factors, namely sales and production estimations, manufacturing process compatibilities, delivery dates, quality, spatial requirements, economics, management, human resources and environment. These factors make the facility layout design an extremely complex problem to solve. This complexity motivated the development of a methodology to solve the facility layout design problem using CLP.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132015006","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 : 1999-07-21DOI: 10.1109/ISATP.1999.782988
P. De Lit, B. Rekiek, F. Pellichero, A. Delchambre, J. Danloy, F. Petit, A. Leroy, Jean-François Marée, A. Spineux, B. Raucent
The main objective of the research presented is to develop a new philosophy for product and assembly line design. Most methodologies usually do not consider the interaction between the two design processes in presence. Moreover, most concurrent engineering approaches do not deal with multi-variant products. A research project was initiated to tackle this problem. The computer tool under development, called CISAL, is applicable to multi-variant products, leading to a unique assembly line for all variants. It is subdivided into three main modules, with possible feedback between them: product analysis, operating modes and assembly techniques, and line layout. We present the framework of this project and the underlying methodology.
{"title":"A new philosophy for the design of a product and its assembly line","authors":"P. De Lit, B. Rekiek, F. Pellichero, A. Delchambre, J. Danloy, F. Petit, A. Leroy, Jean-François Marée, A. Spineux, B. Raucent","doi":"10.1109/ISATP.1999.782988","DOIUrl":"https://doi.org/10.1109/ISATP.1999.782988","url":null,"abstract":"The main objective of the research presented is to develop a new philosophy for product and assembly line design. Most methodologies usually do not consider the interaction between the two design processes in presence. Moreover, most concurrent engineering approaches do not deal with multi-variant products. A research project was initiated to tackle this problem. The computer tool under development, called CISAL, is applicable to multi-variant products, leading to a unique assembly line for all variants. It is subdivided into three main modules, with possible feedback between them: product analysis, operating modes and assembly techniques, and line layout. We present the framework of this project and the underlying methodology.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126721231","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 : 1999-07-21DOI: 10.1109/ISATP.1999.782926
C. Bauckhage, F. Kummert, G. Sagerer
The representation of knowledge about assembled objects is a fundamental requirement, if computer systems are used to supervise construction tasks. Depending on the complexity of the task and the characteristics of the objects forming its basis the process of modeling may be burdensome. We introduce a method to model classes of assemblies instead of individual assembled objects. Based on functional properties of the involved objects this general model is used to derive hierarchical descriptions of individual assemblies automatically. Furthermore, the model allows the generation of high level assembly sequence plans.
{"title":"Learning assembly sequence plans using functional models","authors":"C. Bauckhage, F. Kummert, G. Sagerer","doi":"10.1109/ISATP.1999.782926","DOIUrl":"https://doi.org/10.1109/ISATP.1999.782926","url":null,"abstract":"The representation of knowledge about assembled objects is a fundamental requirement, if computer systems are used to supervise construction tasks. Depending on the complexity of the task and the characteristics of the objects forming its basis the process of modeling may be burdensome. We introduce a method to model classes of assemblies instead of individual assembled objects. Based on functional properties of the involved objects this general model is used to derive hierarchical descriptions of individual assemblies automatically. Furthermore, the model allows the generation of high level assembly sequence plans.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124534046","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 : 1999-07-21DOI: 10.1109/ISATP.1999.782997
P. Sousa, C. Ramos
Proposes an architecture for manufacturing enterprises based on the holonic concept. The main advantage of this approach is the decentralised, distributed nature of the system as well as its heterarchic organisation as opposed to the rigid hierarchic and centralised nature of computer integrated manufacturing (CIM). The system models products, resources and tasks and the planning, scheduling and order management functions of the enterprise. A negotiation protocol is defined for task assignment that is an extension of the contract net protocol. The protocol is based on the task-resource abstraction and is suited for negotiation in several situations not only for the dynamic scheduling of manufacturing orders. The negotiation protocol is able to handle exceptions such as machine breakdowns and rush orders.
{"title":"Distributed task scheduling","authors":"P. Sousa, C. Ramos","doi":"10.1109/ISATP.1999.782997","DOIUrl":"https://doi.org/10.1109/ISATP.1999.782997","url":null,"abstract":"Proposes an architecture for manufacturing enterprises based on the holonic concept. The main advantage of this approach is the decentralised, distributed nature of the system as well as its heterarchic organisation as opposed to the rigid hierarchic and centralised nature of computer integrated manufacturing (CIM). The system models products, resources and tasks and the planning, scheduling and order management functions of the enterprise. A negotiation protocol is defined for task assignment that is an extension of the contract net protocol. The protocol is based on the task-resource abstraction and is suited for negotiation in several situations not only for the dynamic scheduling of manufacturing orders. The negotiation protocol is able to handle exceptions such as machine breakdowns and rush orders.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"658 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123975814","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 : 1999-07-21DOI: 10.1109/ISATP.1999.782987
S. Spitz, A. Requicha
Coordinate measuring machines (CMMs) are very precise Cartesian robots that are used for dimensional inspection. High-level inspection planning for a CMM involves spatial reasoning, to determine how to orient the part on the CMM, which probes to use, how to orient the probes, and what measurements to perform. Current planners are incomplete or only solve the problem partially. In this work, we map the inspection planning problem to a hierarchical constraint satisfaction problem (CSP). The solutions to the CSP are inspection plans of good quality. We show how to extract approximate solutions using efficient clustering methods, which do not entail search and backtracking as prevalent in other planners. We describe our implemented planner and experimental results.
{"title":"Hierarchical constraint satisfaction for high-level dimensional inspection planning","authors":"S. Spitz, A. Requicha","doi":"10.1109/ISATP.1999.782987","DOIUrl":"https://doi.org/10.1109/ISATP.1999.782987","url":null,"abstract":"Coordinate measuring machines (CMMs) are very precise Cartesian robots that are used for dimensional inspection. High-level inspection planning for a CMM involves spatial reasoning, to determine how to orient the part on the CMM, which probes to use, how to orient the probes, and what measurements to perform. Current planners are incomplete or only solve the problem partially. In this work, we map the inspection planning problem to a hierarchical constraint satisfaction problem (CSP). The solutions to the CSP are inspection plans of good quality. We show how to extract approximate solutions using efficient clustering methods, which do not entail search and backtracking as prevalent in other planners. We describe our implemented planner and experimental results.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116899100","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 : 1999-07-21DOI: 10.1109/ISATP.1999.782947
H. Srinivasan, R. Gadh
This paper analyses the problem of removing one or more components of an assembly, defined as selective disassembly, and presents geometric abstractions and representations for automated selective disassembly analysis of geometric models. Based on the number of target components to be disassembled from an assembly (A) of n components, the selective disassembly (SD) problem is categorized into three classes: 1) single component disassembly (1-SD); 2) disassembling s(1
{"title":"Selective disassembly: representation and comparative analysis of wave propagation abstractions in sequence planning","authors":"H. Srinivasan, R. Gadh","doi":"10.1109/ISATP.1999.782947","DOIUrl":"https://doi.org/10.1109/ISATP.1999.782947","url":null,"abstract":"This paper analyses the problem of removing one or more components of an assembly, defined as selective disassembly, and presents geometric abstractions and representations for automated selective disassembly analysis of geometric models. Based on the number of target components to be disassembled from an assembly (A) of n components, the selective disassembly (SD) problem is categorized into three classes: 1) single component disassembly (1-SD); 2) disassembling s(1<s/spl Lt/n) components from A (defined as s-SD); and 3) disassembling S (S/spl rarr/n) components from A (defined as S-SD). Some preliminary results of a prototype system, assembly-disassembly in three dimensions, implementing the SD abstractions, and analysis of the abstractions for different classes of SD problems, are presented.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129081466","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 : 1999-07-21DOI: 10.1109/ISATP.1999.782979
L. Figueiredo, C. Ramos
This paper deals with a method to produce a program in numerical control (NC) language from a part drawing in a CAD system. This method is applied to any piece with revolution axis that can be machined in a CNC lathe. The method was developed with the goal of being integrated in the control software of the flexible manufacturing system existent in the CIM center of ISEP. The proposed method involves three phases, which are presented and explained.
{"title":"CEPP conversion and execution of process plans","authors":"L. Figueiredo, C. Ramos","doi":"10.1109/ISATP.1999.782979","DOIUrl":"https://doi.org/10.1109/ISATP.1999.782979","url":null,"abstract":"This paper deals with a method to produce a program in numerical control (NC) language from a part drawing in a CAD system. This method is applied to any piece with revolution axis that can be machined in a CNC lathe. The method was developed with the goal of being integrated in the control software of the flexible manufacturing system existent in the CIM center of ISEP. The proposed method involves three phases, which are presented and explained.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126011580","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 : 1999-07-21DOI: 10.1109/ISATP.1999.782993
J. Bautista, A. Lusa, R. Suárez, M. Mateo, R. Pastor, A. Corominas
Heuristic procedures based on priority rules are quite frequently used to solve the multiple resource-constrained project-scheduling problem (RCPSP), i.e. task programming with limited resources. The rules are based on the problem knowledge. Different local search procedures have been proposed in order to look for acceptable solutions in scheduling problems. In this work, local search procedures, that define the solution neighborhood based on greedy heuristics, are proposed to assign assembly operations to a fixed number of robots in a manufacturing cell. A genetic algorithm is used to generate the solution.
{"title":"Application of genetic algorithms to assembly sequence planning with limited resources","authors":"J. Bautista, A. Lusa, R. Suárez, M. Mateo, R. Pastor, A. Corominas","doi":"10.1109/ISATP.1999.782993","DOIUrl":"https://doi.org/10.1109/ISATP.1999.782993","url":null,"abstract":"Heuristic procedures based on priority rules are quite frequently used to solve the multiple resource-constrained project-scheduling problem (RCPSP), i.e. task programming with limited resources. The rules are based on the problem knowledge. Different local search procedures have been proposed in order to look for acceptable solutions in scheduling problems. In this work, local search procedures, that define the solution neighborhood based on greedy heuristics, are proposed to assign assembly operations to a fixed number of robots in a manufacturing cell. A genetic algorithm is used to generate the solution.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126851984","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
扫码关注我们
求助内容：
应助结果提醒方式：