• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.6 s.237
• /
• pp.842-851
• /
• 2005

In this paper, a new method for constrained optimization of noisy functions is proposed. In approximate optimization using response surface methods, if constraints have severe noise, the approximate feasible region defined by approximate constraints is apt to include some of the infeasible region defined by actual constraints. This can cause the approximate optimum to converge into the infeasible region. In the proposed method, the approximate optimization is performed with the approximate constraints shifted by their deviations, which are calculated using a diagonal quadratic response surface method. This can prevent the approximate optimum from converging into the infeasible region. To fit the objective and constraints into diagonal quadratic models, we select the center and 4 additional points along each axis of design variables as experimental points. The deviation of each function is calculated using the differences between the real and approximate function values at the experimental points. A sequential approximate optimization technique based on the trust region algorithm is adopted to manage approximate models. The proposed approach is validated by solving some design problems. The results of the problems show the effectiveness of the proposed method.

• Structural Engineering and Mechanics
• /
• v.45 no.6
• /
• pp.759-777
• /
• 2013

In this paper, a topology optimization method based on the element independent nodal density (EIND) is developed for continuum solids with multiple load cases and multiple constraints. The optimization problem is formulated ad minimizing the volume subject to displacement constraints. Nodal densities of the finite element mesh are used a the design variable. The nodal densities are interpolated into any point in the design domain by the Shepard interpolation scheme and the Heaviside function. Without using additional constraints (such ad the filtering technique), mesh-independent, checkerboard-free, distinct optimal topology can be obtained. Adopting the rational approximation for material properties (RAMP), the topology optimization procedure is implemented using a solid isotropic material with penalization (SIMP) method and a dual programming optimization algorithm. The computational efficiency is greatly improved by multithread parallel computing with OpenMP to run parallel programs for the shared-memory model of parallel computation. Finally, several examples are presented to demonstrate the effectiveness of the developed techniques.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.10-26
• /
• 2005

In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase constraint. And also, if we order at a certain date which was set by administrative convenience, we have amount constraint to order the consolidated order demands (capacity constraint). We showed this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invented a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.4
• /
• pp.85-92
• /
• 1995

A new partitioning algorithm has been developed to implement a large circuit by using multiple field programmable gate array (FPGA) chips. While the conventional partitioning is to minimze the number of nets cut under size constraints, partitioning for multiple FPGAs has several additional constraints so that each partitioned subcircuit can be implemented in a FPGA chip. To obtain satisfactory results under the constraints, the partitioning is performed in two steps whhich are the intial partitioning for global optimization and the iterative partitioning improvements for constraint satisfaction. Experismental results using the MCNC benchmark examples show that our partition method produces better results thatn those of other recent approaches on the average.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.10a
• /
• pp.398-403
• /
• 2000

The design of multi-stage gear drives is a time-consuming process that includes additional design problems, which are not considered in the design of single-stage gear drives. In the previous research works, the authors have proposed a new algorithm to design multi-stage gear drives at the preliminary design phase. The proposed design algorithm automates the design process by integrating the dimensional design and the configuration design process. In the configuration design process, the positions of gears and shafts are determined by minimizing the geometrical volume (size) of a gearbox. However, various types of spatial constraints should be satisfied in practical design situation. To locate input and output shaft in specified positions is the typical example of such problems. In this paper, the authors show the formulations of spatial constraints applied to the design of four-stage gear drives. The design solution shows considerably good results, and the design system is confirmed to be readily applicable to practical design situation.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.5
• /
• pp.395-404
• /
• 2007

Feature-based modeling and history-based modeling are the two main paradigms that are used in most of current CAD systems. Although these modeling paradigms make it easier for designers to create solid model, it may pose dependency constraints on features that are interacting one with another. When editing such features, these constraints often cause unpredictable and unacceptable results. For example, when a parent feature is deleted, the child features of the parent feature are also deleted. This entails re-generations of the deleted features, which requires additional modeling time. In order to complement this situation, we propose a method to delete only the features of interest by disconnecting the dependency constraints. This method can provide designers with more efficient way of model modification.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.2
• /
• pp.99-112
• /
• 2006

In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase amount constraint. And also, if we order at a certain date which was set by administrative convenience, we have capacity constraint to order the consolidated order demands (capacity constraint). We show this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invent a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.828-833
• /
• 2004

The performance of a mixed $H_{\infty}/H_2$ design with pole placement constraints based on robust vibration control for a piezo/beam system is investigated. The governing equation of motion for the piezo/beam system is derived by Hamilton's principle. The assumed mode method is used to discretize the governing equation into a set of ordinary differential equation. A robust controller is designed by $H_{\infty}/H_2$ feedback control law that satisfies additional constraints on the closed-loop pole location in the face of model uncertainties, which are derived for a general class of convex regions of the complex plane. These constraints are expressed in terms of linear matrix inequalities (LMIs) approach for the multiobjective synthesis. The validity and applicability of this approach for vibration suppressions of SMART structural systems are discussed by damping out the multiple vibrational modes of the piezo/beam system.

• Smart Structures and Systems
• /
• v.12 no.2
• /
• pp.157-179
• /
• 2013

We present an approach, based on the state dependent Riccati equation, for designing non-collocated seismic response control strategies for buildings accounting for physical constraints, with particular attention to force saturation. We consider both cases of active control using general actuators and semi-active control using magnetorheological dampers. The formulation includes multi control devices, acceleration feedback and time delay compensation. In the active case, the proposed approach is a generalization of the classic linear quadratic regulator, while, in the semi-active case, it represents a novel generalization of the well-established modified clipped optimal approach. As discussed in the paper, the main advantage of the proposed approach with respect to existing strategies is that it allows to naturally handle a broad class of non-linearities as well as different types of control constraints, not limited to force saturation but also including, for instance, displacement limitations. Numerical results on a typical building benchmark problem demonstrate that these additional features are achieved with essentially the same control effectiveness of existing saturation control strategies.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.2
• /
• pp.389-397
• /
• 2011

The global dynamic window approach (DWA) is widely used to generate the shortest path of mobile robots considering obstacles and kinematic constraints. However, the dynamic constraints of robots should be considered to generate the minimum-time path. We propose a modified global DWA considering the dynamic constraints of robots. The reference path is generated using A* algorithm and smoothed by cardinal spline function. The trajectory is then generated to follows the reference path in the minimum time considering the robot dynamics. Finally, the local path is generated using the dynamic window which includes additional terms of speed and orientation. Simulation and experimental results are presented to verify the performance of the proposed method.