• Title/Summary/Keyword: Computation burden

Search Result 136, Processing Time 0.031 seconds

Service Restorative System in Emergency State using Object-Oriented Structure (객체구조를 이용한 긴급상태 정전복부 시스템)

  • Kim, Jeong-Nyeon;Baek, Yeong-Sik
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.49 no.1
    • /
    • pp.1-5
    • /
    • 2000
  • This paper presents a new algorithm to restore the de-energized loads in electric power distribution systems for restoration by utilizing object-based structure and heuristic rules without branch and feeder overloading. In order to cope with a complex network configuration and frequent breaker switching operations in distribution systems, the component of power system is described as objects and the information of system configuration is constructed by connecting objects each other. Such a strategy is developed mainly based on the object search algorithm to increase computation efficiency. As a result, the proposed system has been implemented to efficiently deal with large distribution systems by reducing computational burden remarkably compared with the conventional methods.

  • PDF

NEW EXACT SOLUTIONS OF SOME NONLINEAR EVOLUTION EQUATIONS BY SUB-ODE METHOD

  • Lee, Youho;An, Jeong Hyang
    • Honam Mathematical Journal
    • /
    • v.35 no.4
    • /
    • pp.683-699
    • /
    • 2013
  • In this paper, an improved ($\frac{G^{\prime}}{G}$)-expansion method is proposed for obtaining travelling wave solutions of nonlinear evolution equations. The proposed technique called ($\frac{F}{G}$)-expansion method is more powerful than the method ($\frac{G^{\prime}}{G}$)-expansion method. The efficiency of the method is demonstrated on a variety of nonlinear partial differential equations such as KdV equation, mKd equation and Boussinesq equations. As a result, more travelling wave solutions are obtained including not only all the known solutions but also the computation burden is greatly decreased compared with the existing method. The travelling wave solutions are expressed by the hyperbolic functions and the trigonometric functions. The result reveals that the proposed method is simple and effective, and can be used for many other nonlinear evolutions equations arising in mathematical physics.

De-correlated Compression Filter Based on Time-Propagated Measurement Fusion

  • Lee, Hyung-Keun;Lee, Jang-Gyu;Jee, Gyu-In;Park, Chan-Gook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.76.2-76
    • /
    • 2001
  • In this paper, a new fusion architecture consisting of a host filter and a do-correlated compression filter is proposed based on propagated measurement fusion. In the proposed architecture, the host filter estimates the system states in long-term sense based on the measurements from the beginning to the current time. The de-correlated compression filter assists the host filter by providing fusion results in short-term sense based on the measurements within a block of time. The proposed de-correlated compression filter alleviates computational burden of the host filter by reducing the maximum amount of instantaneous computation, and provides an efficient environment for real-time fault detection and estimation.

  • PDF

Optimal time control of multiple robot using hopfield neural network (홉필드 신경회로망을 이용한 다중 로보트의 최적 시간 제어)

  • 최영길;이홍기;전홍태
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • pp.147-151
    • /
    • 1991
  • In this paper a time-optimal path planning scheme for the multiple robot manipulators will be proposed by using hopfield neural network. The time-optimal path planning, which can allow multiple robot system to perform the demanded tasks with a minimum execution time and collision avoidance, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computational burden and thus limits the on-line application. One way to avoid such a difficulty is to rearrange the problem as MTSP(Multiple Travelling Salesmen Problem) and then apply the Hopfield network technique, which can allow the parallel computation, to the minimum time problem. This paper proposes an approach for solving the time-optimal path planning of the multiple robots by using Hopfield neural network. The effectiveness of the proposed method is demonstrated by computer simulation.

  • PDF

A Study on Efficient Generation of Beam-Mass Model for Simplification of the Crankshaft in the Large Marine Engine (대형 선박엔진용 크랭크축 해석을 위한 보-질량 모델 생성 기법에 관한 연구)

  • Suh, Myung-Won;Shim, Mun-Bo;Kim, Ki-Hyun;Kim, Kyu-Hee
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.10
    • /
    • pp.1661-1666
    • /
    • 2003
  • The purpose of this study is to develop the simplified model of the crankshaft in the large marine engine for dynamic analysis. Because the actual engine system is under complex dynamic loading condition and it has multi-cylinder, the dynamic analysis is purchased at a high computation cost. In spite of this burden, the dynamic analysis must be perfonned to assure structural integrity of operating marine engine. Therefore, simplification of the analytic model is necessary for dynamic analysis. Beam-mass model, which is generated with the section property method, is the model simplified effectively. Section property method can provide desired section information by optimization technique. By applying beam-mass model to the crankshaft in the large marine engine, the usefulness of the proposed method was proven.

Planning a minimum time path for robot manipulator using genetic algorithm (유전알고리즘을 이용한 로보트 매니퓰레이터의 최적 시간 경로 계획)

  • Kim, Yong-Hoo;Kang, Hoon;Jeon, Hong-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.698-702
    • /
    • 1992
  • In this paper, Micro-Genetic algorithms(.mu.-GAs) is proposed on a minimum-time path planning for robot manipulator, which is a kind of optimization algorithm. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computation burden and can't often find the optimal values. One way to overcome such difficulties is to apply the Micro-Genetic Algorithms, which can allow to find the optimal values, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Micro-Genetic Algorithms. The effectiveness of the proposed method is demonstrated using the 2 d.o.f plannar Robot manipulator.

  • PDF

Implementation of Real Time System for Personal Identification Algorithm Utilizing Hand Vein Pattern (정맥패턴을 이용한 개인식별 알고리즘의 고속 하드웨어 구현)

  • 홍동욱;임상균;최환수
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.560-563
    • /
    • 1999
  • In this paper, we present an optimal hardware implementation for preprocessing of a person identification algorithm utilizing vein pattern of dorsal surface of hand. For the vein pattern recognition, the computational burden of the algorithm lies mainly in the preprocessing of the input images, especially in lowpass filtering. we could reduce the identification time to one tenth by hardware design of the lowpass filter compared to sequential computations. In terms of the computation accuracy, the simulation results show that the CSD code provided an optimized coefficient value with about 91.62% accuracy in comparison with the floating point implementation of current coefficient value of the lowpass filter. The post-simulation of a VHDL model has been performed by using the ModelSim$^{TM}$. The implemented chip operates at 20MHz and has the operational speed of 55.107㎳.㎳.

  • PDF

Specialized VLSI System Design for the Generalized Hough Transform (일반화된 Hough 변환을 위한 특수 목적 VLSI 시스템 설계에 관한 연구)

  • 채옥삼;이정헌
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.3
    • /
    • pp.66-76
    • /
    • 1995
  • In this research, a mesh connected VLSI structure is proposed for the real time computation of the generalized Hough transform(GHT). The purpose of the research is to design a generalized Hough transformer that can be realized as a single chip processor. The GHT has been modified to yield a highly parallel structure consisting of simple processing elements(PEs) and communication networks. In the proposed structure, the GHT can be computed by first assigning an image pixel to a PE and performing shift and add operations. The result of the CAD circuit simulation shows that it can be computed in the time proportional to the number of pixels in the pattern. In addition to the Hough transformer, the peak detector has been designed to reduce 1)the number of the I/O operations between the transformer and the host computer and 2) the host computer's burden for peak detection by transmitting only the local peaks detected from the transformed accumulator. It is expected that the proposed single chip Hough transformer with peak detector makes a fast and inexpensive edge based object recognition systems possible for many industrial and military applications.

  • PDF

Planning a Minimum Time Path for Multi-task Robot Manipulator using Micro-Genetic Algorithm (다작업 로보트 매니퓰레이터의 최적 시간 경로 계획을 위한 미소유전알고리즘의 적용)

  • 김용호;심귀보;조현찬;전홍태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.4
    • /
    • pp.40-47
    • /
    • 1994
  • In this paper, Micro-Genetic algorithms($\mu$-GAs) is proposed on a minimum-time path planning for robot manipulator. which is a kind of optimization algorithm. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computation burden and can`t often find the optimaul values. One way to overcome such difficulties is to apply the Micro-Genetic Algorithms, which can allow to find the optimul values, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Micro-Genetic Algorithms. The effectiveness of the proposed method is demonstrated using the 2 d.o.f plannar Robot manipulator.

  • PDF

A Comparison Study of Real-Time Solution to All- Attitude Angles of an Aircraft

  • Shin Sung-Sik;Lee Jung-Hoon;Yoon Sug-Joon
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.3
    • /
    • pp.376-381
    • /
    • 2006
  • In this paper, the quaternion, the dual Euler, and the direction cosine methods are numerically compared using a non-aerodynamic 6 degree-of-freedom rigid model at all-attitude angles of an aircraft. The dual Euler method turns out to be superior to the others in the applications because it shows better numerical accuracy, stability, and robustness in integration step sizes. The dual Euler method is affordably less efficient than the quaternion method in terms of computational cost. Numerical accuracy and stability, which allow larger integration step sizes, are more critical in modern real-time applications than computational efficiency because of today's increased computational power. If the quaternion method is required because of constraints in computation time, then a suppression mechanism should be provided for algebraic constraint errors which will eventually add computational burden.