S.H. Choi

A virtual prototyping system for rapid product development

Abstract This paper describes a virtual prototyping (VP) system that integrates virtual reality with rapid prototyping (RP) to create virtual or digital prototypes to facilitate product development. The proposed VP system incorporates two new simulation methodologies, namely the dexel-based and the layer-based fabrication approaches, to simulate the powder-based and the laminated sheet-based RP processes, respectively. The dexel-based approach deposits arrays of solid strips to form a layer, while the layer-based approach directly forms a complete layer by extruding the slice contours. The layer is subsequently stacked up to fabricate a virtual prototype. The simulation approaches resemble the physical fabrication processes of most RP systems, and are therefore capable of accurately representing the geometrical characteristics of prototypes. In addition to numerical quantification of the simulation results, the system also provides stereoscopic visualisation of the product design and its prototype for detailed analyses. Indeed, the original product design may be superimposed on its virtual prototype, so that areas with dimensional errors beyond design limits may be clearly highlighted to facilitate point-to-point analysis of the surface texture and the dimensional accuracy of the prototype. Hence, the key control parameters of an RP process, such as part orientation, layer thickness and hatch space, may be effectively tuned up for optimal fabrication of physical prototypes in subsequent product development. Furthermore, the virtual prototypes can be transmitted via the Internet to customers to facilitate global manufacturing. As a result, both the lead-time and the product development costs can be significantly reduced.

Modelling and optimisation of rapid prototyping

This paper proposes a Virtual Reality (VR) system for modelling and optimisation of Rapid Prototyping (RP) processes. The system aims to reduce the manufacturing risks of prototypes early in a product development cycle, and hence, reduces the number of costly design-build-test cycles. It involves modelling and simulation of RP in a virtual system, which facilitates visualisation and testing the effects of process parameters on the part quality. Modelling of RP is based on quantifying the measures of part quality, which includes accuracy, build-time and efficiency with orientation, layer thickness and hatch distance. A mathematical model has been developed to estimate the build-time of the Selective Laser Sintering (SLS) process. The model incorporates various process parameters like layer thickness, hatch space, bed temperatures, laser power and sinter factor, etc. It has been integrated with the virtual simulation system to provide a test-bed to optimise the process parameters.

A versatile virtual prototyping system for rapid product development

This paper presents a versatile virtual prototyping (VP) system for digital fabrication of multi-material prototypes to facilitate rapid product development. The VP system comprises a suite of software packages for multi-material layered manufacturing (MMLM) processes, including multi-toolpath planning, build-time estimation and accuracy analysis, integrated with semi-immersive desktop-based and full-immersive CAVE-based virtual reality (VR) technology. Such versatility makes the VP system adaptable to suit specific cost and functionality requirements of various applications. The desktop-based VR system creates a semi-immersive environment for stereoscopic visualisation and quality analysis of a product design. It is relatively cost-effective and easy to operate, but its users may be distracted by environmental disturbances that could possibly diminish their efficiency of product design evaluation and improvement. To alleviate disturbance problems, the CAVE-based VR system provides an enclosed room-like environment that blocks out most disturbances, making it possible for a design team to fully concentrate and collaborate on their product design work. The VP system enhances collaboration and communication of a design team working on product development. It provides simulation techniques to analyse and improve the design of a product and its fabrication processes. Through simulations, assessment and modification of a product design can be iterated without much worry about the manufacturing and material costs of prototypes. Hence, key factors such as product shape, manufacturability, and durability that affect the profitability of manufactured products are optimised quickly. Moreover, the resulting product design can be sent via the Internet to customers for comments or marketing purposes. The VP system therefore facilitates advanced product design and helps reduce development time and cost considerably.

A multi-material virtual prototyping system

Abstract This paper proposes a multi-material virtual prototyping system for digital fabrication of heterogeneous prototypes. It consists mainly of a topological hierarchy-sorting algorithm for processing slice contours, and a virtual simulation system for visualisation and optimisation of multi-material layered manufacturing (MMLM) processes. The topological hierarchy-sorting algorithm processes the hierarchy relationship of complex slice contours. It builds a parent-and-child list that defines the containment relationship of the slice contours, and subsequently arranges the contours in an appropriate sequence, which facilitates toolpath planning for MMLM by avoiding redundant tool movements. The virtual simulation system simulates MMLM processes and provides stereoscopic visualisation of the resulting multi-material prototypes for quality analysis and optimisation of the processes.

Implementation issues in RFID-based anti-counterfeiting systems

RFID has emerged as a potential tool to combat product counterfeiting, which undermines the global economy hugely. Recently, a number of anti-counterfeiting approaches have been proposed for such purpose. This paper presents a track-and-trace system for RFID-based anti-counterfeiting, and addresses possible implementation issues, such as tag selection, product tagging, tag programming and locking. A packaging line for bottled products is developed and integrated with the proposed system for investigation of these issues. Experiments are conducted to determine the critical tag moving speed beyond which the tag programming rate or reliability of tagged products being transferred on a convey drops significantly. The critical tag moving speed is vital not only for determining the maximum production throughput possible, but also for setting up RFID equipment needed to ensure tagged products with erroneous tagging can be sorted out from the packaging line accordingly.

Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach

Flexible flow shop scheduling problems are NP-hard and tend to become more complex when stochastic uncertainties are taken into consideration. Although some methods have been developed to address such problems, they remain inherently difficult to solve by any single approach. This paper presents a novel decomposition-based approach (DBA), which combines both the shortest processing time (SPT) and the genetic algorithm (GA), to minimizing the makespan of a flexible flow shop (FFS) with stochastic processing times. In the proposed DBA, a neighbouring K-means clustering algorithm is developed to firstly group the machines of an FFS into an appropriate number of machine clusters, based on their stochastic nature. Two optimal back propagation networks (BPN), corresponding to the scenarios of simultaneous and non-simultaneous job arrivals, are then selectively adopted to assign either SPT or GA to each machine cluster for sub-schedule generation. Finally, an overall schedule is generated by integrating the sub-schedules of machine clusters. Computation results show that the DBA outperforms SPT and GA alone for FFS scheduling with stochastic processing times.

A topological hierarchy-based approach to toolpath planning for multi-material layered manufacturing

This paper proposes a topological hierarchy-based approach to toolpath planning for multi-material layered manufacturing (MMLM) of heterogeneous prototypes. The approach facilitates control of MMLM and increases the fabrication efficiency of complex objects by generating multi-toolpaths that avoid redundant tool movements and potential collisions. It uses a topological hierarchy-sorting algorithm to group complex multi-material slice contours into families connected by a parent-and-child relationship. Subsequently, a sequential toolpath planning algorithm generates multi-toolpaths for sequential deposition of materials without redundant tool movements. To reduce build time further, a concurrent toolpath planning algorithm generates collision-free multi-toolpaths to control the tools that deposit materials concurrently. It uses parametric polygons to construct tool envelopes for contour families of the same material property to simplify detection of tool collisions. The tightness of polygons can be controlled to suit the processing speed and the optimality of the resulting concurrent toolpaths. The proposed approach has been implemented as an integral part of a multi-material virtual prototyping (MMVP) system that can process complex slice contours for planning, stereoscopic simulation, and validation of multi-toolpaths. It may be adapted for subsequent control of MMLM processes.

A decomposition-based approach to flexible flow shop scheduling under machine breakdown

Manufacturing systems in real-world production are generally dynamic and often subject to a wide range of uncertainties. Recently, research on production scheduling under uncertainty has attracted substantial attention. Although some methods have been developed to address this problem, scheduling under uncertainty remains inherently difficult to solve by any single approach. This article considers makespan optimisation of a flexible flow shop (FFS) scheduling problem under machine breakdown. It proposes a novel decomposition-based approach to decompose an FFS scheduling problem into several cluster scheduling problems which can be solved more easily by different approaches. A neighbouring K-means clustering algorithm is developed to first group the machines of an FFS into an appropriate number of machine clusters, based on a proposed machine allocation algorithm and weighted cluster validity indices. Two optimal back propagation networks, corresponding to the scenarios of simultaneous and non-simultaneous job arrivals, are then selectively adopted to assign either the shortest processing time (SPT) or the genetic algorithm (GA) to each machine cluster to solve cluster scheduling problems. If two neighbouring machine clusters are allocated with the same approach, they are subsequently merged. After machine grouping and approach assignment, an overall schedule is generated by integrating the solutions to the sub-problems. Computation results reveal that the proposed approach is superior to SPT and GA alone for FFS scheduling under machine breakdown.

A holonic approach to flexible flow shop scheduling under stochastic processing times

Flexible flow shop scheduling problems are NP-hard and tend to become more complex when stochastic uncertainties are taken into consideration. This paper presents a novel decomposition-based holonic approach (DBHA) for minimising the makespan of a flexible flow shop (FFS) with stochastic processing times. The proposed DBHA employs autonomous and cooperative holons to construct solutions. When jobs are released to an FFS, the machines of the FFS are firstly grouped by a neighbouring K-means clustering algorithm into an appropriate number of cluster holons, based on their stochastic nature. A scheduling policy, determined by the back propagation networks (BPNs), is then assigned to each cluster holon for schedule generation. For cluster holons of a low stochastic nature, the Genetic Algorithm Control (GAC) is adopted to generate local schedules in a centralised manner; on the other hand, for cluster holons of a high stochastic nature, the Shortest Processing Time Based Contract Net Protocol (SPT-CNP) is applied to conduct negotiations for scheduling in a decentralised manner. The combination of these two scheduling policies enables the DBHA to achieve globally good solutions, with considerable adaptability in dynamic environments. Computation results indicate that the DBHA outperforms either GAC or SPT-CNP alone for FFS scheduling with stochastic processing times.

Hierarchical slice contours for layered-manufacturing

This paper proposes a contour-processing system to enhance the capability and efficiency of fabricating complex objects in layered manufacturing (LM). It consists of a tolerant slicing algorithm and a topological hierarchy-sorting algorithm. The tolerant slicing algorithm aims to overcome the constraints of computer memory and the computation instability commonly irherent in conventional slicing methodologies, while the topological hierarchy-sorting algorithm constructs the topological relationship of complex slice contours. The tolerant slicing algorithm adopts a simple pick-and-drop approach to minimise the memory usage. It extracts one facet at a time for slicing. Hence, complex and large STL models of virtually unlimited file size can be sliced effectively. The algorithm is relatively fault tolerant in that inconsistent contours due to defects of the STL file may be automatically repaired. The topological hierarchy-sorting algorithm constructs the hierarchy relationship of complex slice contours, with which virtual prototyping and surface reconstruction algorithms can be conveniently applied. In particular, slice contours with established hierarchy relationship facilitate collision detection in multi-material assemblies, as well as the optimisation of laser/binder path in LM by avoiding redundant back-and-forth movement.