• Title/Summary/Keyword: Unified algorithm

Search Result 262, Processing Time 0.033 seconds

A Study on Power Flow Control of UPFC by Series and Shunt Voltage Source Model (직.병렬전압원 모델에 의한 UPFC 전력조류제어에 관한 연구)

  • 정인학;김경신;정재길
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.15 no.2
    • /
    • pp.21-30
    • /
    • 2001
  • In this paper, in the power system having UPFC(Unified Power Flow Controller) Power flow of certain line is controlled to desired value also power flow analysis algorithm is reposed considering power flow constraints which is capable of analysis power flow of all system. This algorithm is applied to controlling line-overloading problems and the method of is prosed. By applying this algorithm to controlling line-over loading the method of controlling UPFC is proposed and the effectiveness of controlling UPFC is proposed and the effectiveness of controlling UPFC is verified through the research of practical system. Also, the equation to set up an initial value of stories and shunt voltage source of UPFC is proposed for the effective power analysis.

  • PDF

Modelling and Performance Analysis of UPQC with Digital Kalman Control Algorithm under Unbalanced Distorted Source Voltage conditions

  • Kumar, Venkateshv;Ramachandran, Rajeswari
    • Journal of Power Electronics
    • /
    • v.18 no.6
    • /
    • pp.1830-1843
    • /
    • 2018
  • In this paper, the generation of a reference current and voltage signal based on a Kalman filter is offered for a 3-phase 4wire UPQC (Unified Power Quality Conditioner). The performance of the UPQC is improved with source voltages that are distorted due to harmonic components. Despite harmonic and frequency variations, the Kalman filter is capable enough to determine the amplitude and the phase angle of load currents and source voltages. The calculation of the first state is sufficient to identify the fundamental components of the current, voltage and angle. Therefore, the Kalman state estimator is fast and simple. A Kalman based control strategy is proposed and implemented for a UPQC in a distribution system. The performance of the proposed control strategy is assessed for all possible source conditions with varying nonlinear and linear loads. The functioning of the proposed control algorithm with a UPQC is scrutinized and validated through simulations employing MATLAB/Simulink software. Using a FPGA SPATRAN 3A DSP board, the proposed algorithm is developed and implemented. A small-scale laboratory prototype is built to verify the simulation results. The stated control scheme for the UPQC reduces the following issues, voltage sags, voltage swells, harmonic distortions (voltage and current), unbalanced supply voltage and unbalanced power factor under dynamic and steady-state operating conditions.

Function Optimization Using Quadratically Convergent Algorithms With One Dimensional Search Schemes

  • Kim, Do-Il
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.14 no.2
    • /
    • pp.25-40
    • /
    • 1988
  • In this paper, a unified method to construct a quadratically convergent algorithm with one dimensional search schemes is described. With this method, a generalized algorithm is derived. As it's particular cases, three quadratically convergent algorithms are performed. They are the rank-one algorithm (Algorithm I), projection algorithm (Algorithm II) and the Fletcher-Reeves algorithm (Algorithm III). As one-dimensional search schemes, the golden-ratio method and dichotomous search are used. Additionally, their computer programming is developed for actual application. The use of this program is provided with the explanation of how to use it, the illustrative examples that are both quadratic and nonquadratic problems and their output. Finally, from the computer output, each algorithm was analyzed from the standpoint of efficiency for performance.

  • PDF

Performance Enhancement of an Obstacle Avoidance Algorithm using a Network Delay Compensationfor a Network-based Autonomous Mobile Robot (네트워크 기반 자율이동 로봇을 위한 시간지연 보상을 통한 장애물 회피 알고리즘의 성능 개선)

  • Kim, Joo-Min;Kim, Jin-Woo;Kim, Dae-Won
    • Proceedings of the KIEE Conference
    • /
    • 2011.07a
    • /
    • pp.1898-1899
    • /
    • 2011
  • In this paper, we propose an obstacle avoidance algorithm for a network-based autonomous mobile robot. The obstacle avoidance algorithm is based on the VFH (Vector Field Histogram) algorithm and delay-compensative methods with the VFH algorithm are proposed for the network-based robot that is a unified system composed of distributed environmental sensors, mobile actuators, and the VFH controller. Firstly, the compensated readings of the sensors are used for building the polar histogram of the VFH algorithm. Secondly, a sensory fusion using the Kalman filter is proposed for the localization of the robot to compensate both the delay of the readings of an odometry sensor and the delay of the readings of the environmental sensors. The performance enhancements of the proposed obstacle avoidance algorithm from the viewpoint of efficient path generation and accurate goal positioning are also shown in this paper through some simulation experiments by the Marilou Robotics Studio Simulator.

  • PDF

Data communication network design algorithm with minimum cost (최소비용을 갖는 데이터통신망 설계 알고리즘)

  • 장경훈;백원석;김동춘;김경연;김경식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.11
    • /
    • pp.2810-2816
    • /
    • 1996
  • In this paper, the problem of obtaining topoloty for mesh network given the link costs and traffic requirements between all pairs of nodes is considered. The proposed DCN algorithm can be applied to the mesh network in a unified manner. Among the cost conditions, the triangle intequality of the MENTOR algorithm is removed in the proposed algorithm. The computational complexity of the algorithm is order N$^{3}$, where N is the number of nodes in the network. The performances of proposed algorithm are better than those of the MENTOR algorithm in the case of the cost and the reliability of network.

  • PDF

Transmission Power Control using FACTS Device (FCATS Device를 이용한 송전전력 제어)

  • Park, Seung-Ho;Kim, Young-Jo;Kim, Young-Seok
    • Proceedings of the KIEE Conference
    • /
    • 2006.10d
    • /
    • pp.152-154
    • /
    • 2006
  • This paper presents an electric power control scheme in the transmission line using a UPFC(Unified Power Flow Controller). From the practical application viewpoint, the simultaneous realization of the power response desired. The author propose a new power control algorithm for UPFC. To verify the effectiveness of the proposed algorithm, a protype inverter is built and some experiments are carried out.

  • PDF

Analysis of the LMS Algorithm Family for Uncorelated Gaussian Data

  • Nam, Seung-Hyon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.15 no.3E
    • /
    • pp.19-26
    • /
    • 1996
  • In this paper, convergence properties of the LMS, LMF, and LVCMS algorithms are investigated under the assumption of the uncorrelated Gaussian input data. By treating these algorithms as special cases of more general algorithm family, unified results on these algorithms are obtained. First the upper bound on the step size parameter is obtained. Second, an expression for misadjustment is obtained. These theoretical results confirm earlier LMS works. Further, the results explain why the LMS and LVCMS algorithms are experiencing difficulties with plant noise having heavier tailed densities. Simulation results agree with theoretical expectation closely for various plant noise statistics.

  • PDF

Designing an Object-Oriented Framework for the Variants of Simulated Annealing Algorithm (Simulated Annealing Algorithm의 변형을 지원하기 위한 객체지향 프레임워크 설계)

  • Jeong, Yeong-Il;Yu, Je-Seok;Jeon, Jin;Kim, Chang-Uk
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.409-412
    • /
    • 2004
  • Today, meta-heuristic algorithms have been much attention by researcher because they have the power of solving combinational optimization problems efficiently. As the result, many variants of a meta-heuristic algorithm (e.g., simulated annealing) have been proposed for specific application domains. However, there are few efforts to classify them into a unified software framework, which is believed to provide the users with the reusability of the software, thereby significantly reducing the development time of algorithms. In this paper, we present an object-oriented framework to be used as a general tool for efficiently developing variants of simulated annealing algorithm. The interface classes in the framework achieve the modulization of the algorithm, and the users are allowed to specialize some of the classes appropriate for solving their problems. The core of the framework is Algorithm Configuration Pattern (ACP) which facilitates creating user-specific variants flexibly. Finally, we summarize our experiences and discuss future research topics.

  • PDF

ModifiedFAST: A New Optimal Feature Subset Selection Algorithm

  • Nagpal, Arpita;Gaur, Deepti
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.2
    • /
    • pp.113-122
    • /
    • 2015
  • Feature subset selection is as a pre-processing step in learning algorithms. In this paper, we propose an efficient algorithm, ModifiedFAST, for feature subset selection. This algorithm is suitable for text datasets, and uses the concept of information gain to remove irrelevant and redundant features. A new optimal value of the threshold for symmetric uncertainty, used to identify relevant features, is found. The thresholds used by previous feature selection algorithms such as FAST, Relief, and CFS were not optimal. It has been proven that the threshold value greatly affects the percentage of selected features and the classification accuracy. A new performance unified metric that combines accuracy and the number of features selected has been proposed and applied in the proposed algorithm. It was experimentally shown that the percentage of selected features obtained by the proposed algorithm was lower than that obtained using existing algorithms in most of the datasets. The effectiveness of our algorithm on the optimal threshold was statistically validated with other algorithms.

ComputationalAalgorithm for the MINQUE and its Dispersion Matrix

  • Huh, Moon Y.
    • Journal of the Korean Statistical Society
    • /
    • v.10
    • /
    • pp.91-96
    • /
    • 1981
  • The development of Minimum Norm Quadratic Unbiased Estimation (MINQUE) has introduced a unified approach for the estimation of variance components in general linear models. The computational problem has been studied by Liu and Senturia (1977) and Goodnight (1978, setting a-priori values to 0). This paper further simplifies the computation and gives efficient and compact computational algorithm for the MINQUE and dispersion matrix in general linear random model.

  • PDF