• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.229-232
• /
• 2001

Recently, several promising multiobjective evolutionary algorithms, e,g, SPEA, NSGA-ll, PESA, and SPEA2, have been developed. In this paper, we also propose a new multiobjective evolutionary algorithm that compares to them. In the algorithm proposed in this paper, we introduce a novel concept, "inherited age" and total algorithm is executed based on the inherited age concept. Also, we propose a new sharing algorithm, called objective classication sharing algorithm(OCSA) that can preserve the diversity of the population. We will show the superior performance of the proposed algorithm by comparing the proposed algorithm with other promising algorithms for the test functions.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.608-619
• /
• 2018

As distributed generation (DG) is connected to grid, there is new node-type occurring in distribution network. An efficient algorithm is proposed in this paper to calculate power flow for weakly meshed distribution network with DGs in different load models. The algorithm respectively establishes mathematical models focusing on the wind power, photovoltaic cell, fuel cell, and gas turbine, wherein the different DGs are respectively equivalent to PQ, PI, PQ (V) and PV node-type. When dealing with PV node, the algorithm adopts reactive power compensation device to correct power, and the reactive power allocation principle is proposed to determine reactive power initial value to improve convergence of the algorithm. In addition, when dealing with the weakly meshed network, the proposed algorithm, which builds path matrix based on loop-analysis and establishes incident matrix of node voltage and injection current, possesses good convergence and strong ability to process the loops. The simulation results in IEEE33 and PG&G69 node distribution networks show that with increase of the number of loops, the algorithm's iteration times will decrease, and its convergence performance is stronger. Clearly, it can be effectively used to solve the problem of power flow calculation for weakly meshed distribution network containing different DGs.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.911-918
• /
• 2002

An important issue in the design of future Personal Communication Service (PCS) networks is the efficient management of location information. In this paper, we propose an adaptive distributed dynamic location management algorithm that stores the position of the mobile terminal in k of the n location information databases (LIDs). The proposed algorithm chooses adaptively k. replication factor according to both the space locality of LIDs in wireless mobile networks and the location query popularity to local mobile terminal from remote mobile terminals. The performance of proposed algorithm is evaluated by both an analytical model and a simulation. Based on the results of performance evaluation, we know that the performance of the proposed algorithm is better than that of Krishnamurthi's algorithm regardless of call-mobility ratio.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.5
• /
• pp.651-659
• /
• 2008

Autoreclosing techniques have been used in power systems to maintain system stability and continuity of supply. Environmental and economical issues have driven significant increases in the development of distributed generation (DG). DG connected to distribution systems, however, may impose negative influences with respect to power quality, protection, and stability, because DG can cause some challenges to protection, especially to reclosing. For this reason, in order to improve the reliability and safety of the distribution system, the rules and guidelines suggest that the DG system needs to be rapidly disconnected from the system before reclosing. We present, in this paper, an adaptive reclosing algorithm considering the DG. The algorithm consists of an angle oscillation's judgment, the emergency extended equal-area criterion (EEEAC), the calculation of an optimal reclosing time, and a reconnection algorithm. Our simulation results for three different DG technologies with Electromagnetic Transient Program (EMTP) indicate that we can maintain transient stability while the DG is protected against disturbances.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.215-220
• /
• 2014

We consider quantization optimized for distributed estimation, where a set of sensors at different sites collect measurements on the parameter of interest, quantize them, and transmit the quantized data to a fusion node, which then estimates the parameter. Here, we propose an iterative quantizer design algorithm with a weighted distance rule that allows us to reduce a system-wide metric such as the estimation error by constructing quantization partitions with their optimal weights. We show that the search for the weights, the most expensive computational step in the algorithm, can be conducted in a sequential manner without deviating from convergence, leading to a significant reduction in design complexity. Our experments demonstrate that the proposed algorithm achieves improved performance over traditional quantizer designs. The benefit of the proposed technique is further illustrated by the experiments providing similar estimation performance with much lower complexity as compared to the recently published novel algorithms.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.59-64
• /
• 2002

In the sender-initiated load balancing algorithms, the sender continues to send an unnecessary request message fur load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver-initiated load balancing algorithms, the receiver continues to send an unnecessary request message for load acquisition until a sender is found while the system load is light. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, in this paper, we propose a genetic algorithm based approach fur improved sender-initiated and receiver-initiated load balancing. The proposed algorithm is used for new adaptive load balancing approach. Compared with the conventional sender-initiated and receiver-initiated load balancing algorithms, the proposed algorithm decreases the response time and increases the acceptance rate.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.3
• /
• pp.57-64
• /
• 2019

We consider the D2D sum utility maximization in the cellular system. D2D links reuse the uplink resource of cellular system. This reuse may cause severe interference to cellular users. To protect the cellular users, interference limit from the D2D links is required. In this setting, D2D sum utility maximization problem is investigated. Each D2D link has limited transmit power budget. Because optimum solution may require global information between links and computational complexity, we propose the distributed algorithm which only require the local information from each D2D link and simple broadcasting. Simulation results are provided to verify the performance of the proposed algorithm.

• Journal of information and communication convergence engineering
• /
• v.17 no.3
• /
• pp.167-173
• /
• 2019

This study investigates the problem of leader-following consensus for multi-agent systems with output saturations. This study assumes that the agents are described as a neutrally stable system, and the leader agent generates the bounded trajectory within the saturation level. Then, the objective of the leader-following consensus is to track the trajectory of the leader by exchanging information with neighbors. To solve this problem, we propose an observer-based distributed consensus algorithm. Then, we provide a consensus analysis by applying the Lyapunov stability theorem and LaSalle's invariance principle. The result shows that the agents achieve the leader-following consensus in a global sense. Moreover, we can achieve the consensus by choosing any positive control gain. Finally, we perform a numerical simulation to demonstrate the validity of the proposed algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.7
• /
• pp.624-628
• /
• 2008

This paper is concerned with multiple motor control using a distributed network control method. Speed and position of multiple motors are synchronized using clock synchronized distributed controllers. CAN (controller area network) is used and a new clock synchronization algorithm is proposed and implemented. To verify the proposed control algorithm, two disks which are attached on two motor shafts are controlled to rotate at the same speed and phase angle with the same time base using network clocks.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.11
• /
• pp.1794-1803
• /
• 1989

This paper presents and evaluates a distributed routing algorithm for effective routing control in circuit-switched multistage interconnection networks. The proposed method uses the distributed control based on the incividual-switching element control and it is very effective for allowing any broadcast connection from a source to arbitrary number of destinadtions. The performnace of the proposed method is analyzed and evaluated by computer simulation in terms of the normalized average time delays.