• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.03a
• /
• pp.330-339
• /
• 2008

Ground-based interceptors(GBI) comprise a major element of the strategic defense against hostile targets like Intercontinental Ballistic Missiles(ICBM) and reentry vehicles(RV) dispersed from them. An optimum design of the subsystems is required to increase the performance and reliability of these GBI. Propulsion subsystem design and optimization is the motivation for this effort. This paper describes an effort in which an entire GBI missile system, including a multi-stage solid rocket booster, is considered simultaneously in a Genetic Algorithm(GA) performance optimization process. Single goal, constrained optimization is performed. For specified payload and miss distance, time of flight, the most important component in the optimization process is the booster, for its takeoff weight, time of flight, or a combination of the two. The GBI is assumed to be a multistage missile that uses target location data provided by two ground based RF radar sensors and two low earth orbit(LEO) IR sensors. 3Dimensional model is developed for a multistage target with a boost phase acceleration profile that depends on total mass, propellant mass and the specific impulse in the gravity field. The monostatic radar cross section (RCS) data of a three stage ICBM is used. For preliminary design, GBI is assumed to have a fixed initial position from the target launch point and zero launch delay. GBI carries the Kill Vehicle(KV) to an optimal position in space to allow it to complete the intercept. The objective is to design and optimize the propulsion system for the GBI that will fulfill mission requirements and objectives. The KV weight and volume requirements are specified in the problem definition before the optimization is computed. We have considered only continuous design variables, while considering discrete variables as input. Though the number of stages should also be one of the design variables, however, in this paper it is fixed as three. The elite solution from GA is passed on to(Sequential Quadratic Programming) SQP as near optimal guess. The SQP then performs local convergence to identify the minimum mass of the GBI. The performance of the three staged GBI is validated using a ballistic missile intercept scenario modeled in Matlab/SIMULINK.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.3
• /
• pp.1-7
• /
• 1999

In this research, transformation-based optimization techniques for pipelined designs have been developed. The transformation-based optimization techniques include pipelined architecture transformations and retiming transformations. The new transformation method has the following three features. First, the overall performance of a pipelined system is optimized owing to various transformations including retiming of multiple pipelined blocks. Second, these techniques can be used to search a large solution space by allowing efficient exploration of trade-offs between area and performance. Third, these techniques can be easily extended to a new transformation or algorithm and can be used to optimize memory or bus architectures. Experimental results illustrate that these transformation-based optimization techniques improve area by 21% and performance by 17% on the average for a set of pipelined designs. Especially, the techniques are useful to efficiently explore a large design space.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.562-572
• /
• 2015

For a multiprocessor System-on-Chip (MPSoC) to achieve high performance via parallelism, we must consider how to partition a given application into different components and map the components onto multiple processors. In this paper, we propose a software pipeline-based partitioning method with cyclic dependent task management and communication optimization. During task partitioning, simultaneously considering computation load balance and communication optimization can cause interference, which leads to performance loss. To address this issue, we formulate their constraints and apply an integer linear programming approach to find an optimal partitioning result - one that requires a trade-off between these two factors. Experimental results on a reconfigurable MPSoC platform demonstrate the effectiveness of the proposed method, with 20% to 40% performance improvements compared to a traditional software pipeline-based partitioning method.

• The Journal of Information Technology and Database
• /
• v.7 no.2
• /
• pp.47-59
• /
• 2000

In this paper, we analyze the applicability of a general optimization algorithm to a database optimization problem. The index selection problem Is the problem to choose a set of indexes for a database in a way that the cost to process queries in the given workload is minimized subject to a given storage space restriction for storing indexes. The problem is well known in database research fields, and many optimization and/or heuristic algorithms have been proposed. Our work differs from previous research in that we formalize the problem in the form of non-linear Integer Programming model, and investigate the feasibility and applicability of a general purpose optimization algorithm, called OPBDP, through experiments. We implemented algorithms to generate workload data sets and problem instances for the experiment. The OPBDP algorithm, which is a non-linear 0-1 Integer Programming problem solver based on Davis-Putnam method, worked generally well for our problem formulation. The experiment result showed various performance characteristics depending on the types of decision variables, variable navigation methods and ocher algorithm parameters, and indicates the need of further study on the exploitation of the general purpose optimization techniques for the optimization problems in database area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5013-5034
• /
• 2019

In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

• Nuclear Engineering and Technology
• /
• v.54 no.11
• /
• pp.4181-4194
• /
• 2022

Main steam safety valves are commonly used in nuclear power plants to provide final protections from overpressure events. Blowdown and dynamic stability are two critical characteristics of safety valves. However, due to the parameter sensitivity and multi-parameter features of safety valves, using traditional method to design and/or optimize them is generally difficult and/or inefficient. To overcome these problems, a surrogate model-based valve design optimization is carried out in this study, of particular interest are methods of valve surrogate modeling, valve parameters global sensitivity analysis and valve performance optimization. To construct the surrogate model, Design of Experiments (DoE) and Computational Fluid Dynamics (CFD) simulations of the safety valve were performed successively, thereby an ensemble surrogate model (E-AHF) was built for valve blowdown and stability predictions. With the developed E-AHF model, global sensitivity analysis (GSA) on the valve parameters was performed, thereby five primary parameters that affect valve performance were identified. Finally, the k-sigma method is used to conduct the robust optimization on the valve. After optimization, the valve remains stable, the minimum blowdown of the safety valve is reduced greatly from 13.30% to 2.70%, and the corresponding variance is reduced from 1.04 to 0.65 as well, confirming the feasibility and effectiveness of the optimization method proposed in this paper.

• Safety and Health at Work
• /
• v.6 no.2
• /
• pp.77-84
• /
• 2015

Background: A unique framework for performance optimization of generation companies (GENCOs) based on health, safety, environment, and ergonomics (HSEE) indicators is presented. Methods: To rank this sector of industry, the combination of data envelopment analysis (DEA), principal component analysis (PCA), and Taguchi are used for all branches of GENCOs. These methods are applied in an integrated manner to measure the performance of GENCO. The preferred model between DEA, PCA, and Taguchi is selected based on sensitivity analysis and maximum correlation between rankings. To achieve the stated objectives, noise is introduced into input data. Results: The results show that Taguchi outperforms other methods. Moreover, a comprehensive experiment is carried out to identify the most influential factor for ranking GENCOs. Conclusion: The approach developed in this study could be used for continuous assessment and improvement of GENCO's performance in supplying energy with respect to HSEE factors. The results of such studies would help managers to have better understanding of weak and strong points in terms of HSEE factors.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2001.11a
• /
• pp.166-171
• /
• 2001

In order to improve the efficiency of the design process and the quality of the resulting design for the application-based exclusive rolling element bearings, this study propose design methodologies by using a genetic-based combinatorial optimization. By the presence of discrete variables such as the number of rolling element (standard component) and by the engineering point of views, the design problem of the rolling element bearing can be characterized by the combinatorial optimization problem as a fully discrete optimization. A genetic algorithm is used to efficiently find a set of the optimum discrete design values from the pre-defined variable sets. To effectively deal with the design constraints and the multi-objective problem, a ranking penalty method is suggested for constructing a fitness function in the genetic-based combinatorial optimization. To evaluate the proposed design method, a robust performance analyzer of ball bearing based on quasi-static analysis is developed and the computer program is applied to some design problems, 1) maximize fatigue life, 2) maximize stiffness, 3) maximize fatigue life and stiffness, of a angular contact ball bearing. Optimum design results are demonstrate the effectiveness of the design method suggested in this study. It believed that the proposed methodologies can be effectively applied to other multi-objective discrete optimization problems.

• The Journal of Korea Robotics Society
• /
• v.15 no.3
• /
• pp.212-220
• /
• 2020

This paper deals with a strategy of gain optimization for the kinematic control algorithm of a wire-driven surgical robot. The proposed controller consists of the closed-loop inverse kinematics with the back-calculation method. The closed-loop inverse kinematics has 18 PID control gains, and the back-calculation method has 6 gains. An efficient strategy is designed to optimize 18 values first and then the remaining 6 values. The optimal gain sets are searched under the step input with performance indices. In this gain optimization, the objective function is defined as the minimum value of signal-to-noise ratio of the performance indices for 6 DoF (Degree-of-Freedom) motion that is based on the Taguchi method, and the constraints are applied to obtain stable responses for each motion evenly. The gain sets obtained are verified by simulations using the test trajectories. In comparative results, the optimal gain value based on the performance index combined with ISE (integral of square error) and settling time showed the best control performance.

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

This paper presents a novel method to speed up neural network (NN) based face detection systems. NN-based face detection can be viewed as a classification and search problem. The proposed method formulates the search problem as an integer nonlinear optimization problem (INLP) and expands the basic particle swarm optimization (PSO) to solve it. PSO works with a population of particles, each representing a subwindow in an input image. The subwindows are evaluated by how well they match a NN-based face filter. A face is indicated when the filter response of the best particle is above a given threshold. To achieve better performance, the influence of PSO parameter settings on the search performance was investigated. Experiments show that with fine-adjusted parameters, the proposed method leads to a speedup of 94 on 320${\times}$240 images compared to the traditional exhaustive search method.