Examinando por Materia "Iterative methods"
Mostrando 1 - 8 de 8
Resultados por página
Opciones de ordenación
Ítem Automatic assembly sequence exploration without precedence definition(Springer-Verlag France, 2013-01-01) Viganò, R.; Osorio Gómez, G.; Universidad EAFIT. Departamento de Ingeniería de Diseño; Ingeniería de Diseño (GRID)Today the assembly sequence for the products is often carried out manually and its definition, typically, is very expensive, not guaranteeing optimal solutions. Coming up with an efficient assembly sequence is the essential step to improve process productivity and reduces the time and costs related to assembly machines and equipment. The issue related to the assembly sequence of a product depends on the total number of the its components. In particular, the number of the possible sequences can be obtained through the calculus of the factorial of the number of the product components. This work presents an automatic approach intended to define assembly sequences, based on the information regard the contacts and the interferences existing among the components, which is obtained by the assembly CAD model of the product. The level of the information required by this approach allows its implementation at early stages of design, as soon as the layout of the conceptual solution of the product is defined, independently by the method used to model the CAD assembly. The procedure proposed is focused to obtain a reduced number of assembly sequences, guaranteeing that there is at least one feasible assembly sequence among them. The procedure is oriented to iteratively identify independent and important subassemblies into the CAD assembly, then merge them to specific assembling nodes and generate sequences until the whole product is analyzed. After a brief review of current methodologies developed for assembly planning, in this paper, the automated procedure for assembly sequence generation is explained and applied on an example, obtaining feasible solutions. © 2012 Springer-Verlag.Ítem Experiences in implementing design heuristics for innovation in product design(Springer-Verlag France, 2018-08-01) Restrepo J.; Ríos-Zapata D.; Mejía-Gutiérrez R.; Nadeau J.-P.; Pailhès J.; Universidad EAFIT. Departamento de Ingeniería de Diseño; Ingeniería de Diseño (GRID)The aided decision processes are expected to improve the design tasks by the reduction of uncertainty, which is one of the principal aspects that interferes with designer choices. These methods can optimise the problem solution by the time reduction in the iterative decision-cycles that can be based on previous knowledge. This article is based in the utilisation of a knowledge based method in design heuristics, which are defined as a set of procedures that allows both, discovery and acquisition, of a solution for a particular problem by the implementation of a strategy, guided by knowledge derived from the experience. This is applied to design area by the extrapolation of technical or conceptual knowledge that has been previously applied and proven in similar problem-solving processes and providing reference points within designs processes as well. For this reason the research focuses on the development of a design case in order to evaluate the interaction between the user and the guided problem approach. The objective was the analysis between two different design processes by the comparison of the implementation of heuristics based method and conventional design techniques in a design case. The purpose was to compare the outcomes of both experiments, taking as a basis the following setup: The design case proposed was carried out by two different teams, where the first team was instructed to use conventional problem-solving approaches such as Pahl & Beitz and Ulrich & Eppinger and the second one was intended to use the heuristics based method. The design task given to both teams was the development of a methane production system by the use of organic waste with the incorporation of technologies to allow the variables control, in other words, an automated biodigester; this allows to have an outcome all teams easy to comparable between each other. Each team performed the task separately, in order to avoid external influence in the process. All of this to proof that with the aid of tools based on heuristic strategies might enhance the innovation and diversification in design alternatives and strengthens conceptual exploration by providing more detailed concepts in early stages of the process. © 2017, Springer-Verlag France SAS.Ítem Extending marching cubes with adaptative methods to obtain more accurate iso-surfaces(Springer Verlag, 2010-01-01) Congote, J.; Moreno, A.; Barandiaran, I.; Barandiaran, J.; Ruiz, O.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThis work proposes an extension of the Marching Cubes algorithm, where the goal is to represent implicit functions with higher accuracy using the same grid size. The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved. After each iteration, the difference between the implicit and the explicit representations is reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more accurate, as the results shall confirm. The proposed algorithm corrects some topological problems that may appear in the discretization process using the original grid. © 2010 Springer-Verlag Berlin Heidelberg.Ítem FEA Structural Optimization Based on Metagraphs(Springer Verlag, 2019-01-01) Montoya-Zapata D.; Acosta D.A.; Ruiz-Salguero O.; Sanchez-Londono D.; Montoya-Zapata D.; Acosta D.A.; Ruiz-Salguero O.; Sanchez-Londono D.; Universidad EAFIT. Departamento de Ingeniería de Procesos; Procesos Ambientales (GIPAB)Evolutionary Structural Optimization (ESO) seeks to mimic the form in which nature designs shapes. This paper focuses on shape carving triggered by environmental stimuli. In this realm, existing algorithms delete under - stressed parts of a basic shape, until a reasonably efficient (under some criterion) shape emerges. In the present article, we state a generalization of such approaches in two forms: (1) We use a formalism that enables stimuli from different sources, in addition to stress ones (e.g. kinematic constraints, friction, abrasion). (2) We use metagraphs built on the Finite Element constraint graphs to eliminate the dependency of the evolution on the particular neighborhood chosen to be deleted in a given iteration. The proposed methodology emulates 2D landmark cases of ESO. Future work addresses the implementation of such stimuli type, the integration of our algorithm with evolutionary based techniques and the extension of the method to 3D shapes. © 2019, Springer International Publishing AG, part of Springer Nature.Ítem FEA Structural Optimization Based on Metagraphs(Springer Verlag, 2019-01-01) Montoya-Zapata D.; Acosta D.A.; Ruiz-Salguero O.; Sanchez-Londono D.; Universidad EAFIT. Departamento de Ingeniería de Procesos; Desarrollo y Diseño de ProcesosEvolutionary Structural Optimization (ESO) seeks to mimic the form in which nature designs shapes. This paper focuses on shape carving triggered by environmental stimuli. In this realm, existing algorithms delete under - stressed parts of a basic shape, until a reasonably efficient (under some criterion) shape emerges. In the present article, we state a generalization of such approaches in two forms: (1) We use a formalism that enables stimuli from different sources, in addition to stress ones (e.g. kinematic constraints, friction, abrasion). (2) We use metagraphs built on the Finite Element constraint graphs to eliminate the dependency of the evolution on the particular neighborhood chosen to be deleted in a given iteration. The proposed methodology emulates 2D landmark cases of ESO. Future work addresses the implementation of such stimuli type, the integration of our algorithm with evolutionary based techniques and the extension of the method to 3D shapes. © 2019, Springer International Publishing AG, part of Springer Nature.Ítem FEA Structural Optimization Based on Metagraphs(Springer Verlag, 2019-01-01) Montoya-Zapata D.; Acosta D.A.; Ruiz-Salguero O.; Sanchez-Londono D.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEEvolutionary Structural Optimization (ESO) seeks to mimic the form in which nature designs shapes. This paper focuses on shape carving triggered by environmental stimuli. In this realm, existing algorithms delete under - stressed parts of a basic shape, until a reasonably efficient (under some criterion) shape emerges. In the present article, we state a generalization of such approaches in two forms: (1) We use a formalism that enables stimuli from different sources, in addition to stress ones (e.g. kinematic constraints, friction, abrasion). (2) We use metagraphs built on the Finite Element constraint graphs to eliminate the dependency of the evolution on the particular neighborhood chosen to be deleted in a given iteration. The proposed methodology emulates 2D landmark cases of ESO. Future work addresses the implementation of such stimuli type, the integration of our algorithm with evolutionary based techniques and the extension of the method to 3D shapes. © 2019, Springer International Publishing AG, part of Springer Nature.Ítem Influence of energy consumption on battery sizing of electric fluvial vessels: a Colombian Case Study(Institute of Electrical and Electronics Engineers Inc., 2020-09-12) Giraldo, E.; Gaviria, Gregorio; Betancur E.; Gómez, G.O.; Mejá-Gutiérrez, R.; Giraldo, E.; Gaviria, Gregorio; Betancur E.; Gómez, G.O.; Mejá-Gutiérrez, R.; Universidad EAFIT. Departamento de Ingeniería de Diseño; Ingeniería de Diseño (GRID)Electric vessels represent a sustainable solution for fluvial mobility. However, their energy demand is higher compared to terrestrial vehicles, so that, increasing the hydrodynamic efficiency is mandatory.Ítem Solving large systems of linear equations on GPUs(Springer Verlag, 2018-01-01) Llano-Ríos T.F.; Ocampo-García J.D.; Yepes-Ríos J.S.; Correa-Zabala F.J.; Trefftz C.; Llano-Ríos T.F.; Ocampo-García J.D.; Yepes-Ríos J.S.; Correa-Zabala F.J.; Trefftz C.; Universidad EAFIT. Departamento de Ciencias; Lógica y ComputaciónGraphical Processing Units (GPUs) have become more accessible peripheral devices with great computing capacity. Moreover, GPUs can be used not only to accelerate the graphics produced by a computer but also for general purpose computing. Many researchers use this technique on their personal workstations to accelerate the execution of their programs and have often encountered that the amount of memory available on GPU cards is typically smaller than the amount of memory available on the host computer. We are interested in exploring approaches to solve problems with this restriction. Our main contribution is to devise ways in which portions of the problem can be moved to the memory of the GPU to be solved using its multiprocessing capabilities. We implemented on a GPU the Jacobi iterative method to solve systems of linear equations and report the details from the results obtained, analyzing its performance and accuracy. Our code solves a system of linear equations large enough to exceed the card’s memory, but not the host memory. Significant speedups were observed, as the execution time taken to solve each system is faster than those obtained with Intel® MKL and Eigen, libraries designed to work on CPUs. © Springer Nature Switzerland AG 2018.