• Journal of Power Electronics
• /
• v.16 no.6
• /
• pp.2315-2326
• /
• 2016

This paper discusses the elimination of DC voltage deviation and the enhancement of load current sharing accuracy in multi-terminal high voltage direct current (MT-HVDC) systems. In order to minimize the power line losses in different parallel network topologies and to insure the stable operation of systems, a decentralized control method based on a modified droop control is presented in this paper. Averaging the DC output voltage and averaging the output current of two neighboring converters are employed to reduce the congestion of the communication network in a control system, and the decentralized control method is implemented. By minimizing the power loss of the cable, the optimal load current sharing proportion is derived in order to achieve rational current sharing among different converters. The validity of the proposed method using a low bandwidth communication (LBC) network for different topologies is verified. The influence of the parameters of the power cable on the control system stability is analyzed in detail. Finally, transient response simulations and experiments are performed to demonstrate the feasibility of the proposed control strategy for a MT-HVDC system.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.1
• /
• pp.10-18
• /
• 2007

In this paper, we address the node positioning method for minimizing the overlap sensing areas in wireless sensor networks with adjustable sensing ranges. To find a optimal node position, we derive a optimal equations by using the overlapped areas, each node's radiuses and expended angles of opposite neighboring nodes. Based on it, we devise a new node positioning method, called as ASRC(Adjustable Sensing Ranges Control). Unlike existing condition based model, our proposed method is derived from mathematical formula, and we confirm its validity through various simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.131.4-131
• /
• 2001

A lot of path planning algorithms have been developed to find the collision-free path with minimum cost. But most of them require complicated computations. In this paper, a thinning method, which is one of the image processing schemes, was adopted to simplify the path planning procedure. In addition, critical points are used to find the shortest-distance path among all possible paths from the start to the goal point. Since the critical points contain the information on the neighboring paths, a new path can be quickly obtained on the map even when the start and goal points change. To investigate the validity of the proposed algorithm, various simulations have been performed for the environment where the obstacles with arbitrary shapes exist. It is shown that the optimal paths can be found with relative easiness.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.4
• /
• pp.328-338
• /
• 2006

A new evolutionary computation technique, called particle swarm optimization(PSO), has been proposed and introduced recently. PSO has been inspired by the social behavior of flocking organisms, such as swarms of birds and fish schools and PSO is an algorithm that follows a collaborative population-based search model. Each particle of swarm flies around in a multidimensional search space looking for the optimal solution. Then, Particles adjust their position according to their own and their neighboring-particles experience. In this paper, characteristics of PSO such as mentioned are reviewed and compared with GA which is based on the evolutionary mechanism in natural selection. Also dimensionalities of PSO and GA are compared throughout numeric experimental studies. The comparative studies demonstrate that PSO is characterized as simple in concept, easy to implement, and computationally efficient and can generate a high-quality solution and stable convergence characteristic than GA.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 1999.12a
• /
• pp.21-25
• /
• 1999

Planning support systems(PSS) add more advanced spatial analysis functions than Geographic information systems(GIS) and intertemporal functions to the functions of spatial decision support systems(SDSS). This paper reports the continuing development of a PSS providing a framework that facilitates urban planners and civil engineers in conducting coherent deliberations about planning, design and operation & maintenance(O&M) of water-distribution networks for urban growth management. The PSS using dynamic optimization model, modeling-to-generate-alternatives, value engineering(VE) and life-cycle cost(LCC) can generate network alternatives in consideration of initial cost and O&H cost. Users can define alternatives by the direct manipulation of networks or by the manipulation of parameters in the models. The water-distribution network analysis model evaluates the performance of the user-defined alternatives. The PSS can be extended to include the functions of generating sewer network alternatives, combining water-distribution and sewer networks, eventually the function of planning, design and O&H of housing sites. Capacity expansion by the dynamic water-distribution network optimization model using MINLP includes three advantages over capacity expansion using optimal control theory(Kim and Hopkins 1996): 1) finds expansion alternatives including future capacity expansion times, sizes, locations, and pipe types of a water-distribution network provided, 2) has the capabilities to do the capacity expansion of each link spatially and intertemporally, and 3) requires less interaction between models. The modeling using MINLP is limited in addressing the relationship between cost, price, and demand, which the optimal control approach can consider. Strictly speaking, the construction and O&M costs of water-distribution networks influence the price charged for the served water, which in turn influence the. This limitation can be justified in rather small area because price per unit water in the area must be same as that of neighboring area, i.e., the price is determined administratively. Planners and engineers can put emphasis on capacity expansion without consideration of the relationship between cost, price, and demand.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1243-1258
• /
• 2017

A new medical materials scheduling system and its modeling method for the complex rescue are presented. Different from other similar system, first both the BeiDou Satellite Communication System (BSCS) and the Special Fiber-optic Communication Network (SFCN) are used to collect the rescue requirements and the location information of disaster areas. Then all these messages will be displayed in a special medical software terminal. After that the bipartite graph models are utilized to compute the optimal scheduling of medical materials. Finally, all these results will be transmitted back by the BSCS and the SFCN again to implement a fast guidance of medical rescue. The sole drug scheduling issue, the multiple drugs scheduling issue, and the backup-scheme selection issue are all utilized: the Kuhn-Munkres algorithm is used to realize the optimal matching of sole drug scheduling issue, the spectral clustering-based method is employed to calculate the optimal distribution of multiple drugs scheduling issue, and the similarity metric of neighboring matrix is utilized to realize the estimation of backup-scheme selection issue of medical materials. Many simulation analysis experiments and applications have proved the correctness of proposed technique and system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1125-1134
• /
• 2013

Small cells such as pico or femto cells are promising as a solution to cope with higher traffic explosion and the large number of users. However, the users within small cells are likely to suffer severe inter-cell interference (ICI) from neighboring base stations (BSs). To tackle this, several papers suggest BS transmit power on/off control algorithms which increase edge user throughput. However, these algorithms require centralized coordinator and have high computational complexity. This paper makes a contribution towards presenting fully distributed and low complex joint BS on/off control and user scheduling algorithm (FDA) by selecting on/off pattern of BSs. Throughput the extensive simulations, we verify the performance of our algorithm as follows: (i) Our FDA provides better throughput performance of cell edge users by 170% than the algorithm without the ICI management. (ii) Our FDA catches up with the performance of optimal algorithm by 88-96% in geometric average throughput and sufficiently small gap in edge user throughput.

• Proceedings of the KIEE Conference
• /
• 2004.11b
• /
• pp.190-193
• /
• 2004

Optimal Power Flow (OPF) is becoming more and more important in the deregulation environment of power pool and there is an urgent need of faster solution technique for on-line application. So this paper presents parallel genetic algorithm-tap search for the solution of the OPF. The control variables modeled unit active power outputs, generator-bus voltage magnitudes and transformer-tap settings. A number of functional operating constraints, such as branch flow limits, load bus boltage magnitude limits and generator reactive capabilities are included as penalties in the fitness function. In parallel GA-TS, GA operators are executed for each process. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper three populations to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the usefulness of the proposed method, developed algorithm has been tested and compared on an IEEE 30-bus system in the reference paper. From the simulation results, we can find that the proposed algorithm is efficient for the OPF.

• Journal of Korean Society of Transportation
• /
• v.20 no.6
• /
• pp.31-43
• /
• 2002

Traffic signal control methods are suggested to improve the operational effectiveness of COSMOS system in Seoul. First. a method that improves progression of the corridor traffic flow within a common sub-area was explored. Applying this method, both frequency and magnitude of offset transition were reduced as compared to the existing method. In addition, the level of connection among neighboring corridors increased by applying the method, thus the qualify of progression was also improved. Second, a practical guideline on signal phase design was proposed to improve the efficiency of actuated operations for the left-turn movement. Last, a method for estimating optimal queue length parameters was surveyed and evaluated. An evaluation study was performed for the suggested methods through both field and simulation studies. Results showed that the proposed methods gave better performance than the existing methods. It is expected that the use of proposed methods can improve operational performance of COSMOS.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.94-104
• /
• 2000

The accuracy and reliability of the target tracking is very critical issue in the design of automotive collision warning radar A significant problem in multi-target tracking (MTT) is the target-to-measurement data association If an incorrect measurement is associated with a target, the target could diverge the track and be prematurely terminated or cause other targets to also diverge the track. Most methods for target-to-measurement data association tend to coalesce neighboring targets Therefore, many algorithms have been developed to solve this data association problem. In this paper, a new multi-target data association method based on order statistics is described The new approaches. called the order statistics probabilistic data association (OSPDA) and the order statistics joint probabilistic data association (OSJPDA), are formulated using the association probabilities of the probabilistic data association (PDA) and the joint probabilistic data association (JPDA) filters, respectively Using the decision logic. an optimal or near optimal target-to-measurement data association is made A computer simulation of the proposed method in a heavy cluttered condition is given, including a comparison With the nearest-neighbor CNN). the PDA, and the JPDA filters, Simulation results show that the performances of the OSPDA filter and the OSJPDA filter are superior to those of the PDA filter and the JPDA filter in terms of tracking accuracy about 18% and 19%, respectively In addition, the proposed method is implemented using a developed digital signal processing (DSP) board which can be interfaced with the engine control unit (ECU) of car engine and with the d?xer through the controller area network (CAN)