• Journal of Electrical Engineering and Technology
• /
• v.13 no.4
• /
• pp.1740-1751
• /
• 2018

This paper proposes a novel fault tolerant tracking control (FTTC) scheme for a class of nonlinear systems with actuator failures based on the policy iteration (PI) algorithm and the adaptive fault observer. The estimated actuator failure from an adaptive fault observer is utilized to construct an improved performance index function that reflects the failure, regulation and control simultaneously. With the help of the proper performance index function, the FTTC problem can be transformed into an optimal control problem. The fault tolerant tracking controller is composed of the desired controller and the approximated optimal feedback one. The desired controller is developed to maintain the desired tracking performance at the steady-state, and the approximated optimal feedback controller is designed to stabilize the tracking error dynamics in an optimal manner. By establishing a critic neural network, the PI algorithm is utilized to solve the Hamilton-Jacobi-Bellman equation, and then the approximated optimal feedback controller can be derived. Based on Lyapunov technique, the uniform ultimate boundedness of the closed-loop system is proven. The proposed FTTC scheme is applied to reconfigurable manipulators with two degree of freedoms in order to test the effectiveness via numerical simulation.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.3
• /
• pp.120-130
• /
• 2001

We present an approach to parallelizing optimal power flow that is suitable for distributed implementation and is applicable to very large interconnected power systems. This approach can be used by utilities to optimize economy interchange without disclosing details of their operating costs to competitors. Recently, it is becoming necessary to incorporate contingency constraints into the formulation, and more rapid updates of telemetered data and faster solution time are becoming important to better track changes in the system. This concern led to a research to develop an efficient algorithm for a distributed optimal power flow based on the Auxiliary Problem Principle and to study the convergence rate improvement of the distributed algorithm. The objective of this paper is to find a set of control parameters with which the Auxiliary Problem Principle (Algorithm - APP) can be best implemented in solving optimal power flow problems. We employed several IEEE Reliability Test Systems, and Korea Power System to demonstrate the alternative parameter sets.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.9-18
• /
• 1996

Many algorithms have been developed for optimizing the asymmectric traveling salesman problem known as a representative NP-Complete problem. The most efficient ones of them are branch and bound algorithms based on the subtour elimination approach. To increase efficiency of the branch and bound algorithm. number of decision nodes should be decreased. For this the minimum bound that is more close at the optimal solution should be found or an effective bounding strategy should be used. If the optimal solution has been known, we may apply it usefully to branching. Because a good feasible solution should be found as soon as possible and have similar features of the optimal solution. By the way, the upper bound solution in branch and bound algorithm is most close at the optimal solution. Therefore, the upper bound solution can be used instead of the optimal solution and information of which can be applied to new branching criteria. As mentioned above, this paper will propose an effective branching rule using the information of the upper bound solution in the branch and bound algorithm. And superiority of the new branching rule will be shown by comparing with Bellmore-Malone's one and carpaneto-Toth's one that were already proposed.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.4
• /
• pp.39-45
• /
• 2020

In the production process, the buffer acts as a buffer to alleviate some of the problems such as delays in delivery and process control failures in unexpected situations. Determining the optimal buffer size can contribute to system performance, such as increased output and resource utilization. However, there are difficulties in allocating the optimal buffer due to the complexity of the process or the increase in the number of variables. Therefore, the purpose of this research is proposing an optimal buffer allocation that maximizes throughput. First step is to design the production process to carry out the research. The second step is to maximize the throughput through the harmony search algorithm and to find the buffer capacity that minimizes the lead time. To verify the efficiency, comparing the ratio of the total increase in throughput to the total increase in buffer capacity.

• Structural Engineering and Mechanics
• /
• v.87 no.4
• /
• pp.305-315
• /
• 2023

The idea of the combination of the fractional-order operators with the brain emotional learning-based intelligent controller (BELBIC) is developed for implementation in seismic-excited structures equipped with active mass damper (AMD). For this purpose, a new design framework of the mentioned combination namely fractional-order BEBIC (FOBELBIC) is proposed based on a modified-teaching-learning-based optimization (MTLBO) algorithm. The seismic performance of the proposed controller is then evaluated for a 15-story building equipped with AMD subjected to two far-field and two near-field earthquakes. An optimal BELBIC based on the MTLBO algorithm is also introduced for comparison purposes. In comparison with the structure equipped with a passive tuned mass damper (TMD), an average reduction of 44.7% and 42.8% are obtained in terms of the maximum absolute and RMS top floor displacement for FOBELBIC, while these reductions are obtained as 30.4% and 30.1% for the optimal BELBIC, respectively. Similarly, the optimal FOBELBIC results in an average reduction of 42.6% and 39.4% in terms of the maximum absolute and RMS top floor acceleration, while these reductions are given as 37.9% and 30.5%, for the optimal BELBIC, respectively. Consequently, the superiority of the FOBELBIC over the BELBIC is concluded in the reduction of maximum and RMS seismic responses.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2617-2622
• /
• 2003

The pH neutralization process has long been taken as a representative benchmark problem of nonlinear chemical process control due to its nonlinearity and time-varying nature. For general nonlinear processes, it is difficult to control with a linear model-based control method so nonlinear controls must be considered. Among the numerous approaches suggested, the most rigorous approach is the dynamic optimization. However, as the size of the problem grows, the dynamic programming approach is suffered from the curse of dimensionality. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach was proposed by Bertsekas and Tsitsiklis (1996). The NDP approach is to utilize all the data collected to generate an approximation of optimal cost-to-go function which was used to find the optimal input movement in real time control. The approximation could be any type of function such as polynomials, neural networks and etc. In this study, an algorithm using NDP approach was applied to a pH neutralization process to investigate the feasibility of the NDP algorithm and to deepen the understanding of the basic characteristics of this algorithm. As the global approximator, the neural network which requires training and k-nearest neighbor method which requires querying instead of training are investigated. The global approximator requires optimal control strategy. If the optimal control strategy is not available, suboptimal control strategy can be used even though the laborious Bellman iterations are necessary. For pH neutralization process it is rather easy to devise an optimal control strategy. Thus, we used an optimal control strategy and did not perform the Bellman iteration. Also, the effects of constraints on control moves are studied. From the simulations, the NDP method outperforms the conventional PID control.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.6
• /
• pp.2698-2706
• /
• 2011

This paper deals with the optimal operation algorithm of SVR(Step Voltage Regulator) which is located with primary feeders and proposes the optimal operation system to evaluate customer voltage. The existing algorithm of SVR adapts the constant sending voltage method, which may cause the power quality problems such as overvoltage and under voltage variations in case where the distributed generations are interconnected with the primary feeders. Therefore, this paper proposes the optimal algorithm of LDC method for SVR using least square method to obtain the optimal setting values. Also, this paper presents the optimal evaluation system based on the former algorithm. The simulation results according to the types and capacities of distributed generations shows the effectiveness.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.1
• /
• pp.12-17
• /
• 2003

Optimal determination of cluster size has an effect on the result of clustering. In K-means algorithm, the difference of clustering performance is large by initial K. But the initial cluster size is determined by prior knowledge or subjectivity in most clustering process. This subjective determination may not be optimal. In this Paper, the genetic algorithm based optimal determination approach of cluster size is proposed for automatic determination of cluster size and performance upgrading of its result. The initial population based on attribution is generated for searching optimal cluster size. The fitness value is defined the inverse of dissimilarity summation. So this is converged to upgraded total performance. The mutation operation is used for local minima problem. Finally, the re-sampling of bootstrapping is used for computational time cost.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.565-569
• /
• 2007

To find optimal path is killer application in the telematics system. The shortest path of conventional system, however, isn't always optimal path. That is, the path with minimum travelling time could be defined as optimal path in the road networks. There are techniques and algorithms for finding optimal path. Hierarchical path algorithm categorizes road networks into major layer and minor layer so that the performance of operational time increases. The path searched is accurate as much as optimal path. At above 2 system, a method to allocate minor roads to major road region influences the performance extremely. This paper proposes methods to determine search space for selecting major roads in the hierarchical path algorithm. In addition, methods which apply the proposed methods to hierarchical route algorithm is presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5842-5861
• /
• 2019

A current autonomous vehicle determines its driving strategy by considering only external factors (Pedestrians, road conditions, etc.) without considering the interior condition of the vehicle. To solve the problem, this paper proposes "An Optimal Driving Support Strategy(ODSS) based on an Genetic Algorithm for Autonomous Vehicles" which determines the optimal strategy of an autonomous vehicle by analyzing not only the external factors, but also the internal factors of the vehicle(consumable conditions, RPM levels etc.). The proposed ODSS consists of 4 modules. The first module is a Data Communication Module (DCM) which converts CAN, FlexRay, and HSCAN messages of vehicles into WAVE messages and sends the converted messages to the Cloud and receives the analyzed result from the Cloud using V2X. The second module is a Data Management Module (DMM) that classifies the converted WAVE messages and stores the classified messages in a road state table, a sensor message table, and a vehicle state table. The third module is a Data Analysis Module (DAM) which learns a genetic algorithm using sensor data from vehicles stored in the cloud and determines the optimal driving strategy of an autonomous vehicle. The fourth module is a Data Visualization Module (DVM) which displays the optimal driving strategy and the current driving conditions on a vehicle monitor. This paper compared the DCM with existing vehicle gateways and the DAM with the MLP and RF neural network models to validate the ODSS. In the experiment, the DCM improved a loss rate approximately by 5%, compared with existing vehicle gateways. In addition, because the DAM improved computation time by 40% and 20% separately, compared with the MLP and RF, it determined RPM, speed, steering angle and lane changes faster than them.