• Title/Summary/Keyword: robust optimization problem

Search Result 252, Processing Time 0.028 seconds

Distribution System Reconfiguration Using the PC Cluster based Parallel Adaptive Evolutionary Algorithm

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho;Hwang Gi-Hyun;Yoon Yoo-Soo
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.3
    • /
    • pp.269-279
    • /
    • 2005
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to find the optimal switch position because of its numerous local minima. In this investigation, a parallel AEA was developed for the reconfiguration of the distribution system. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of GA and the local search capability of ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC-cluster system consisting of 8 PCs·was developed. Each PC employs the 2 GHz Pentium IV CPU, and is connected with others through switch based fast Ethernet. The new developed algorithm has been tested and is compared to distribution systems in the reference paper to verify the usefulness of the proposed method. From the simulation results, it is found that the proposed algorithm is efficient and robust for distribution system reconfiguration in terms of the solution quality, speedup, efficiency, and computation time.

The Optimization of Ensembles for Bankruptcy Prediction (기업부도 예측 앙상블 모형의 최적화)

  • Myoung Jong Kim;Woo Seob Yun
    • Information Systems Review
    • /
    • v.24 no.1
    • /
    • pp.39-57
    • /
    • 2022
  • This paper proposes the GMOPTBoost algorithm to improve the performance of the AdaBoost algorithm for bankruptcy prediction in which class imbalance problem is inherent. AdaBoost algorithm has the advantage of providing a robust learning opportunity for misclassified samples. However, there is a limitation in addressing class imbalance problem because the concept of arithmetic mean accuracy is embedded in AdaBoost algorithm. GMOPTBoost can optimize the geometric mean accuracy and effectively solve the category imbalance problem by applying Gaussian gradient descent. The samples are constructed according to the following two phases. First, five class imbalance datasets are constructed to verify the effect of the class imbalance problem on the performance of the prediction model and the performance improvement effect of GMOPTBoost. Second, class balanced data are constituted through data sampling techniques to verify the performance improvement effect of GMOPTBoost. The main results of 30 times of cross-validation analyzes are as follows. First, the class imbalance problem degrades the performance of ensembles. Second, GMOPTBoost contributes to performance improvements of AdaBoost ensembles trained on imbalanced datasets. Third, Data sampling techniques have a positive impact on performance improvement. Finally, GMOPTBoost contributes to significant performance improvement of AdaBoost ensembles trained on balanced datasets.

Error Resilient Video Coding Techniques Using Multiple Description Scheme (다중 표현을 이용한 에러에 강인한 동영상 부호화 방법)

  • 김일구;조남익
    • Journal of Broadcast Engineering
    • /
    • v.9 no.1
    • /
    • pp.17-31
    • /
    • 2004
  • This paper proposes an algorithm for the robust transmission of video in error Prone environment using multiple description codingby optimal split of DCT coefficients and rate-distortionoptimization framework. In MDC, a source signal is split Into several coded streams, which is called descriptions, and each description is transmitted to the decoder through different channel. Between descriptions, structured correlations are introduced at the encoder, and the decoder exploits this correlation to reconstruct the original signal even if some descriptions are missing. It has been shown that the MDC is more resilient than the singe description coding(SDC) against severe packet loss ratecondition. But the excessive redundancy in MDC, i.e., the correlation between the descriptions, degrades the RD performance under low PLR condition. To overcome this Problem of MDC, we propose a hybrid MDC method that controls the SDC/MDC switching according to channel condition. For example, the SDC is used for coding efficiency at low PLR condition and the MDC is used for the error resilience at high PLR condition. To control the SDC/MDC switching in the optimal way, RD optimization framework are used. Lagrange optimization technique minimizes the RD-based cost function, D+M, where R is the actually coded bit rate and D is the estimated distortion. The recursive optimal pet-pixel estimatetechnique is adopted to estimate accurate the decoder distortion. Experimental results show that the proposed optimal split of DCT coefficients and SD/MD switching algorithm is more effective than the conventional MU algorithms in low PLR conditions as well as In high PLR condition.

Analysis of cable structures through energy minimization

  • Toklu, Yusuf Cengiz;Bekdas, Gebrail;Temur, Rasim
    • Structural Engineering and Mechanics
    • /
    • v.62 no.6
    • /
    • pp.749-758
    • /
    • 2017
  • In structural mechanics, traditional analyses methods usually employ matrix operations for obtaining displacement and internal forces of the structure under the external effects, such as distributed loads, earthquake or wind excitations, and temperature changing inter alia. These matrices are derived from the well-known principle of mechanics called minimum potential energy. According to this principle, a system can be in the equilibrium state only in case when the total potential energy of system is minimum. A close examination of the expression of the well-known equilibrium condition for linear problems, $P=K{\Delta}$, where P is the load vector, K is the stiffness matrix and ${\Delta}$ is the displacement vector, it is seen that, basically this principle searches the displacement set (or deformed shape) for a system that minimizes the total potential energy of it. Instead of using mathematical operations used in the conventional methods, with a different formulation, meta-heuristic algorithms can also be used for solving this minimization problem by defining total potential energy as objective function and displacements as design variables. Based on this idea the technique called Total Potential Optimization using Meta-heuristic Algorithms (TPO/MA) is proposed. The method has been successfully applied for linear and non-linear analyses of trusses and truss-like structures, and the results have shown that the approach is much more successful than conventional methods, especially for analyses of non-linear systems. In this study, the application of TPO/MA, with Harmony Search as the selected meta-heuristic algorithm, to cables net system is presented. The results have shown that the method is robust, powerful and accurate.

Adaptive stochastic gradient method under two mixing heterogenous models (두 이종 혼합 모형에서의 수정된 경사 하강법)

  • Moon, Sang Jun;Jeon, Jong-June
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.6
    • /
    • pp.1245-1255
    • /
    • 2017
  • The online learning is a process of obtaining the solution for a given objective function where the data is accumulated in real time or in batch units. The stochastic gradient descent method is one of the most widely used for the online learning. This method is not only easy to implement, but also has good properties of the solution under the assumption that the generating model of data is homogeneous. However, the stochastic gradient method could severely mislead the online-learning when the homogeneity is actually violated. We assume that there are two heterogeneous generating models in the observation, and propose the a new stochastic gradient method that mitigate the problem of the heterogeneous models. We introduce a robust mini-batch optimization method using statistical tests and investigate the convergence radius of the solution in the proposed method. Moreover, the theoretical results are confirmed by the numerical simulations.

A Study on the Optimum Design of Warm-up rate in a Air-Heated Heater System by Using CFD Analysis and Taguchi Method (전산유체해석과 다구찌 방법을 연계한 공기 가열식 히터 시스템의 난방속효성 최적화에 관한 연구)

  • Kim, Min-Ho
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.13 no.2
    • /
    • pp.72-82
    • /
    • 2005
  • The objective of this paper is to describe the optimization of design parameters in a large-sized commercial bus heater system by using CFD(computational fluid dynamics) analysis and Taguchi method. In order to obtain the best combination of each control factor which results in a desired performance of heater system, the parameter design of the Taguchi method is adopted for the robust design considering the dynamic characteristic. The research activity may be divided into four phases. The first one is analyzing the problem, i.e., ascertaining the influential factors. In the second phase the levels were set in such a way that their variation would significantly influence the response. In the third phase the experimental runs were designed. In the final phase the planned runs were carried out numerically to evaluate the optimal combination of factors which is able to provide the best response. In this study, eight factors were considered for the analysis: one with two level and seven with three level combinations comprising the $L_{18}(2^1{\times}3^7)$ orthogonal array. The results of this study can be summarized as follows ; (i)The optimum condition of control factor is a set of <$A_2\;B_1\;C_3\;D_3\;E_1\;F_2\;G_3\;H_2$> where A is shape of the outer fin, B is pitch of the outer fin, C is height of the outer fin, D is the inner fin number, E is the inner fin height, F is length of the flame guide, G is diameter of the heating element and H is clearance between air guide and heating element. (ii)The heat capacity of heated discharge air under the optimum condition satisfies the equation y=0.6M w here M is a signal factor. (iii)The warm-up rate improves about three times, more largely as com pared with the current condition, which results in about 9.2minutes reduction.

Development of non-fragile $H_{\infty}$ controller design algorithm for singular systems (특이시스템의 비약성 $H_{\infty}$ 제어기 설계 알고리듬 개발)

  • Kim, Jong-Hae
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.42 no.6
    • /
    • pp.9-14
    • /
    • 2005
  • In this paper, we consider the synthesis of non-fragile $H_{\infty}$ state feedback controllers for singular systems and static state feedback controller with multiplicative uncertainty. The sufficient condition of controller existence, the design method of non-fragile $H_{\infty}$ controller, and the measure of non-fragility in controller are presented via LMI(linear matrix inequality) technique. Also, the sufficient condition can be rewritten as LMI form in terms of transformed variables through singular value decomposition, some changes of variables, and Schur complements. Therefore, the obtained non-fragile $H_{\infty}$ controller guarantees the asymptotic stability and disturbance attenuation of the closed loop singular systems within a prescribed degree. Moreover, the controller design method can be extended to the problem of robust and non-fragile $H_{\infty}$ controller design method for singular systems with parameter uncertainties. Finally, a numerical example is given to illustrate the design method.

Understanding of 3D Human Body Motion based on Mono-Vision (단일 비전 기반 인체의 3차원 운동 해석)

  • Han, Young-Mo
    • The KIPS Transactions:PartB
    • /
    • v.18B no.4
    • /
    • pp.193-200
    • /
    • 2011
  • This paper proposes a low-cost visual analyzer algorithm of human body motion for real-time applications such as human-computer interfacing, virtual reality applications in medicine and telemonitoring of patients. To reduce cost of its use, we design the algorithm to use a single camera. To make the proposed system to be used more conveniently, we avoid from using optical markers. To make the proposed algorithm be convenient for real-time applications, we design it to have a closed-form with high accuracy. To design a closed-form algorithm, we propose an idea that formulates motion of a human body joint as a 2D universal joint model instead of a common 3D spherical joint model, without any kins of approximation. To make the closed-form algorithm has high accuracy, we formulates the estimation process to be an optimization problem. Thus-desined algorithm is applied to each joint of the human body one after another. Through experiments we show that human body motion capturing can be performed in an efficient and robust manner by using our algorithm.

Robust Intelligent Digital Redesign of Nonlinear System with Parametric Uncertainties (불확실성을 갖는 비선형 시스템의 강인한 지능형 디지털 재설계)

  • Sung, Hwa-Chang;Joo, Young-Hoon;Park, Jin-Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.2
    • /
    • pp.138-143
    • /
    • 2006
  • This paper presents intelligent digital redesign method for hybrid state space fuzzy-model-based controllers. For effectiveness and stabilization of continuous-time uncertain nonlinear systems under discrete-time controller, Takagi-Sugeno(TS) fuzzy model is used to represent the complex system. And global approach design problems viewed as a convex optimization problem that we minimize the error of the norm bounds between nonlinearly interpolated linear operators to be matched. Also, by using the bilinear and inverse bilinear approximation method, we analyzed nonlinear system's uncertain parts more precisely. When a sampling period is sufficiently small, the conversion of a continuous-time structured uncertain nonlinear system to an equivalent discrete-time system have proper reason. Sufficiently conditions for the global state-matching of the digitally controlled system are formulated in terms of linear matrix inequalities (LMIs). Finally, a TS fuzzy model for the chaotic Lorentz system is used as an . example to guarantee the stability and effectiveness of the proposed method.

Bayesian Cognizance of RFID Tags (Bayes 풍의 RFID Tag 인식)

  • Park, Jin-Kyung;Ha, Jun;Choi, Cheon-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.70-77
    • /
    • 2009
  • In an RFID network consisting of a single reader and many tags, a framed and slotted ALOHA, which provides a number of slots for the tags to respond, was introduced for arbitrating a collision among tags' responses. In a framed and slotted ALOHA, the number of slots in each frame should be optimized to attain the maximal efficiency in tag cognizance. While such an optimization necessitates the knowledge about the number of tags, the reader hardly knows it. In this paper, we propose a tag cognizance scheme based on framed and slotted ALOHA, which is characterized by directly taking a Bayes action on the number of slots without estimating the number of tags separately. Specifically, a Bayes action is yielded by solving a decision problem which incorporates the prior distribution the number of tags, the observation on the number of slots in which no tag responds and the loss function reflecting the cognizance rate. Also, a Bayes action in each frame is supported by an evolution of prior distribution for the number of tags. From the simulation results, we observe that the pair of evolving prior distribution and Bayes action forms a robust scheme which attains a certain level of cognizance rate in spite of a high discrepancy between the Due and initially believed numbers of tags. Also, the proposed scheme is confirmed to be able to achieve higher cognizance completion probability than a scheme using classical estimate of the number of tags separately.