• Title/Summary/Keyword: Reconfiguration Algorithm

Search Result 111, Processing Time 0.022 seconds

Sensor Fault Detection, Localization, and System Reconfiguration with a Sliding Mode Observer and Adaptive Threshold of PMSM

  • Abderrezak, Aibeche;Madjid, Kidouche
    • Journal of Power Electronics
    • /
    • v.16 no.3
    • /
    • pp.1012-1024
    • /
    • 2016
  • This study deals with an on-line software fault detection, localization, and system reconfiguration method for electrical system drives composed of three-phase AC/DC/AC converters and three-phase permanent magnet synchronous machine (PMSM) drives. Current sensor failure (outage), speed/position sensor loss (disconnection), and damaged DC-link voltage sensor are considered faults. The occurrence of these faults in PMSM drive systems degrades system performance and affects the safety, maintenance, and service continuity of the electrical system drives. The proposed method is based on the monitoring signals of "abc" currents, DC-link voltage, and rotor speed/position using a measurement chain. The listed signals are analyzed and evaluated with the generated residuals and threshold values obtained from a Sliding Mode Current-Speed-DC-link Voltage Observer (SMCSVO) to acquire an on-line fault decision. The novelty of the method is the faults diagnosis algorithm that combines the use of SMCSVO and adaptive thresholds; thus, the number of false alarms is reduced, and the reliability and robustness of the fault detection system are guaranteed. Furthermore, the proposed algorithm's performance is experimentally analyzed and tested in real time using a dSPACE DS 1104 digital signal processor board.

A Study on Improving the Efficiency of Logistics Networks in Express Package Deliveries

  • Ko, Chang-Seong;Chung, Ki-Ho;Ko, Hyun-Jeung
    • Journal of Navigation and Port Research
    • /
    • v.36 no.4
    • /
    • pp.305-311
    • /
    • 2012
  • The market competition of express package deliveries in Korea is severe because a large number of companies have entered into the market. This study thus suggests an approach to the reconfiguration of express service networks with respect to the strategy partnership of closing/keeping service centers among companies involved and the adjustments of their cutoff times. For this we propose an integer programming model and a genetic algorithm based solution procedure for allowing companies involved to maximize their incremental profit. An illustrative numerical example is presented to demonstrate the practicality and efficiency of the proposed model.

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

  • Rhee, Sang-Bong;Kim, Kyu-Ho;You, Seok-Ku
    • Proceedings of the KIEE Conference
    • /
    • 2002.07a
    • /
    • pp.121-123
    • /
    • 2002
  • In this paper, we preposed a chaos optimization method to reduce computational effort and enhance optimality of the solution in feeder reconfiguration problem. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and more easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 15 buses and 32 buses distribution systems, and the test results indicate that it is able to determine appropriate switching options for global optimum configuration with less computation.

  • PDF

A Study on Distribution System Reconfiguration using Simulated Annealing (시뮬레이티드 어닐링을 이용한 배전계통 선로 재구성에 관한 연구)

  • Jeon, Young-Jae;Choi, Seung-Kyoo;Lee, Seung-Youn;Kim, Jae-Chul
    • Proceedings of the KIEE Conference
    • /
    • 1998.07c
    • /
    • pp.1085-1087
    • /
    • 1998
  • A distribution systems loss minimum reconfiguration method by simulated annealing is proposed. The problem is a complex mixed integer programming problem and is very difficult to solve by a mathematical programming approach. Simulated annealing generates feasible solutions randomly and moves among these solutions using a strategy leading to a global minimum with high probabilities. The solution algorithm has been implemented in developed software package and tested on 32-bus system.

  • PDF

Low-Cost Fault Diagnosis Algorithm for Switch Open-Damage in BLDC Motor Drives

  • Park, Byoung-Gun;Lee, Kui-Jun;Kim, Rae-Young;Hyun, Dong-Seok
    • Journal of Power Electronics
    • /
    • v.10 no.6
    • /
    • pp.702-708
    • /
    • 2010
  • In this paper, a fault diagnosis algorithm for brushless DC (BLDC) motor drives is proposed to maintain control performance under switch open-damage. The proposed fault diagnosis algorithm consists of a simple algorithm using measured phase current information and it detects open-circuit faults based on the operating characteristic of BLDC motors. The proposed algorithm quickly recovers control performance due to its short detection time and its reconfiguration of the system topology. It can be embedded into existing BLDC drive software as a subroutine without additional sensors. The feasibility of the proposed fault diagnosis algorithm is proven by simulation and experimental results.

A Study on Voltage Stability Improvement by the Efficient Network Reconfiguration Algorithm

  • Kim, Byung-Seop;Shin, Joong-Rin;Park, Jong-Bae;Shin, Yong-Hak
    • KIEE International Transactions on Power Engineering
    • /
    • v.4A no.2
    • /
    • pp.58-68
    • /
    • 2004
  • This paper presents an optimal routing algorithm (ORA) for maximizing voltage stability as well as for minimizing power loss in radial power systems. In the proposed ORA, a novel voltage stability index (VSI) for real-time assessment is newly introduced based on the conventional critical transmission path framework. In addition, the suggested algorithm can automatically detect the critical transmission paths resulting in voltage collapse when additional real or reactive loads are added. To implement an effective ORA, we have developed an improved branch exchange (IBE) method based on a loss calculation index and tie-branch power flow equations, which are suggested for real-time applications. The proposed algorithm has been tested with IEEE test systems as well as a large-scale power system in Korea to demonstrate its effectiveness and efficiency.

Compressed Sensing-based Multiple-target Tracking Algorithm for Ad Hoc Camera Sensor Networks

  • Lu, Xu;Cheng, Lianglun;Liu, Jun;Chen, Rongjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1287-1300
    • /
    • 2018
  • Target-tracking algorithm based on ad hoc camera sensor networks (ACSNs) utilizes the distributed observation capability of nodes to achieve accurate target tracking. A compressed sensing-based multiple-target tracking algorithm (CSMTTA) for ACSNs is proposed in this work based on the study of camera node observation projection model and compressed sensing model. The proposed algorithm includes reconfiguration of observed signals and evaluation of target locations. It reconfigures observed signals by solving the convex optimization of L1-norm least and forecasts node group to evaluate a target location by the motion features of the target. Simulation results show that CSMTTA can recover the subtracted observation information accurately under the condition of sparse sampling to a high target-tracking accuracy and accomplish the distributed tracking task of multiple mobile targets.

An Adaptive Genetic Algorithm Based Optimal Feeder Routing for Distribution System Planning (적응 유전알고리즘을 이용한 배전계통 계획의 급전선 최적경로 선정)

  • Kim, Byung-Seop;Kim, Min-Soo;Shin, Joong-rin
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.2
    • /
    • pp.58-66
    • /
    • 2001
  • This paper presents an application of a newly designed Adaptive Genetic Algorithm (AGA) to solve the Optimal Feeder Routing (OFR) problem for distribution system planning. The main objective of the OFR problem usually is to minimize the total cost that is the sum of investment costs and system operation costs. We propose a properly designed AGA, in this paper, which can handle the horizon-year expansion planning problem of power distribution network in which the location of substation candidates, the location and amount of forecasted demands are given. In the proposed AGA, we applied adaptive operators using specially designed adaptive probabilities. we also a Simplified Load Flow (SLF) technique for radial networks to improve a searching efficiency of AGA. The proposed algorithm has been evaluated with the practical 32, 69 bus test system to show favorable performance. It is also shown that the proposed method for the OFR can also be used for the network reconfiguration problem in distribution system.

  • PDF

Application of Simulated Annealing and Tabu Search for Loss Minimization in Distribution Systems (베전 계통의 손실 최소화를 위한 시뮬레이티드 어닐링과 타부 탐색의 적용)

  • Jeon, Young-Jae;Kim, Jae-Chul
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.1
    • /
    • pp.28-37
    • /
    • 2001
  • This paper presents an efficient algorithm for the loss minimization of distribution system by automatic sectionalizing switch operation in large scale distribution systems. Simulated annealing is particularly well suited for large combinational optimization problem, but the use of this algorithm is also responsible for an excessive computation time requirement. Tabu search attempts to determine a better solution in the manner of a greatest-descent algorithm, but it can not give any guarantee for the convergence property. The hybrid algorithm of two methods with two tabu lists and the proposed perturbation mechanism is applied to improve the computation time and convergence property Numerical examples demonstrate the validity and effectiveness of the proposed methodology using a KEPCO's distribution system.

  • PDF

Emergency Service Restoration Algorithm Considering Service Rank in Distribution System (서비스우선순위를 고려한 긴급정전복구 앨고리즘)

  • Song, Kil-Yeong;So, Min-He;Jeong, Min-Hwa;NamKung, Jae-yong
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.800-803
    • /
    • 1996
  • This paper proposes the algorithm to solve emergency service restoration problems using efficient reconfiguration method in distribution system. In this algorithm, we try to avoid the blackout of important loads by considering service rank. It is possible to reconfigurate the system by using fuzzy inference results in which was reflected the expected distribution power, line capacity and service rank. A 27-bus, 32-branch model system is used to demonstrate the effectiveness of the proposed algorithm.

  • PDF