Cavity balancing is the process of altering the flow front within a cavity through thickness and design changes such that the desired fill pattern is achieved. The 2 dimensional (2D) cavity-balancing algorithm, developed by Lam and Seow [1] can only handle 2D geometry. This represents a major drawback as most, if not all of the practical injected parts are not 2D parts. To overcome this difficulty, the present investigation has developed a 2.5 dimensional (2.5D) cavity balancing optimization routine implemented within a 2.5 D finite elements domain. The aim of the automated cavity balancing routine is to reduce product development time and to improve product quality. This will lower the level of prerequisite expert knowledge necessary for successful mold and part design. The automated cavity balancing routine has been developed using the concept of flow paths. The hill-climbing algorithm of Lam and Seow is utilized but modified for the generation of flow paths for 2.5D parts. The algorithm has been implemented in a computer program running as an external loop to the MOLDFLOW software. Case studies are provided to demonstrate the efficiency of this routine. / Singapore-MIT Alliance (SMA)

This dissertation focuses on developing algorithms that generate tool paths for free-form surfaces based on accuracy of desired manufactured part. A manufacturing part is represented by mathematical curves and surfaces. Using the mathematical representation of the manufacturing part, we generate reliable and near optimal tool paths as well as cutter location (CL) data file for postprocessing. This algorithm includes two components. First is the forward-step function which determines maximum distance called forward- step between two cutter contact (CC) points with given tolerance. This function is independent of the surface type and is applicable to all continuous parametric surfaces that are twice differentiable. The second component is the side-step function which determines maximum distance called side-step between two adjacent tool paths with a given scallop height. This algorithm reduces manufacturing and computing time as well as the CC points while keeping the given tolerance and scallop height in the tool paths. Several parts, for which the CC points are generated using the proposed algorithm, are machined using a three axes milling machine. As part of the validation process, the tool paths generated during machining are analyzed to compare the machined part and the desired part.

In already optimized processes it may be challenging to find room for further improvement. The solution can be found in the advanced software and tools that support the digital manufacturing, all the way from planning and design to in-machining and machining analysis. This project the- sis focuses on developing a process methodology to transcribe Sandvik Coromant’s theories and knowledge about machining operation grooving into machine-readable formats. Various software development models have been analysed and a particular model inspired by the incremental and iterative process model was developed to match the context of this project. This project thesis describes the working methodology for gathering theories and translating them into machine-interpretable format. A working methodology developed in this project thesis succeeded in transcribing different human- readable theories such as people’s minds (experts within the field) and handbooks into a machine- interpretable format. The proposed algorithms for tool path generation was developed and imple- mented successfully through the integration of mathematical modelling. MATLAB and Siemens NX has been used to build a proof of concept environment.

The use of autonomous underwater vehicles (AUVs) for oceanic observation and research is becoming more common. Underwater gliders are a specific class of AUV that do not use conventional propulsion. Instead they change their buoyancy and center of mass location to control attitude and trajectory. The vehicles spend most of their time in long, steady glides, so even minor improvements in glide range can be magnified over multiple dives. This dissertation presents a rigid-body dynamic system for a generic vehicle operating in a moving fluid (ocean current or wind). The model is then reduced to apply to underwater gliders. A reduced-order point-mass model is analyzed for optimal gliding in the presence of a current. Different numerical method solutions are compared while attempting to achieve maximum glide range. The result, although approximate, provides good insight into how the vehicles may be operated more effectively. At the end of each dive, the gliders must change their buoyancy and pitch to transition to a climb. Improper scheduling of the buoyancy and pitch change may cause the vehicle to stall and lose directional stability. Optimal control theory is applied to the buoyancy and angle of attack scheduling of a point-mass model. A rigid-body model is analyzed on a singular arc steady glide. An analytical solution for the control required to stay on the arc is calculated. The model is linearized to calculate possible perturbation directions while remaining on the arc. The nonlinear model is then propagated in forward and reverse time with the perturbations and analyzed. Lastly, one of the numerical solutions is analyzed using the singular arc equations for verification. This work received support from the Office of Naval Research under Grant Number N00014-08-1-0012. / Ph. D.

<p>This thesis studies path generation for industrial robots of six degrees of freedom. A path is defined by connection of simple geometrical objects like arcs and straight lines. About each point at which the objects connect, a region, henceforth called a zone, is defined in which deviation from the defined path is permitted. The zone allows the robot to follow the path at a constant speed, but the acceleration needed may vary. </p><p>Some means of calculating the zone path as to make the acceleration continuous will be presented. In joint space the path is described by the use of cubic splines. The transformation of the Cartesian path to paths in joint space will be examined. Discontinuities in the second order derivatives will appear between the splines. </p><p>A few examples of different zone path calculations will be presented where the resulting spline functions are compared with respect to their first and second order derivatives. An investigation of the number of spline functions needed when, given an upper limit of deviation, the transformation back to Cartesian coordinates is made.</p>

This thesis studies path generation for industrial robots of six degrees of freedom. A path is defined by connection of simple geometrical objects like arcs and straight lines. About each point at which the objects connect, a region, henceforth called a zone, is defined in which deviation from the defined path is permitted. The zone allows the robot to follow the path at a constant speed, but the acceleration needed may vary. Some means of calculating the zone path as to make the acceleration continuous will be presented. In joint space the path is described by the use of cubic splines. The transformation of the Cartesian path to paths in joint space will be examined. Discontinuities in the second order derivatives will appear between the splines. A few examples of different zone path calculations will be presented where the resulting spline functions are compared with respect to their first and second order derivatives. An investigation of the number of spline functions needed when, given an upper limit of deviation, the transformation back to Cartesian coordinates is made.

Injection molding is widely used to manufacture plastic parts with good surface finish, dimensional stability and low cost. The common examples of parts manufactured by injection molding include toys, utensils, and casings of various electronic products. The process of mold design to generate these complex shapes is iterative and time consuming, and requires great expertise in the field. As a result, a significant amount of the final product cost can be attributed to the expenses incurred during the product’s design. After designing the mold segments, it is necessary to machine these segments with minimum cost using an efficient tool-path. The tool-path planning process also adds to the overall mold cost. The process of injection molding can be simplified and made to be more cost effective if the processes of mold design and tool-path generation can be automated. This work focuses on the automation of mold design from a given part design and the automation of tool-path generation for manufacturing mold segments. The hypothesis examined in this thesis is that the automatic identification of mold features can reduce the human efforts required to design molds. It is further hypothesised that the human effort required in many downstream processes such as mold component machining can also be reduced with algorithmic automation of otherwise time consuming decisions. Automatic design of dies and molds begins with the part design being provided as a solid model. The solid model of a part is a database of its geometry and topology. The automatic mold design process uses this database to identify an undercut-free parting direction, for recognition of mold features and identification of parting lines for a given parting direction, and for generation of entities such as parting surfaces, core, cavity and side-cores. The methods presented in this work are analytical in nature and work with the extended set of part topologies and geometries unlike those found in the literature. Moreover, the methods do not require discretizing the part geometry to design its mold segments, unlike those found in the literature that result in losing the part definition. Once the mold features are recognized and parting lines are defined, core, cavity and side-cores are generated. This work presents algorithms that recognize the entities in the part solid model that contribute to the design of the core, cavity and side-cores, extract the entities, and use them in the design of these elements. The developed algorithms are demonstrated on a variety of parts that cover a wide range of features. The work also presents a method for automatic tool-path generation that takes the designed core/cavity and produces a multi-stage tool-path to machine it from raw stock. The tool-path generation process begins by determining tool-path profiles and tool positions for the rough machining of the part in layers. Typically roughing is done with large aggressive tools to reduce the machining time; and roughing leaves uncut material. After generating a roughing tool-path for each layer, the machining is simulated and the areas left uncut are identified to generate a clean-up tool-path for smaller sized tools. The tool-path planning is demonstrated using a part having obstacles within the machining region. The simulated machining is presented in this work. This work extends the accessibility analysis by retaining the topology information and using it to recognize a larger domain of features including intersecting features, filling a void in the literature regarding a method that could recognize complex intersecting features during an automated mold design process. Using this information, a larger variety of new mold intersecting features are classified and recognized in this approach. The second major contribution of the work was to demonstrate that the downstream operations can also benefit from algorithmic decision making. This is shown by automatically generating roughing and clean-up tool-paths, while reducing the machining time by machining only those areas that have uncut material. The algorithm can handle cavities with obstacles in them. The methodology has been tested on a number of parts.

Injection molding is widely used to manufacture plastic parts with good surface finish, dimensional stability and low cost. The common examples of parts manufactured by injection molding include toys, utensils, and casings of various electronic products. The process of mold design to generate these complex shapes is iterative and time consuming, and requires great expertise in the field. As a result, a significant amount of the final product cost can be attributed to the expenses incurred during the product’s design. After designing the mold segments, it is necessary to machine these segments with minimum cost using an efficient tool-path. The tool-path planning process also adds to the overall mold cost. The process of injection molding can be simplified and made to be more cost effective if the processes of mold design and tool-path generation can be automated. This work focuses on the automation of mold design from a given part design and the automation of tool-path generation for manufacturing mold segments. The hypothesis examined in this thesis is that the automatic identification of mold features can reduce the human efforts required to design molds. It is further hypothesised that the human effort required in many downstream processes such as mold component machining can also be reduced with algorithmic automation of otherwise time consuming decisions. Automatic design of dies and molds begins with the part design being provided as a solid model. The solid model of a part is a database of its geometry and topology. The automatic mold design process uses this database to identify an undercut-free parting direction, for recognition of mold features and identification of parting lines for a given parting direction, and for generation of entities such as parting surfaces, core, cavity and side-cores. The methods presented in this work are analytical in nature and work with the extended set of part topologies and geometries unlike those found in the literature. Moreover, the methods do not require discretizing the part geometry to design its mold segments, unlike those found in the literature that result in losing the part definition. Once the mold features are recognized and parting lines are defined, core, cavity and side-cores are generated. This work presents algorithms that recognize the entities in the part solid model that contribute to the design of the core, cavity and side-cores, extract the entities, and use them in the design of these elements. The developed algorithms are demonstrated on a variety of parts that cover a wide range of features. The work also presents a method for automatic tool-path generation that takes the designed core/cavity and produces a multi-stage tool-path to machine it from raw stock. The tool-path generation process begins by determining tool-path profiles and tool positions for the rough machining of the part in layers. Typically roughing is done with large aggressive tools to reduce the machining time; and roughing leaves uncut material. After generating a roughing tool-path for each layer, the machining is simulated and the areas left uncut are identified to generate a clean-up tool-path for smaller sized tools. The tool-path planning is demonstrated using a part having obstacles within the machining region. The simulated machining is presented in this work. This work extends the accessibility analysis by retaining the topology information and using it to recognize a larger domain of features including intersecting features, filling a void in the literature regarding a method that could recognize complex intersecting features during an automated mold design process. Using this information, a larger variety of new mold intersecting features are classified and recognized in this approach. The second major contribution of the work was to demonstrate that the downstream operations can also benefit from algorithmic decision making. This is shown by automatically generating roughing and clean-up tool-paths, while reducing the machining time by machining only those areas that have uncut material. The algorithm can handle cavities with obstacles in them. The methodology has been tested on a number of parts.

Ett spels karta är begränsande i det att när man valt en viss storlek kan man inte gå utanför den ramen utan att göra relativt resurskrävande operationer. Denna undersökning genomfördes för att se om en trädstruktur kan användas som lösning att hantera en honeycomb-struktur på ett lämpligt sätt för att ständigt kunna utöka ett spels karta. Resultatet visar att det är möjligt att använda trädstrukturen relativt bra till växande kartor men att det inte är att rekommendera till spel, eftersom strukturen i sig är en omväg. I samband med denna karta skapades en slumpmässig path-generator som skulle kunna användas till att generellt skapa slumpmässiga kartor i spel. För att se vad försvårigheter man stöter på när man utvecklar en slumpad map-generator, vilket visade sig vara svårt i och med att man hittade många specialfall.

In this study, a robotic software, which controls the robot, is developed. The robot considered is a six degree of freedom robot and it is designed and manufactured in METU. User can send the robot anywhere in space within its workspace, in any orientation. Forward and inverse kinamatics can be executed according to the needs. Simulation framework is embedded into the software for the 3D visualisation of the robot. Any movements can be simulated on the screen. Software also generates the path for the given points. Then generated path is simulated on the screen. All position, velocity and acceleration graphics of joints can be examined for the generated path.