{"title":"Minimisation of equipment cost for transfer lines with blocks of parallel tasks","authors":"A. Bratcu, L. Makdessian, A. Dolgui","doi":"10.1109/ISATP.2003.1217196","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217196","url":null,"abstract":"This paper deals with the design of single product lines without buffers (transfer lines), which dispose of several types of multifunctional tools (equipments) allowing the parallel execution of many different tasks by the same equipment (blocks of tasks). The production line design is stated as a multi-criteria optimisation problem: balancing the line and minimising the equipment cost. It is decomposed into two sub-problems: first, the blocks are obtained by assigning the tasks to equipments, subject to the precedence constraints; secondly, these blocks are assigned to workstations, subject to the cycle time constraint, which is just the ALB problem. To solve the first sub-problem, a branch-and-bound algorithm, enhanced by using two lower bounds and a dominance rule, is proposed.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"154 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120864871","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":"Balancing production lines composed by series of workstations with parallel operations blocks","authors":"A. Dolgui, N. Guschinsky, G. Levin","doi":"10.1109/ISATP.2003.1217198","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217198","url":null,"abstract":"A balancing problem for paced production lines with workstations in series and blocks of parallel operations at the workstations is considered. The problem is to choose blocks from a given set and allocate them to workstations in such a way that all the operations are assigned, the precedence and compatibility constraints are satisfied, and the line cost is minimal. A method for solving the problem is based on its transformation to a constrained shortest path problem.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"96 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":"122549627","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":"Combining harmonic functions and random sampling in robot motion planning: a performance evaluation","authors":"P. Iñiguez, J. Rosell","doi":"10.1109/ISATP.2003.1217220","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217220","url":null,"abstract":"The paper evaluates the performance of a potential field planner based on the use of harmonic functions and a random sampling scheme. Such a planner, called PHM, is probabilistic and resolution complete. The failure probability to connect to configurations a and b is studied, provided that the path exists.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"76 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":"133080261","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}
T. Arai, H. Izawa, Y. Maeda, H. Kikuchi, H. Ogawa, M. Sugi
{"title":"Real-time task decomposition and allocation for a multi-agent robotic assembly cell","authors":"T. Arai, H. Izawa, Y. Maeda, H. Kikuchi, H. Ogawa, M. Sugi","doi":"10.1109/ISATP.2003.1217185","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217185","url":null,"abstract":"In this paper, a robotic assembly system with decentralized architecture is studied. In order to achieve high flexibility and reconfigurability, the system consists of autonomous agents, \"holons\"; each of assembly devices is controlled by its own holon, \"execution holon\" and each of assembly operations is handled by a holon, \"operation holon\". Operation holons are dynamically created and destroyed to execute assembly tasks. When an assembly task is launched in the system, the task is decomposed recursively into primitive operations, which are allocated to assembly devices in real time by inter-holon negotiation. The performance of this task allocation mechanism is validated in simulation. Experimental results on a real assembly system are also presented.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"8 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":"129502491","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":"Assembly and task planning in a collaborative web-based environment based on assembly process modeling methodology","authors":"R. V. Osuna, T. Tallinen, J. Lastra, R. Tuokko","doi":"10.1109/ISATP.2003.1217191","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217191","url":null,"abstract":"Assembly task planning is the generation of the ordered sequence of tasks necessary to assembly the given parts. Based on the Assembly Process Modeling Methodology (APM) developed at the Assembly Automation Laboratory, where the product definition includes both logical and physical building blocks, and the dependencies between them, the development of an Intelligent Task Planning system built upon a Collaborative Web-based environment will enable the integration of the product design process and the assembly system design process. The Product Model definition will consist of a network or hierarchy of interrelated items, where each item has an interface, which contains all the necessary information to verify the item's compliance with the other items in the product definition. The relationships are defined as configuration rules, which can be formally specified in a syntax language. Based on the principle that all intelligent assembly task-planning systems can be structured as a typical knowledge-based system, the use of a software environment that allows the re-use of components, and database independency increases the robustness of the system. The integration of object-oriented and machine learning techniques for intelligent task planning into the system, adds the capability of using complex entities such as Computer-Aided Design (CAD) or Computer-Aided Manufacturing (CAM) models. The system will serve as an integration point between the product design phase and the assembly system deployment, embracing the capabilities of a web environment, enabling the development team to work remotely over the Internet on one framework, with zero-latency sharing of information. The system enables direct connectivity to Product Data Management (PDM) or Requirements Management (RM) systems, though the use of Java and Extensible Markup Language (XML) technologies. The scope of this research is the final assembly activities in the Electronics and Photonics Industries.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"131 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":"127377733","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":"Microfactory: desktop cleanrooms for the production of microsystems","authors":"I. Verettas, Reymond Clavel, A. Codourey","doi":"10.1109/ISATP.2003.1217181","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217181","url":null,"abstract":"Manufacturing as well as the manipulation and the assembly of microsystems (MEMS (Micro ElectroMechanical Systems) for instance) need most precise robots and a clean working environment. This paper gives a brief overview of the recent evolutions of this technology. To design new miniaturized machines, a new project \"microfactory\" is launched. Its main objective is to set up a mobile clean environment to harbor one or more automated micro-assembly machines. It will be suitable to work in a normal environment. This miniaturized system uses small trays for the microsystems' transfer. The designs of three main layouts of the microfactory are outlined in this paper.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"66 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":"130627786","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":"Collision-free path planning of a telerobotic manipulator based on swept volume of teleoperated manipulator","authors":"T. Hasegawa, K. Nakagawa, K. Murakami","doi":"10.1109/ISATP.2003.1217221","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217221","url":null,"abstract":"A new approach to collision-free path planning for a telerobotic manipulator is proposed. Using the swept volume of a slave manipulator teleoperated by a human operator, an online transition to autonomous tele-operation from master-slave manipulation is achieved without any geometric model of the environment. This feature enables a wider application to unstructured environments.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"23 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":"122216089","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":"Assembly sequences, assembly constraints, precedence graphs","authors":"J. Henrioud, L. Relange, C. Perrard","doi":"10.1109/ISATP.2003.1217193","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217193","url":null,"abstract":"In this paper, the authors present a critical discussion on relations between assembly constraints, assembly sequences and precedence graphs and a method to generate precedence graphs from any given set of assembly sequences. It is demonstrated that it is generally impossible to encompass assembly constraints for any product into a single precedence graph but that it is possible to encompass them in a precedence hypergraph as long as no some soft constraints have not been used to produce the assembly sequences. When soft constraints like clusters of components or early realisations for some tasks are used, several precedence graphs are required and the proposed method does not apply.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"6 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":"121264605","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":"Development of a design procedure for automatic assembly system","authors":"Z. Kunica, B. Vranjes, I. Tomić","doi":"10.1109/ISATP.2003.1217227","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217227","url":null,"abstract":"The paper is aimed at development of concurrent engineering (CE) assembly planning methodology and tools, trying to establish a general and integral approach to assembly system planning and modeling, urging the need for connection between assembly planning field and concepts that usually lay outside engineering domain, and involvement of still uncovered and computer non-implemented aspects of the planning. As the basis for mentioned, seven variants of the assembly system for a simple product are presented. The variants are compared regarding several criteria and the most appropriate is chosen.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"7 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":"127596702","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":"Customized simulation interface for packaged gas warehouse design","authors":"A. Simon, B. Rekiek, A. Delchambre","doi":"10.1109/ISATP.2003.1217226","DOIUrl":"https://doi.org/10.1109/ISATP.2003.1217226","url":null,"abstract":"The objective of this paper is to present the prototype of a software package embedding a simulation tool, customized for optimizing the facility layout of packaged gas warehouses. In those warehouses, empty packages are filled with different kinds of gases. To accelerate the filling process, pallets of similar packages are prepared in so-called sorting areas, while assorted pallets of filled ones are composed to fulfil the clients' needs. The main challenge for the authors' industrial partner is to be able to answer its customers' demands in less than 24 hours, while reducing the production costs. These costs have several sources: the numbers of packages within the system, creating stocks but also occupying significant space, the layout of the different areas and their interactions (internal transport, buffers, etc). Simulation has proven to be an efficient tool to help the designer to study the problems related to interactions between process and space. The philosophy of the prototype, called \"depot layout editor\", is to focus on the description of the architecture of the ware-house, while the simulation itself is left to a commercial package, AUTOMOD/spl trade/. Once the warehouse (or part of it) has been described, the software generates the simulation code, which can then be run within the AUTOMOD/spl trade/ environment. One of the advantages of using an external simulation kernel is that it provides extensive statistical analysis tools to evaluate the performance of a given design. The main feature of the approach is to be able to quickly test several architectures and organizations in order to find the one that best suits each warehouse constraints: geometry of the building, availability of stocks, customers' daily orders, etc. This paper will present the several aspects of the simulation preparation (products, process and layout definition), as well as the results obtained on several ware-house simulations studied for validation.","PeriodicalId":101913,"journal":{"name":"Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003.","volume":"137 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":"132657576","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}