• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.511-517
• /
• 2015

Determination of the required reserve capacity has an important function in operation of power system and it is calculated based on the largest loss of supply. However, conventional method cannot be applied in future power system, because potential grid-connected distributed generator and abnormal temperature cause the large load imbalance. Therefore this paper address new framework for determining the optimal required reserve capacity taking into account the real time load imbalance. At first, we introduce the way of operating reserve resources which are the secondary, tertiary, Direct Load Control (DLC) and Load shedding reserves to make up the load imbalance. Then, the formulated problem can be solved by the Probabilistic Dynamic Programming (PDP) method. In case study, we divide two cases for comparing the cost function between the conventional method and the proposed method.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2003.05c
• /
• pp.194-199
• /
• 2003

Depth error correction effect for maladjusted stereo cameras with calibrated pixel distance parameter is presented. The proposed neural network technique is the real time computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objects during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of objects. All of them request much memory space and time. Therefore the most reliable neural-network algorithm is derived for real-time matching of objects, which is composed of a dynamic programming algorithm based on sequence matching techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3538-3556
• /
• 2014

This paper proposes a novel video stitching method that improves real-time performance and visual quality of a multi-camera video surveillance system. A two-stage seam searching algorithm based on enhanced dynamic programming is proposed. It can obtain satisfactory result and achieve better real-time performance than traditional seam-searching methods. The experiments show that the computing time is reduced by 66.4% using the proposed algorithm compared with enhanced dynamic programming, while the seam-searching accuracy is maintained. A real-time local update scheme reduces the deformation effect caused by moving objects passing through the seam, and a seam-based local color transfer model is constructed and applied to achieve smooth transition in the overlapped area, and overcome the traditional pixel blending methods. The effectiveness of the proposed method is proved in the experiements.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.29 no.12
• /
• pp.638-644
• /
• 2017

Optimal cooling operation algorithm was developed based on a simulation case of a single family house model equipped with renewable energy facility. EnergyPlus simulation results were used as virtual test data. The model contained three energy storage elements: thermal heat capacity of the living room, chilled water storage tank, and battery. Their charging and discharging schedules were optimized so that daily electricity bill became minimal. As an optimization tool, linear programming was considered because it was possible to obtain results in real time. For its adoption, EnergyPlus-based house model had to be linearly approximated. Results of this study revealed that dynamic cooling load of the living room could be approximated by a linear RC model. Scheduling based on the linear programming was then compared to that by a nonlinear optimization algorithm which was made using GenOpt developed by a national lab in USA. They showed quite similar performances. Therefore, linear programming can be a practical solution to optimal operation scheduling if linear dynamic models are tuned to simulate their real equivalents with reasonable accuracy.

• Journal of Navigation and Port Research
• /
• v.30 no.9
• /
• pp.773-777
• /
• 2006

Significant increase of container flows in the marine terminals requires more efficient port equipments such as logistic and transfer systems. This paper presents collision avoidance and routing approach based on dynamic programming (DP) algorithm for a linear motor based shuttle car which is considered as a new transfer system in the port terminals. Most of routing problems are focused on automatic guided vehicle (AGV) systems, but its solutions are hardly utilized for LM based shuttle cars since both are mechanically different. Our proposed DP is implemented for real-time searching of an optimal path for each shuttle car in the Agile port terminal located at California in USA.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.315-324
• /
• 2000

This paper presents an efficient dynamic programming(DP) method, so called EDPAS (Efficient Dynamic Programming Algorithm for Signal), for optimally controlling traffic signal in real-time mode at a single intersection. The objective of EDPAS is to minimize total vehicle delay. It applies reaching method to solve forward DP functional equation, which does not need any priori knowledge on the states of DP network. Two acceleration techniques within reaching method are the main feature of EDPAS. They are devised to eliminate inferior DP states by comparing between states and maintaining incumbent value, resulting in a great amount of computational efficiency. An example is shown to verify the advantage of EDPAS.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.10
• /
• pp.582-590
• /
• 2000

A fast optimal path planning algorithm using the analog Cellular Nonlinear Circuits(CNC) is proposed. The analog circuits based optimal path planning is very useful since most of the optimal path planning problems require real time computation. There has already been a previous study to implement the dynamic programming with analog circuits. However, it could not be applied for the practically large size of problems since the algorithm employs the mechanism of reducing its input current/voltage by the amount of cost, which causes outputs of distant cells to become zero. In this study, a subgoal-based dynamic programming algorithm to compute the optimal path is proposed. In the algorithm, the optimal paths are computed regardless of the distance between the starting and the goal points. It finds subgoals starting from the starting point when the output of the starting cell is raised from its initial value. The subgoal is set as the next initial position to find the next subgoal until the final goal is reached. The global optimality of the proposed algorithm is discussed and two different kinds of simulations have been done for the proposed algorithm.

• Journal of Korean Society for Quality Management
• /
• v.14 no.1
• /
• pp.61-66
• /
• 1986

Many papers have suggested various models how to decide an optimal time for replacing equipment. In this study, Dynamic Programming is applied to establish a model of replacing equipment and a new algorithm is developed for computerization to meet the increased number of variables. It is possible to predict the real situation with higher accuracy by employing the proposed model including more variables such as planning horizon, original cost, salvage value, decreasing rate, operating and maintenance costs, increasing rate, and so on.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.738-747
• /
• 1999

본 논문에서는 분산 실시간 시스템의 특징인 분산 처리 과정의 신뢰성을 지원하기 위한 동적 트랜잭션 처리 구조를 연구하였다. 실시간 분산 처리 환경에서 동적으로 발생하는 실시간 분산 트랜잭션 처리를 위하여 트랜잭션 내에 필수적인 3가지 언어적 특성들을 제시하였다. 첫째는 트랜잭션 내에 실시간 시스템의 가장 중요한 특징인 시간적인 제약 조건들을 정의 할 수 있는 방안을 제시하고, 둘째는 비동기적인 처리 성격을 지닌 실시간 특성을 고려한 비동기적 트랜잭션 처리 방법을 제시한다. 또한, 분산 처리 과정에서 발생되는 예외 사항들을 처리하기 위하여 긴급성을 고려한 다중레벨 우선순위 스케줄링 (Multi-Level Priotiry Scheduling)이라 부르는 트랜잭션 스케줄링 방안을 제시한다. 그리고, 제시한 실시간 분산 트랜잭션 처리 구조의 타당성 및 가능성을 입증하기 위한 실시간 트랜잭션 처리 과정을 시물레이션을 통하여 제시한 언어적 특성에 대한 고려 사항들을 보여준다.Abstract We propose a dynamic transaction processing model that supports a reliability for distributed real-time processing. For the dynamic processing in distributed real-time transaction systems, we suggest three features that are defined in programming language. First, we propose a specification model to explicitly define the time constraints, needs in real-time distributed processing. Second, we describe an asynchronous transaction processing mechanism based on the real-time characteristics. So, we suggest three communication primitives to support asynchronous transaction processing. Lastly, a scheduling policy based on urgent transaction is suggested to manage the exception occurred during the distributed processing. This scheduling policy is called multi-level priotiry scheduling (MPLS). Based on three features and scheduling policy, we describe a direction to manage a dynamic transaction processing in distributed real-time systems.

• The Journal of Engineering Research
• /
• v.2 no.1
• /
• pp.73-82
• /
• 1997

In this paper, we examine design trends in the development of distributed real-time system. Many real-time systems developed over the last ten years share common characteristics including use of communications, imprecise computations, the object-oriented paradigm, multiprocessor node hardware, dynamic time-driven scheduling and the inclusion of fault tolerance mechanisms. By examining the major design decisions made in previous systems, the best attributes of these systems can be coalesced together to form the "ideal" real-time system. This paper examines such a system and the advantages and disadvantages of the design decisions involved.