• Journal of IKEEE
• /
• v.1 no.1 s.1
• /
• pp.19-30
• /
• 1997

In this paper we design the optimal satellite-tracking antenna $H{\infty}$ control system using genetic algorithms. To do this, we give gain and dynamics parameters to the weighting functions and apply genetic algorithms with reference model to the optimal determination of weighting functions and design parameter ${\gamma}$ that are given by Glover-Doyle algorithm which can design $H{\infty}$ controller in the state space. These weighting functions and design parameter ${\gamma}$ are optimized simultaneously in the search domain guaranteeing the robust stability of closed-loop system. The effectiveness of this satellite-tracking antenna $H{\infty}$ control system is verified by computer simulation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.12 no.19
• /
• pp.39-47
• /
• 1989

This paper considers a multi-stage flowshop scheduling Problem where the setup times of jots depend on immediately preceding jobs. Three heuristics algorithms, CAMPBELL, PEIDAN and CAMRING are proposed. The performance measure is a minimization of makespan. The parameters of simulation model are PS(ratio of the processing times to setup times), M(number of machines), and N(number of job). This simulation model for each algorithm is a 4$\times$3$\times$3 factorial design with 360 observations. The makespan of the proposed heuristic algorithms is compared with the optimal makespan obtained by the complete enumeration of schedules. This yardstick of comparison is defined as a relative error. The mean relative error of CAMPBELL, PEIDAN, and CAMRING algorithms are 4.353%, 7.908%, and 8.578% respectively. The SPSS, is used to analyse emphirical results. The experimental results show that the three factors are statistically significant at 5% level.

• Journal of information and communication convergence engineering
• /
• v.19 no.4
• /
• pp.241-247
• /
• 2021

Particulate matter has emerged as a serious global problem, necessitating highly reliable information on the matter. Therefore, various algorithms have been used in studies to predict particulate matter. In this study, we compared the prediction performance of neural network models that have been actively studied for particulate matter prediction. Among the neural network algorithms, a deep neural network (DNN), a recurrent neural network, and long short-term memory were used to design the optimal prediction model using a hyper-parameter search. In the comparative analysis of the prediction performance of each model, the DNN model showed a lower root mean square error (RMSE) than the other algorithms in the performance comparison using the RMSE and the level of accuracy as metrics for evaluation. The stability of the recurrent neural network was slightly lower than that of the other algorithms, although the accuracy was higher.

• Proceedings of the KIEE Conference
• /
• 2004.04a
• /
• pp.212-214
• /
• 2004

As the maximum power operating point(MPOP) of photovoltaic(PV) power generation systems changes with changing atmospheric conditions such as solar radiation and temperature, an important consideration in the design of efficient PV system is to track the MPOP correctly. Many maximum power point tracking(MPPT) techniques have been considered in the past, however, techniques using microprocessors with appropriate MPPT algorithms are favored because of their flexibility and compatibility with different PV arrays. Although the efficiency of these MPPT algorithms is usually high, it drops noticeably in case of rapidly changing atmospheric conditions. This paper analysed and researched the characteristics of three MPPT algorithms; P&O, Inc&Cond, ImP&O and simulated them with irradiance changing.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.223-226
• /
• 1997

Usually, the Evolutionary Algorithms(EAs) are considered more efficient for optimal, system design because EAs can provide higher opportunity for obtaining the global optimal solution. This paper presents a mechanism of co-evolution consists of the two genetic algorithms(GAs). This mechanism includes host populations and parasite populations. These two populations are closely related to each other, and the parasite populations plays an important role of searching for useful schema in host populations. Host population represented by feedforward neural network and the result of co-evolution we will find the optimal structure of the neural network. We used the genetic algorithm that search the structure of the feedforward neural network, and evolution strategies which train the weight of neuron, and optimize the net structure. The validity and effectiveness of the proposed method is exemplified on the stabilization and position control of the inverted-pendulum system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.370-370
• /
• 2000

In this paper, we design a Multi-Fuzzy model by means of HCM clustering and genetic algorithms for a nonlinear system. In order to determine structure of the proposed Multi-Fuzzy model, HCM clustering method is used. The parameters of membership function of the Multi-Fuzzy ate identified by genetic algorithms. A aggregate performance index with a weighting factor is used to achieve a sound balance between approximation and generalization abilities of the model. We use simplified inference and linear inference as inference method of the proposed Multi-Fuzzy mode] and the standard least square method for estimating consequence parameters of the Multi-Fuzzy. Finally, we use some of numerical data to evaluate the proposed Multi-Fuzzy model and discuss about the usefulness.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.11-24
• /
• 1996

The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.2
• /
• pp.11-19
• /
• 2012

Crane systems have been widely used for transportation in building sites, ports, nuclear wastehandling operation and so on. As a typical underactuated system, an overhead crane has such merits as high flexibility and less energy consumption. And it's getting more types of cranes, universally applicable algorithms should be developed. That is the design and development of scalable algorithms are required. Developed algorithms can be used for the controller and crane overload protection that meets the requirements of the algorithm are presented. These algorithms force the state to warn the operator and stops the operation of equipment. In this paper, crane overload conditions that can cause damage to alert the operator, and to limit the operation of equipment overload protection algorithm is presented.

• Proceedings of the KIPE Conference
• /
• 2001.10a
• /
• pp.746-750
• /
• 2001

During the last decades several proposals have been made in literature to use predictive control for inverter control-especially in electrical drives. These algorithms are completely different to the recursive but linear predictive algorithms known from information theory, where closed mathematical equations are used (e.g. Kalman-filters). Only few of the presented schemes have been realized in industrial applications so far. After some further progress, however, the advantage of predictive algorithms might lead to an increased number of industrial implementations in the future. Besides the common basic idea - to use the well-known but strongly non-linear behaviour of inverters to precalculate the best switching times - there are many differences in the details of these proposals. This contribution shows similarities and differences and attempts to design a 'family tree' of predictive control algorithms. This might grow to a first step to a theoretical approach to deal with predictive control schemes in a more generalised way.