• Title/Summary/Keyword: reconfiguration problems

Search Result 53, Processing Time 0.023 seconds

A Unit-Cell Varying Pattern Reconfigurable Zeroth-order Resonance Antenna

  • Hyeon-Cheol Ki
    • International journal of advanced smart convergence
    • /
    • v.13 no.2
    • /
    • pp.1-6
    • /
    • 2024
  • Reconfiguration and miniaturization of antennas have become key attributes in modern wireless communication systems. Reconfiguration of radiation pattern can alleviate the problems encountered in modern wireless communication systems such as multi-path problems. Physical limitation of miniaturization also can be overcome by using a zeroth-order resonance (ZOR) antenna based on metamaterial. In order to achieve reconfiguration and miniaturization of antennas at the same time, we propose a new pattern reconfigurable zeroth-order resonance (ZOR) antenna that reconfigures the radiation patterns by varying the position and the number of unit cells comprising the antenna. The antenna is fabricated in an equilateral triangular shaped symmetrical structure to increase pattern variety. This structure can easily provide eight different radiation patterns (two omnidirectional and six monopole like patterns).

Reconfiguration Problems in VLSI and WSI Cellular Arrays (초대규모 집적 또는 웨이퍼 규모 집적을 이용한 셀룰러 병렬 처리기의 재구현)

  • 한재일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.10
    • /
    • pp.1553-1571
    • /
    • 1993
  • A significant amount of research has focused on the development of highly parallel architectures to obtain far more computational power than conventional computer systems. These architectures usually comprise of a large number of processors communicating through an interconnection network. The VLSI (Very Large Scale Integration) and WSI (Wafer Scale Integration) cellular arrays form one important class of those parallel architectures, and consist of a large number of simple processing cells, all on a single chip or wafer, each interconnected only to its neighbors. This paper studies three fundamental issues in these arrays : fault-tolerant reconfiguration. functional reconfiguration, and their integration. The paper examines conventional techniques, and gives an in-depth discussion about fault-tolerant reconfiguration and functional reconfiguration, presenting testing control strategy, configuration control strategy, steps required f4r each reconfiguration, and other relevant topics. The issue of integrating fault tolerant reconfiguration and functional reconfiguration has been addressed only recently. To tackle that problem, the paper identifies the relation between fault tolerant reconfiguration and functional reconfiguration, and discusses appropriate testing and configuration control strategy for integrated reconfiguration on VLSI and WSI cellular arrays.

  • PDF

A service Restoration and Optimal Reconfiguration of Distribution Network Using Genetic Algorithm and Tabu Search (유전 알고리즘과 Tabu Search를 이용한 배전계통 사고복구 및 최적 재구성)

  • Cho, Chul-Hee;Shin, Dong-Joon;Kim, Jin-O
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.2
    • /
    • pp.76-82
    • /
    • 2001
  • This paper presents a approach for a service restoration and optimal reconfiguration of distribution network using Genetic algorithm(GA) and Tabu search(TS) method. Restoration and reconfiguration problems in distribution network are difficult to solve in short times, because distribution network supplies power for customers combined with many tie-line switches and sectionalizing switches. Furthermore, the solutions of these problems have to satisfy radial operation conditions and reliability indices. To overcome these time consuming and sub-optimal problem characteristics, this paper applied Genetic-Tabu algorithm. The Genetic-Tabu algorithm is a Tabu search combined with Genetic algorithm to complement the weak points of each algorithm. The case studies with 7 bus distribution network showed that not the loss reduction but also the reliability cost should be considered to achieve the economic service restoration and reconfiguration in the distribution network. The results of suggested Genetic-Tabu algorithm and simple Genetic algorithm are compared in the case study also.

  • PDF

Feeder Reconfiguration Using Binary Coding Particle Swarm Optimization

  • Wu, Wu-Chang;Tsai, Men-Shen
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.4
    • /
    • pp.488-494
    • /
    • 2008
  • This paper proposes an effective approach based on binary coding Particle Swarm Optimization (PSO) to identify the switching operation plan for feeder reconfiguration. The proposed method considers the advantages and disadvantages of existing particle swarm optimization method and redefined the operators of PSO algorithm to fit the application field of distribution systems. Shift operator is proposed to construct the binary coding particle swarm optimization for feeder reconfiguration. A typical distribution system of Taiwan Power Company is used in this paper to demonstrate the effectiveness of the proposed method. The test results show that the proposed method can apply to feeder reconfiguration problems more effectively and stably than existing method.

Application Optimal Reconfiguration Algorithm for Distribution Power System to KEPCO System (배전계통 최적 재구성 알고리즘의 실계통 적용)

  • Seo, Gyu-Seok;Baek, Yaung-Sik;Chae, Woo-Gyu
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.10
    • /
    • pp.1681-1687
    • /
    • 2008
  • This paper shows application of optimal reconfiguration algorithm for distributing power system to KEPCO system for loss minimization and load balancing. That is, it suggests additional algorithm to check potential problems caused in case of theoretical algorithm being applied to real system and recover from them. Also, comparing the results of reconfiguration algorithm Tabu-Search Algorithm applied to current KEPCO distribution power system and those of Branch Exchange Algorithm using initial operation point suggested in this paper, it shows how much the results are improved in aspects of load balancing, loss reduction and calculating time.

Chaotic Search Algorithm for Network Reconfiguration in Distribution Systems (배전계통 최적구성을 위한 카오스 탐색법 응용)

  • 이상봉;유석구
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.6
    • /
    • pp.325-332
    • /
    • 2003
  • The loss minimization is one of the most important problems to save the operational cost in distribution systems. This paper presents an efficient method for optimal feeder reconfiguration of distribution systems. Chaos search algorithm (CSA) is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off sectionalizing switches. In optimization problem, the CSA searches the global optimal solution on the basis of regularity in chaotic motions and easily escapes from local or near optimal solution. The CSA is tested on 15 buses and 32 buses distribution systems, and the results indicate that it is able to determine appropriate switching options for global optimum reconfiguration.

Performance Analysis of Generating Function Approach for Optimal Reconfiguration of Formation Flying

  • Lee, Kwangwon;Park, Chandeok;Park, Sang-Young
    • Journal of Astronomy and Space Sciences
    • /
    • v.30 no.1
    • /
    • pp.17-24
    • /
    • 2013
  • The use of generating functions for solving optimal rendezvous problems has an advantage in the sense that it does not require one to guess and iterate the initial costate. This paper presents how to apply generating functions to analyze spacecraft optimal reconfiguration between projected circular orbits. The series-based solution obtained by using generating functions demonstrates excellent convergence and approximation to the nonlinear reference solution obtained from a numerical shooting method. These favorable properties are expected to hold for analyzing optimal formation reconfiguration under perturbations and non-circular reference orbits.

The Optimal Distribution Feeder Reconfiguration Using Knowledge Base (지식베이스를 이용한 배전계통의 최적재구성)

  • Cho, S.H.;Choi, B.Y.;Kim, S.H.;Lee, J.K.
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.99-101
    • /
    • 1993
  • This paper presents an approach to feeder reconfiguration in order to achieve an efficient operation of distribution systems utilizing knowledge base. The optimal feeder reconfiguration in this study eliminates various abnormal states which will create feeder overloads and feeder constraint problems. and will also accomplish minimum power loss of the distribution systems under normal operating condition by means of branch exchanges to change the status of sectionalizing switches with experiences of the experts. For an effective implementation of feeder reconfiguration, a best-first tree searching strategy based on heuristics is employed to evaluate the various alternatives of load transfer. The heuristic exchange of branches results in reduction of the search space as a means of implementing the best-first searching strategy.

  • PDF

Reconfiguration of PV Module Considering the Shadow Influence of Photovoltaic System (태양광 발전시스템의 그림자 영향을 고려한 PV 모듈의 재구성)

  • Ko, Jae-Sub;Chung, Dong-Hwa
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.27 no.2
    • /
    • pp.36-44
    • /
    • 2013
  • This paper proposes the reconfiguration of PV module considering shadow influence of photovoltaic system. The PV system is consisted series-parallel connection of PV module. The voltage and current between PV modules become unbalance when shadow occurs to PV module. If shadow occurs to the series connection PV module, the output current is limited to current of shaded PV module. Also if shadow occurs to the parallel connection PV module, the output voltage is limited to voltage of shaded PV module. These problems are caused power loss. Therefore, the PV module in this paper consist using the fixed module and variable module by shaded conditions. The reconfiguration of PV module can compensates the shadow influence by changing connection of a variable module when shadow is occurred to PV module. A validity of the reconfiguration of PV module proposed in this paper proves through comparing with performance of conventional PV module.

Application Optimal Reconfiguration Algorithm for Distribution Power System to KEPCO System (배전계통 최적 재구성 알고리즘의 실계통 적용)

  • Seo, Gyu-Seok;Baek, Young-Sik;Kim, Jung-Nyun;Chae, Woo-Gyu
    • Proceedings of the KIEE Conference
    • /
    • 2008.11a
    • /
    • pp.125-127
    • /
    • 2008
  • This paper shows application of optimal reconfiguration algorithm for distributing power system to KEPCO(Korea Electric Power Corporation) system for loss minimization and load balancing. That is, it suggests additional algorithm to check potential problems caused in case of theoretical algorithm being applied to real system and recover from them. Also, comparing the results of reconfiguration algorithm Tabu-Search Algorithm applied to current KEPCO distribution power system and those of Branch Exchange Algorithm using initial operation point suggested in this paper, it shows how much the results are improved in aspects of load balancing, loss reduction and calculating time.

  • PDF