• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 추계학술대회 논문집 전력기술부문
• /
• 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.

• 전기학회논문지
• /
• 제58권9호
• /
• pp.1667-1673
• /
• 2009

This paper presents a application of new algorithm for feeder reconfiguration problem in distribution systems. Harmony Search (HS) algorithm, which is motivated from the musical performance, is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off the sectionalizing and the tie-line switches. In optimization processing, the HS algorithm has searching ability for the global optimal solution, simple coding of the iteration procedure, and fast convergence to get the solution. The HS algorithm is tested on 15 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate switching options without the occurrence of any misdetermination in switching and get the minimum power loss.

• Journal of Electrical Engineering and Technology
• /
• 제7권4호
• /
• pp.486-492
• /
• 2012

This paper presents a novel objective function for distribution system reconfiguration for reliability enhancement. When islanding operations of distributed generators is prohibited, faults in the feeder interrupt the operation of distributed generators. For this reason, we include the customer interruption cost as well as the distributed generator interruption cost in the objective function in the network reconfiguration algorithm. The network reconfiguration in which genetic algorithms are used is implemented by MATLAB. The effect of the proposed objective function in the network reconfiguration is analyzed and compared with existing objective functions through case studies. The network reconfiguration considering the proposed objective function is suitable for a distribution system that has a high penetration of distributed generators.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권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.

• 한국멀티미디어학회논문지
• /
• 제11권9호
• /
• pp.1277-1285
• /
• 2008

본 논문에서는 WiMAX 와 HSDPA 모드를 모두 지원하는 SCA 기반 다중모드 SDR 단말의 컴포넌트를 설계하고 블럭도를 제시하였으며, 실제 실험을 통한 경량화 대상 분석을 통해 SDR 단말 구현 시 어느 구성요소를 경량화해야 하는 지 분석해 보았다. 또한, 컴포넌트 재구성 분석을 통하여 동적 재구성 전체 시간 측정을 위한 일반 식을 도출하였고, 분석 결과를 토대로 SCA 규격의 인터페이스와 수행절차를 위배하지 않는 범위 안에서 총 22단계에 걸친 컴포넌트 레벨 동적 재구성 알고리즘을 설계하였다.

• 한국정보과학회논문지:정보통신
• /
• 제30권1호
• /
• pp.1-8
• /
• 2003

본 논문에서는 광 인터넷의 가상 토폴로지 재구성을 효과적으로 관리하는 정책을 제시한다. 기존의 휴리스틱 기법의 근사 문제를 해결하기 위해 트래픽 예측 기반 다단계 재구성 알고리즘을 바탕으로 트래픽 패턴과 망 혼잡 정도의 변화에 따라 적응적인 토폴로지 재구성 기법을 제시한다. 이 알고리즘은 네트워크의 상태를 고려하여 적정 재구성 시기를 결정함으로써 가상망의 관리를 단순화한다. 시뮬레이션 결과, 제안된 가상망 관리 정책이 물리적인 자원 사용이 제한될 때 기존의 방법에 비해 좋은 성능을 보인다.

• Journal of Astronomy and Space Sciences
• /
• 제30권1호
• /
• pp.11-15
• /
• 2013

A collision-free formation reconfiguration trajectory subject to the linearized Hill's dynamics of relative motion is analytically developed by extending an algorithm for gravity-free space. Based on the initial solution without collision avoidance constraints, the final solution to minimize the designated performance index and avoid collision is found, based on a gradient method. Simple simulations confirm that satellites reconfigure their positions along the safe trajectories, while trying to spend minimum energies. The algorithm is applicable to wide range of formation flying under the Hill's dynamics.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 추계학술대회 논문집 전력기술부문
• /
• pp.330-332
• /
• 2001

Distribution systems is consist of network in physical and radial in electrical aspect. Therefore radial operation is realized by changing the status of sectionalizing switches, and is usually done for loss reduction in the system. In this paper, we propose a optimal method for distribution systems reconfiguration. Specifically we use genetic algorithm method to solve distribution systems reconfiguration for loss minimization problem. A genetic algorithm(GA) is set up, in which some improvements are made on string coding, fitness function and mutation pattern. As a result, premature convergence is avoided.

• International Journal of Control, Automation, and Systems
• /
• 제6권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.

• 전기전자학회논문지
• /
• 제17권4호
• /
• pp.418-427
• /
• 2013

본 논문에서는 H.264/AVC 비디오 코덱용 디블록킹 필터의 병렬 알고리즘을 제안한다. 디블록킹 필터는 BS(boundary strength)에 따라 다른 필터 연산을 수행하며, 각 필터 연산은 다양한 조건 연산을 필요로 한다. 또한 각 경계면의 연산 순서가 정해져 있기 때문에 병렬 처리가 쉽지 않다. 본 논문에서 제안하는 디블록킹 필터 알고리즘은 최근에 소개된 1-D CGRA (coarse grained reconfigurable architecture)인 PRAGRAM (pipelined reconfigurable arrays with assistant manager groups)에서 처리된다. 디블록킹 필터 연산은 PRAGRAM의 단방향 파이프라인 PE 배열 구조를 이용하여 각 필터 연산을 고속으로 수행하고, dynamic reconfiguration 및 conditional reconfiguration을 이용하여 필터 선택과 조건 연산을 효율적으로 처리한다. 디블록킹 필터의 병렬 알고리즘은 매크로블록 당 225 사이클을 소요한다. 이는 동작주파수 150 MHz에서 full HD급 영상을 처리할 수 있는 성능이다.