• Title/Summary/Keyword: Linear Space Algorithm

Search Result 326, Processing Time 0.027 seconds

Design of Neurofuzzy Networks by Means of Linear Fuzzy Inference and Its Application to Software Engineering (선형 퍼지추론을 이용한 뉴로퍼지 네트워크의 설계와 소프트웨어 공학으로의 응용)

  • Park, Byoung-Jun;Park, Ho-Sung;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2002.07d
    • /
    • pp.2818-2820
    • /
    • 2002
  • In this paper, we design neurofuzzy networks architecture by means of linear fuzzy inference. The proposed neurofuzzy networks are equivalent to linear fuzzy rules, and the structure of these networks is composed of two main substructures, namely premise part and consequence part. The premise part of neurofuzzy networks use fuzzy space partitioning in terms of all variables for considering correlation between input variables. The consequence part is networks constituted as first-order linear form. The consequence part of neurofuzzy networks in general structure(for instance ANFIS networks) consists of nodes with a function that is a linear combination of input variables. But that of the proposed neurofuzzy networks consists of not nodes but networks that are constructed by connection weight and itself correspond to a linear combination of input variables functionally. The connection weights in consequence part are learned by back-propagation algorithm. For the evaluation of proposed neurofuzzy networks. The experimental results include a well-known NASA dataset concerning software cost estimation.

  • PDF

An Algorithm for the Singly Linearly Constrained Concave Minimization Problem with Upper Convergent Bounded Variables (상한 융합 변수를 갖는 단선형제약 오목함수 최소화 문제의 해법)

  • Oh, Se-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.7 no.5
    • /
    • pp.213-219
    • /
    • 2016
  • This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

Optimal Basis Function Selection for Polynomial Response Surface Model Using Genetic Algorithm (유전 알고리즘을 이용한 다항식 반응면 모델의 최적 기저함수 선정)

  • Kim, Sang-Jin;You, Heung-Cheol;Bae, Seung-Ho
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.41 no.1
    • /
    • pp.48-53
    • /
    • 2013
  • Polynomial response surface model has been widely used as approximation model which replace physical or numerical experiments in various engineering fields. Generally, low-order model is used to reduce experimental points required to construct the response surfaces, but this approach has limit to represent the highly non-linear phenomena. In this paper, we developed the method to expand modeling capabilities of polynomial response surfaces by increasing order of polynomial and selecting optimum polynomial basis functions. Genetic algorithm is used to choose optimal polynomial basis functions. Developed method was applied to analytic functions with 1 or 2 variables and wind tunnel test data modeling. The results show that this method is applicable to building response surface models for highly non-linear phenomena.

Flight Control of Tilt-Rotor Airplane In Rotary-Wing Mode Using Adaptive Control Based on Output-Feedback (출력기반 적응제어기법을 이용한 틸트로터 항공기의 회전익 모드 설계연구)

  • Ha, Cheol-Keun;Im, Jae-Hyoung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.38 no.3
    • /
    • pp.228-235
    • /
    • 2010
  • This paper deals with an autonomous flight controller design problem for a tilt-rotor aircraft in rotary-wing mode. The inner-loop algorithm is designed using the output-based approximate feedback linearization. The model error originated from the feedback linearization is cancelled within allowable tolerance by using single-hidden-layer neural network. According to Lyapunov direct stability theory, the adaptive update law is derived to run the neural network on-line, which is based on the linear observer dynamics. Moreover, the outer-loop algorithm is designed to track the trajectory generated from way-point guidance. Especially, heading and flight-path angle line-of-sight guidance are applied to the outer-loop to improve accuracy of the landing tracking performance. The 6-DOF nonlinear simulation shows that the overall performance of the flight control algorithm is satisfactory even though the collective input response shows instantaneous actuator saturation for a short time due to the lack of the neural network and the saturation protection logic in that loop.

Development of Dynamic Balancing Techniques of a Rotor System Using Genetic Algorithm (유전자 알고리즘을 적용한 로터 시스템의 동적 밸런싱 기법 개발)

  • Kwon, Hyuck-Ju;Yu, Young-Hyun;Jung, Sung-Nam;Yun, Chul-Yong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.38 no.12
    • /
    • pp.1162-1169
    • /
    • 2010
  • The dynamic balancing of a rotor system is needed to alleviate the imbalances originating from various sources encountered during blade manufacturing processes and environmental factors. This work aims at developing a comprehensive analysis system which consists of cumulative module of test D/B and selection of optimal control parameters. This system can be used for the dynamic balancing of helicopter rotors based on tracking results from the whirl tower test. For simplicity of the analysis, a linear relation is assumed between the balancing input parameters and the blade track responses leading to influence coefficients and thereby the rotor system identification is made. In addition, the balancing parameters of the individual blades are sought using the genetic algorithm and the effectiveness of the proposed method is demonstrated in comparison with the test results.

Optimized Multi-Output Fuzzy Neural Networks Based on Interval Type-2 Fuzzy Set for Pattern Recognition (패턴 인식을 위한 Interval Type-2 퍼지 집합 기반의 최적 다중출력 퍼지 뉴럴 네트워크)

  • Park, Keon-Jun;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.5
    • /
    • pp.705-711
    • /
    • 2013
  • In this paper, we introduce an design of multi-output fuzzy neural networks based on Interval Type-2 fuzzy set. The proposed Interval Type-2 fuzzy set-based fuzzy neural networks with multi-output (IT2FS-based FNNm) comprise the network structure generated by dividing the input space individually. The premise part of the fuzzy rules of the network reflects the individuality of the division space for the entire input space and the consequent part of the fuzzy rules expresses three types of polynomial functions with interval sets such as constant, linear, and modified quadratic inference for pattern recognition. The learning of fuzzy neural networks is realized by adjusting connections of the neurons in the consequent part of the fuzzy rules, and it follows a back-propagation algorithm. In addition, in order to optimize the network, the parameters of the network such as apexes of membership functions, uncertainty factor, learning rate and momentum coefficient were automatically optimized by using real-coded genetic algorithm. The proposed model is evaluated with the use of numerical experimentation.

Performance Analysis of a Flat-Earth Explicit Guidance Algorithm Applicable for Upper Stages of Space Launch Vehicles (발사체 상단 유도를 위한 단순화된 직접식 유도 방식 성능 분석)

  • Song, Eun-Jung;Cho, Sang-Bum;Park, Chang-Su;Roh, Woong-Rae
    • Aerospace Engineering and Technology
    • /
    • v.11 no.1
    • /
    • pp.169-177
    • /
    • 2012
  • This paper considers the explicit guidance algorithm to determine the closed-loop guidance law applicable to upper stages of a given space launch vehicle. It has the advantage of very simple forms derived from the flat earth assumption, which is appropriate for its on-board application. However the simple time-to-go prediction equation produces the degraded guidance performance of the launcher because of its inaccuracy. To overcome the problem, the elaborate prediction equations, which have been employed in Saturn and H-II, are attempted here. Finally, the simulation results show that the simple guidance approach requires the more accurate time-to-go prediction and gravity integrals for its broad application.

Robust Controller Design in Parameter Space (플랜트 매개 변수 공간상의 강인 안정화 제어기 설계)

  • Hwang, Hu-Mor
    • Proceedings of the KIEE Conference
    • /
    • 1992.07a
    • /
    • pp.285-287
    • /
    • 1992
  • This paper considers the design of robust stabilizing controller of a linear time-invariant digital system subject to variations of parameter vector. For a given controller the radius of the largest stability hypersphere in this parameter space is calculated. This radius is a measure of the stability Margin of the closed-loop system. Based on this calculation a design procedure is proposed to robustify a given stabilizing controller. This algorithm iteratively enlarges the stability hypersphere in parameter space and can be used to design a controller to stabilize a plant subject to given ranges of parameter perturbations. These results are illustrated by an example.

  • PDF

Machine Repair Problem in Multistage Systems (직렬시스템의 수리 및 예비품 지원정책에 관한 연구)

  • Park, Young-Taek
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.15 no.2
    • /
    • pp.93-101
    • /
    • 1989
  • The classic machine repair problem is extended to the case where a number of different machines are arranged in the sequence of operation. The steady-state availability of the system with a series of operating machines is maximized under some constraints such as total cost, available space. In order to find the optimal numbers of spare units and repair channels for each operating machine, the problem is formulated as non-linear integer programming(NLIP) problem and an efficient algorithm, which is a natural extension of the new Lawler-Bell algorithm of Sasaki et al., is used to solve the NLIP problem. A numerical example is given to illustrate the algorithm.

  • PDF

Estimation of Distributed Signal's Direction of Arrival Using Advanced ESPRIT Algorithm (개선된 ESPRIT 알고리즘을 이용한 퍼진 신호의 신호도착방향 추정)

  • Chung, Sung-Hoon;Lee, Dong-Wook
    • Proceedings of the KIEE Conference
    • /
    • 1999.11c
    • /
    • pp.703-705
    • /
    • 1999
  • In this paper, we introduce the direction of arrival(DOA) estimation of distributed signal based on the improved ESPRIT algorithm. Most research on the estimation of DOA has been performed based on the assumption that the signal sources are point sources. However, we consider a two-dimensional distributed signal source model using improved ESPRIT algorithm. In the distributed signal source model, a source is represented by two parameters, the azimuth angle and elevation angle. We address the estimation of the elevation and azimuth angles of distributed sources based on the parametric source modeling in the three-dimensional space with two uniform linear arrays. The array output vector is obtained by integrating a steering vector over all direction of arrival with the weighting of a distributed source density function. We also develop an efficient estimation procedures that can reduce the computational complexity. Some examples are shown to demonstrate explicity the estimation procedures under the distributed signal source model.

  • PDF