• Steel and Composite Structures
• /
• v.51 no.4
• /
• pp.363-375
• /
• 2024

Within the optimization field, addressing the intricate posed by fluidic pressure loads on functionally graded structures with frequency-related designs is a kind of complex design challenges. This paper thus introduces an innovative density-based topology optimization strategy for frequency-constraint functionally graded structures incorporating Darcy's law and a drainage term. It ensures consistent treatment of design-dependent fluidic pressure loads to frequency-related structures that dynamically adjust their direction and location throughout the design evolution. The porosity of each finite element, coupled with its drainage term, is intricately linked to its density variable through a Heaviside function, ensuring a seamless transition between solid and void phases. A design-specific pressure field is established by employing Darcy's law, and the associated partial differential equation is solved using finite element analysis. Subsequently, this pressure field is utilized to ascertain consistent nodal loads, enabling an efficient evaluation of load sensitivities through the adjoint-variable method. Moreover, this novel approach incorporates load-dependent structures, frequency constraints, functionally graded material models, and polygonal meshes, expanding its applicability and flexibility to a broader range of engineering scenarios. The proposed methodology's effectiveness and robustness are demonstrated through numerical examples, including fluidic pressure-loaded frequency-constraint structures undergoing small deformations, where compliance is minimized for structures optimized within specified resource constraints.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1903-1906
• /
• 2003

This paper proposes an adaptive regularized noise smoothing algorithm for range image using the area decreasing flow method, which can preserve meaningful edges during the smoothing process. Although the area decreasing flow method can easily smooth Gaussian noise, it has two problems; ⅰ) it is not easy to remove impulsive noise from observed range data, and ⅱ) it is also difficult to remove noise near edge when the adaptive regularization is used. In the paper, therefore, the second smoothness constraint is addtionally incorporated into the existing regularization algorithm, which minimizes the difference between the median filtered data and the estimated data. As a result, the Proposed algorithm can effectively remove the noise of dense range data with edge preserving.

• Journal of Mechanical Science and Technology
• /
• v.14 no.6
• /
• pp.655-665
• /
• 2000

We propose an efficient algorithm for the purpose of satisfying a wide range of design constraints represented with equality and inequality equations as well as production rules. The algorithm employs simulated-annealing and a production rule inference engine and works on design constraints represented with networks. The algorithm fulfills equality constraints through constraint satisfaction processes like variable elimination while taking into account inequality constraints and inferring production rules. It can also reduce the load of the optimization procedure if necessary. We demonstrate the implementation of the algorithm with the result on machine tool design.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.521-526
• /
• 2001

This research develops a low-cost and high accurate kinematic calibration method for a parallel typed machining center tool. A planar table is used for a mechanical fixture restricting the platform to place at the constrained pose and a low-cost and high accurate digital indicator is employed for a device checking if the constrained movement is satisfied within the established range. The kinematic parameters calibrated with respect to a single plane aren't influenced from the misalignment of the plane. A parameter observability is successfully obtained even through one planar constraint, which guarantees that the kinematic parameters is estimated by minimizing the cost function.

• Language and Information
• /
• v.4 no.1
• /
• pp.97-109
• /
• 2000

Application systems of natural language processing such as machine translation system must deal with actual texts including the full range of linguistic phenomena. But it seems to be impossible that the existing grammar covers completely such actual texts because they include disruptive factors such as long sentences, unexpected sentence patterns and erroneous input to obstruct well-formed analysis of a sentence. In order to solve analysis failure due to the disruptive factors or incorrect selection of correct parse tree among forest parse trees, this paper proposes two-level computational grammar which consists of a constraint-based grammar and an error-tolerant grammar. The constraint-based computational grammar is the grammar that gives us the well-formed analysis of English texts. The error-tolerant computational grammar is the grammar that reconstructs a comprehensible whole sentence structure with partially successful parse trees within failed parsing results.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.699-704
• /
• 2000

The present paper deals with a multiobjective optimization method based on the co-evolutionary genetic strategy. The co-evolutionary strategy carries out the multiobjective optimization in such way that it optimizes individual objective function as compared with each generation's value while there are more than two genetic evolutions at the same time. In this study, the designs that are out of the given constraint map compared with other objective function value are excepted by the penalty. The proposed multiobjective genetic algorithms are distinguished from other optimization methods because it seeks for the optimized value through the simultaneous search without the help of the single-objective values which have to be obtained in advance of the multiobjective designs. The proposed strategy easily applied to well-developed genetic algorithms since it doesn't need any further formulation for the multiobjective optimization. The paper describes the co-evolutionary strategy and compares design results on the simple structural optimization problem.

• Journal of the Society of Naval Architects of Korea
• /
• v.51 no.5
• /
• pp.362-368
• /
• 2014

Container vessel sizes have constantly increased over the past two decades. With increasing ship sizes and higher container loading capacities, the adoption of lashing bridges has also increased. Today's lashing bridge designs range from 1st tier to 3rd tier lashing bridges. Container securing program of the past which is based on two lashing rods and 1st tier lashing bridge has to be improved to be suitable for the present time. The equilibrium equations in this study are established to cover the application of 3~4 lashing rods and 2nd~3rd tier lashing bridges. In addition developed program is improved to be able to calculate the reaction forces and optimum arrangement under the external lashing. An optimization algorithm which is suitable for the container securing problems involved the equality constraint has been also adopted in this study.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.3
• /
• pp.221-227
• /
• 2005

This paper evaluates minimum and maximum power exchange considering economic and technical characteristics between Russia and ROK. First, we evaluate minimum power exchange to assure the economic feasibility by comparison with the total cost and benefit of the interconnected line. For evaluating maximum exchange power, system constraints are considered, which are examined through load flow and dynamic analysis by using the PSS/E program. As a result of these evaluations, we suggest the reasonable range of power exchange between ROK and Russia considering economic and technical constraints with the interconnection scenario that power system interconnection between ROK and Russia will be realized in the year 2010.

• Advances in Computational Design
• /
• v.4 no.3
• /
• pp.197-210
• /
• 2019

Motion generation of a four-bar linkage is a type of mechanism synthesis that has a wide range of applications such as a pick-and-place operation in manufacturing. In this research, the use of meta-heuristics for motion generation of a four-bar linkage is demonstrated. Three problems of motion generation were posed as a constrained optimization probably using the weighted sum technique to handle two types of tracking errors. A simple penalty function technique was used to deal with design constraints while three meta-heuristics including differential evolution (DE), self-adaptive differential evolution (JADE) and teaching learning based optimization (TLBO) were employed to solve the problems. Comparative results and the effect of the constraint handling technique are illustrated and discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1402-1407
• /
• 2004

Moving a fragile object from an initial point to a goal location in minimum time without damage is pursued in this paper. In order to achieve the goal, first of all, the range of maximum acceleration and velocity are specified, which the manipulator can generate dynamically on the path that is planned a priori considering the geometrical constraints. Later, considering the impulsive force constraint of the object, the range of maximum acceleration and velocity are going to be obtained to keep the object safe while the manipulator is carrying it along the curved path. Finally, a time-optimal trajectory is planned within the maximum allowable range of the acceleration and velocity. This time optimal trajectory planning can be applied for real applications and is suitable for not only a continuous path but also a discrete path.