• Title/Summary/Keyword: Gradient Search Method

Search Result 130, Processing Time 0.025 seconds

Identification of Continuous System from Step Response using HS Optimization Algorithm (HS 최적화 알고리즘을 이용한 계단응답과 연속시스템 인식)

  • Lee, Tae-bong;Shon, Jin-geun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.65 no.4
    • /
    • pp.292-297
    • /
    • 2016
  • The first-order plus dead time(FOPDT) and second-order plus dead time(SOPDT), which describes a linear monotonic process quite well in most chemical and industrial processes and is often sufficient for PID and IMC controller tuning. This paper presents an application of heuristic harmony search(HS) optimization algorithm to the identification of linear continuous time-delay systems from step response. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through a number of simulation examples.

Vehicle Detection Scheme Based on a Boosting Classifier with Histogram of Oriented Gradient (HOG) Features and Image Segmentation] (HOG 특징 및 영상분할을 이용한 부스팅분류 기반 자동차 검출 기법)

  • Choi, Mi-Soon;Lee, Jeong-Hwan;Roh, Tae-Moon;Shim, Jae-Chang
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.10
    • /
    • pp.955-961
    • /
    • 2010
  • In this paper, we describe a study of a vehicle detection method based on a Boosting Classifier which uses Histogram of Oriented Gradient (HOG) features and Image Segmentation techniques. An input image is segmented by means of a split and merge algorithm. Then, the two largest segmented regions are removed in order to reduce the search region and speed up processing time. The HOG features are then calculated for each pixel in the search region. In order to detect the vehicle region we used the AdaBoost (adaptive boost) method, which is well known for classifying samples with two classes. To evaluate the performance of the proposed method, 537 training images were used to train and learn the classifier, followed by 500 non-training images to provide the recognition rate. From these experiments we were able to detect the proper image 98.34% of the time for the 500 non-training images. In conclusion, the proposed method can be used for detecting the location of a vehicle in an intelligent vehicle control system.

Hybrid Optimization Techniques Using Genetec Algorithms for Auto-Tuning Fuzzy Logic Controllers (유전 알고리듬을 이용한 자동 동조 퍼지 제어기의 하이브리드 최적화 기법)

  • Ryoo, Dong-Wan;Lee, Young-Seog;Park, Youn-Ho;Seo, Bo-Hyeok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.1
    • /
    • pp.36-43
    • /
    • 1999
  • This paper proposes a new hybrid genetic algorithm for auto-tuning fuzzy controllers improving the performance. In general, fuzzy controllers use pre-determined moderate membership functions, fuzzy rules, and scaling factors, by trial and error. The presented algorithm estimates automatically the optimal values of membership functions, fuzzy rules, and scaling factors for fuzzy controllers, using a hybrid genetic algorithm. The object of the proposed algorithm is to promote search efficiency by the hybrid optimization technique. The proposed hybrid genetic algorithm is based on both the standard genetic algorithm and a modified gradient method. If a maximum point is not be changed around an optimal value at the end of performance during given generation, the hybrid genetic algorithm searches for an optimal value using the the initial value which has maximum point by converting the genetic algorithms into the MGM(Modified Gradient Method) algorithms that reduced the number of variables. Using this algorithm is not only that the computing time is faster than genetic algorithm as reducing the number of variables, but also that can overcome the disadvantage of genetic algoritms. Simulation results verify the validity of the presented method.

  • PDF

Inverse Design For a Airfoil Using Optimizing Method (최적화기법을 이용한 익형의 역설계)

  • Kim Jong-seub;Park Warn-gyu
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.126-130
    • /
    • 1997
  • A new and efficient method is presented for design optimization, which is based on a computational fluid dynamics (CFD). The method is applied to design an airfoil configuration. The Navier-Stokes equations are solved for the viscous analysis of the flow, which provides the object function. The CFD analysis is then coupled with the optimization procedure that used a conjugate gradient method. During the one-dimensional search of the optimization procedure, an approximate flow analysis based on a first-order Taylor series expansion is used to reduce the computational cost, (This study is supported by Korean Ministry of Education through Research Fund)

  • PDF

Optimizations of Multi-hop Cooperative Molecular Communication in Cylindrical Anomalous-Diffusive Channel

  • Xuancheng Jin;Zhen Cheng;Zhian Ye;Weihua Gong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.4
    • /
    • pp.1075-1089
    • /
    • 2024
  • In this paper, the optimizations of multi-hop cooperative molecular communication (CMC) system in cylindrical anomalous-diffusive channel in three-dimensional enviroment are investigated. First, we derive the performance of bit error probability (BEP) of CMC system under decode-and-forward relay strategy. Then for achieving minimum average BEP, the optimization variables are detection thresholds at cooperative nodes and destination node, and the corresponding optimization problem is formulated. Furthermore, we use conjugate gradient (CG) algorithm to solve this optimization problem to search optimal detection thresholds. The numerical results show the optimal detection thresholds can be obtained by CG algorithm, which has good convergence behaviors with fewer iterations to achieve minimized average BEP compared with gradient decent algorithm and Bisection method which are used in molecular communication.

Optimization of Prestressed Concrete Beam Section (프리스트레스트 콘크리트 보 단면의 최적설계)

  • 조선규;최외호
    • Journal of the Korea Concrete Institute
    • /
    • v.12 no.4
    • /
    • pp.91-101
    • /
    • 2000
  • As the computer related technology evolves a study for a practical use of real structure as well as its hteory for optimum design has been greatly advanced. But the study on optimum design of pre-stressed concrete beam(PSC-beam) bridge for the construction of national roads and highways in Korea is not sufficient. Since a standard section for the PSC-beam is proposed, it is practically used in designing the PSC-beam. It is noticed that the section using the current standard PSC-beam design to be an over-designed with its surplus safety factor. Therefore, it is necessary to consider economical PSC-beam section which automatically satisfies all requirement of design specifications. Thus, in this study, the optimum design methods of PSC-beam are carried out using the gradient-based search method and global search method. As a result of the optimum design method, it was confirmed that the design of PSC-beam has a serious properties to non-linearity and discontinuity. And the section that in economical and efficinet design methods than the current standard design method is proposed.

Optimal Solution of a Cyclic Task Using the Global Path Information for a Redundant Robot (여유자유도 로봇에 있어서 광역의 경로정보를 이용한 주기작업의 최적해)

  • 최병욱;원종화;정명진
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.3
    • /
    • pp.6-15
    • /
    • 1992
  • This paper proposes a method for the global optimization of redundancy over the whole task period for a kinematically redundant robot. The necessary conditions based on the calculus of variations for an integral type cost criterion result in a second-order differential equation. For a cyclic task, the periodic boundary conditions due to conservativity requirements are discussed. We refine the two-point boundary value problem to an initial value adjustment problem and suggest a numerical search method for providing the conservative global optimal solution using the gradient projection method. Since the initial joint velocity is parameterized with the number of the redundancy, we only search the parameter value in the space of as many dimensions as the number of degrees of redundancy. We show through numerical examples that multiple nonhomotopic extremal solutions and the generality of the proposed method by considering the dynamics of a robot.

  • PDF

Optimization of Triple Response Systems by Using the Dual Response Approach and the Hooke-Jeeves Search Method

  • Fan, Shu-Kai S.;Huang, Chia-Fen;Chang, Ko-Wei;Chuang, Yu-Chiang
    • Industrial Engineering and Management Systems
    • /
    • v.9 no.1
    • /
    • pp.10-19
    • /
    • 2010
  • This paper presents an extended computing procedure for the global optimization of the triple response system (TRS) where the response functions are nonconvex (nonconcave) quadratics and the input factors satisfy a radial region of interest. The TRS arising from response surface modeling can be approximated using a nonlinear mathematical program involving one primary (objective) function and two secondary (constraints) functions. An optimization algorithm named triple response surface algorithm (TRSALG) is proposed to determine the global optimum for the nondegenerate TRS. In TRSALG, the Lagrange multipliers of target (secondary) functions are computed by using the Hooke-Jeeves search method, and the Lagrange multiplier of the radial constraint is located by using the trust region (TR) method at the same time. To ensure global optimality that can be attained by TRSALG, included is the means for detecting the degenerate case. In the field of numerical optimization, as the family of TR approach always exhibits excellent mathematical properties during optimization steps, thus the proposed algorithm can guarantee the global optimal solution where the optimality conditions are satisfied for the nondegenerate TRS. The computing procedure is illustrated in terms of examples found in the quality literature where the comparison results with a gradient-based method are used to calibrate TRSALG.

Variable Structure Controller with Time-Varying Switching Surface under the Bound of Input using Evolution Strategy (진화전략과 입력제약조건에 의한 시변스위칭면의 가변구조제어기 설계)

  • Lee, Min-Jeong;Kim, Hyeon-Sik;Choe, Yeong-Gyu;Jeon, Seong-Jeup
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.4
    • /
    • pp.402-409
    • /
    • 1999
  • Variable structure control law is well known to be a robust control algorithm and evolution strategy is used as an effective search algorithm in optimization problems. In this paper, we propose a variable structure controller with time-varying switching surface. We calculate the maximum value of seitching surface gradient that is of the 3rd order polynomial form. Evolution strategy is used to optimize the parameters of the switching surface gradient. Finally, the proposed method is applied to position tracking control for BLDC motor. Experimental results show that the proposed method is more useful than the conventional variable structure controller.

  • PDF

A Design and Performance Evaluation of Path Search by Simplification of Estimated Values based on Variable Heuristic (가변 휴리스틱 기반 추정치 간소화를 통한 경로탐색 기법의 설계 및 성능 평가)

  • Kim, Jin-Deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.11
    • /
    • pp.2002-2007
    • /
    • 2006
  • The path search method in the telematics system should consider traffic flow of the roads as well as the shortest time because the optimal path with minimized travel time could be continuously changed by the traffic flow. The existing path search methods are not able to cope efficiently with the change of the traffic flow. The search method to use traffic information also needs more computation time than the existing shortest path search. In this paper, a method for efficiency improvement of path search is implemented and its performance is evaluated. The method employs the fixed grid for adjustable heuristic to traffic flow. Moreover, in order to simplify the computation of estimation values, it only adds graded decimal values instead of multiplication operation of floating point numbers with due regard to the gradient between a departure and a destination. The results obtained from the experiments show that it achieves the high accuracy and short execution time as well.