Brain Cine-MRI Sequences Registration Using B-Spline Free-Form Deformations and MLSDO Dynamic Optimization Algorithm

2012 ◽  
pp. 443-448 ◽  
Author(s):  
Julien Lepagnot ◽  
Amir Nakib ◽  
Hamouche Oulhadj ◽  
Patrick Siarry
Keyword(s):  
Dynamic Optimization ◽  
Optimization Algorithm ◽  
Free Form ◽  
Cine Mri ◽  
B Spline ◽  
Mri Sequences

Design of a Damper for a Suspension System via Evolutive Optimization

2013 ◽  
Author(s):  
Carlos A. Duchanoy ◽  
Marco A. Moreno-Armendáriz ◽  
Carlos A. Cruz-Villar
Keyword(s):  
Dynamic Optimization ◽  
Optimization Algorithm ◽  
Physical Characteristics ◽  
Suspension System ◽  
Dynamic Interactions ◽  
Multi Objective ◽  
Damping Coefficients ◽  
Design Variables ◽  
Parameterized Model ◽  
Stiffness And Damping

In this paper a dynamic optimization methodology for designing a passive automotive damper is proposed. The methodology proposes to state the design problem as a dynamic optimization one by considering the nonlinear dynamic interactions between the damper and the other elements of the suspension system, emphasizing geometry, dimensional and movement constraints. In order to obtain realistic simulations of the suspension, a link between a Computer-Aided Engineering Model (CAEM) and a multi-objective dynamic optimization algorithm is developed. As design objectives we consider the vehicle safety and the passenger comfort which are represented by the contact area of the tire and the vibrations of the cockpit respectively. The damper is optimized by stating a set of physical variables that determine the stiffness and damping coefficients as independent variables for the dynamic optimization problem, they include the spring helix diameter, the spring wire diameter, the oil physical characteristics and the bleed orifice diameters among others. The optimization algorithm that we use to solve the problem at hand is a multi-objective evolutive optimization algorithm. For this purpose we developed a parameterized model of the damper which is used to link the CAE tools and the optimization software, thus enabling fitness evaluations during the dynamic optimization process. By selecting the physical characteristics of the damper as design variables instead of the typical stiffness and damping coefficients, it is possible to consider important design constrains as the damper size, movement limitations and anchor points. As result of the proposed methodology a set of blueprints of non dominated Pareto configurations of the damper are provided to the decision maker.

A New Approach to G1 Biarc Approximations for Making Smooth, Accurate, and Non-Gouged Profile Features Using CNC Contouring

2006 ◽  
Author(s):  
Zezhong C. Chen ◽  
Xujing Yang
Keyword(s):  
Manufacturing Industry ◽  
Cutting Tool ◽  
Minimum Size ◽  
Free Form ◽  
New Approach ◽  
B Spline ◽  
Tool Paths ◽  
The Past ◽  
Approximation Errors ◽  
The Individual

Extensive research on G1 biarcs fitting to free-form curves (i.e., Bezier, B-spline, and NURBS curves) has been conducted in the past decades for various purposes, including CNC contouring to make smooth, accurate profile features such as pockets, islands, and sides. However, all the proposed approaches only focused on the approximation errors and the biarc number, not on the radius of the individual fitting arc; so it could be smaller than the cutting tool, which would cause gouging during machining. This work, based on the tool radius pre-determined by the minimum size of the concavities of the design profile, proposes a new approach to approximating the profile with a G1 biarc curve in order to make smooth, accurate, and non-gouged profile features using CNC contouring. The significant new contribution of this work is a new mechanism that ensures all the concave arcs of the fitting curve are larger than the pre-determined tool and the fitting errors meet the specified tolerance. This approach can promote the use of G1 biarc tool paths in the manufacturing industry to make high precision profile features.

Computation of Voxel Maps Containing Tool Access Directions for Machining Free-Form Shapes

1996 ◽  
Author(s):  
Johan W. H. Tangelder ◽  
Joris S. M. Vergeest ◽  
Mark H. Overmars
Keyword(s):  
Free Form ◽  
Geometric Accuracy ◽  
Surface Sampling ◽  
B Spline ◽  
Spline Surface ◽  
Surface Data

Abstract An algorithm that derives tool access directions for machining free-form shapes is presented. A free-form shape to be machined is given by a preliminary B-spline model. We allow that the B-spline surface data are as inaccurate as the user-selected geometric accuracy of the prototype to be machined. Using surface sampling a visibility voxel map is obtained. From this map a voxel map is derived that contains per voxel a set of tool access directions. From the obtained voxel map regions can be selected that can be machined with a fixed tool access direction per region.

Comparison of GA, ACO algorithm, and PSO algorithm for path optimization on free-form surfaces using coordinate measuring machines

2021 ◽  
Author(s):  
Yueping Chen ◽  
Naiqi Shang
Keyword(s):  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Path Optimization ◽  
Inspection Time ◽  
Free Form ◽  
Coordinate Measuring Machines ◽  
Ant Colony Optimization Algorithm ◽  
Measuring Machine ◽  
Free Form Surfaces

Abstract Coordinate measuring machines (CMMs) play an important role in modern manufacturing and inspection technologies. However, the inspection process of a CMM is recognized as time-consuming work. The low efficiency of coordinate measuring machines has given rise to new inspection strategies and methods, including path optimization. This study describes the optimization of an inspection path on free-form surfaces using three different algorithms: an ant colony optimization algorithm, a genetic algorithm, and a particle swarm optimization algorithm. The optimized sequence of sampling points is obtained in MATLAB R2020b software and tested on a Leitz Reference HP Bridge Type Coordinate Measuring Machine produced by HEXAGON. This study compares the performance of the three algorithms in theoretical and practical conditions. The results demonstrate that the use of the three algorithms can result in a collision-free path being found automatically and reduce the inspection time. However, owing to the different optimization methodologies, the optimized processes and optimized times of the three algorithms, as well as the optimized paths, are different. The results indicate that the ant colony algorithm has better performance for the path optimization of free-form surfaces.

Model-Based 4D Segmentation of Cardiac Structures in Cine MRI Sequences

2017 ◽  
pp. 18-23
Author(s):  
Nassim Bouteldja ◽  
Matthias Wilms ◽  
Heinz Handels ◽  
Dennis Säring ◽  
Jan Ehrhardt
Keyword(s):  
Cine Mri ◽  
Model Based ◽  
Mri Sequences

A New Multiagent Algorithm for Dynamic Continuous Optimization

2010 ◽  
Vol 1 (1) ◽  
pp. 16-38 ◽  
Author(s):  
Julien Lepagnot ◽  
Amir Nakib ◽  
Hamouche Oulhadj ◽  
Patrick Siarry
Keyword(s):  
Dynamic Optimization ◽  
Optimization Algorithm ◽  
Real World ◽  
Optimization Algorithms ◽  
Continuous Optimization ◽  
Dynamic Problems ◽  
Moving Peaks Benchmark ◽  
Moving Peaks ◽  
Over Time ◽  
Real World Problems

Many real-world problems are dynamic and require an optimization algorithm that is able to continuously track a changing optimum over time. In this paper, a new multiagent algorithm is proposed to solve dynamic problems. This algorithm is based on multiple trajectory searches and saving the optima found to use them when a change is detected in the environment. The proposed algorithm is analyzed using the Moving Peaks Benchmark, and its performances are compared to competing dynamic optimization algorithms on several instances of this benchmark. The obtained results show the efficiency of the proposed algorithm, even in multimodal environments.

Sign in / Sign up

Export Citation Format

Share Document