• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.11 no.4
• /
• pp.91-102
• /
• 1991

Traditionally, a dynamic programming(DP) technique has been used to the multireservoir control system. The algorithm has inherent problem to increase computational requirements exponentially due to discretization of variables and expanding the dimension of the system. To solve this problem, this paper describes transforming the optimal control system into a quadratic programming(QP), using Laguerre polynomials(LP) and its properties. The objective function of the proposed QP is independent of time variable. The solution of the QP is obtained by nonlinear programming(NLP) using augmented Lagrangian multiplier method. The numerical experiment shows that the water level of reservoirs is higher than Lee's and the evaluated benefit value is about the same as other researcher's.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.05b
• /
• pp.1430-1434
• /
• 2005

금강 유역과 같이 복잡한 하천유역 시스템의 관리를 위해서는 시스템 요소들을 통합적으로 분석할 수 있는 효과적인 의사결정지원 도구가 필요하다. K-MODSIM 모형은 단기 물관리, 장기 운영계획, 가뭄 대비계획 및 물관련 분쟁 해결을 위해 보다 개선된 유역관리 전략을 수립하기 위한 컴퓨터 기반 도구로 개발되었으며, 본 연구에서는 K-MODSIM 모형에 저수지 운영률을 반영하여 유역의 용수배분을 평가하였다. 유역 저수지군 운영 환경 및 제약조건을 반영한 네트워크를 구성한 후, 두 단계의 모형 검정을 수행하였다. 먼저 물리적 검정을 통해서 전체 대상 수계의 상하류 물수지를 검토하고, 다음 단계인 운영 측면의 검정에서 물리적으로 나타나는 상황이 댐 운영이나 제약 조건 등에 부합하는지의 여부를 검토하였다. 대청댐과 용담댐의 통합 운영을 위한 최적 운영률의 개발은 동적계획법 소프트웨어인 CSUDP를 이용하여 수행하였으며, 여기서 사유한 접근법은 음해 추계학적 동적계획법이다. 이 접근방법은 유입량 시계열을 추계학적으로 모의발생시키고, CSUDP 모형은 모의발생시킨 유입량 시계열에 대한 최적운영률을 찾기 위해 사용하며, CSUDP의 최적화 결과에 대한 통계적인 분석을 통해 월단위 운영률을 도출하였다. K-MODSIM 모형에 저수지 운영률을 반영하여 유역의 용수배분을 평가하였다. 유역 저수지군 운영 환경 및 제약조건을 반영한 네트워크를 구성하고, 대청댐과 용담댐의 통합 운영을 위한 최적연계 운영를을 개발하여 다음과 같은 운영 시나리오들을 개발하고 평가하였다. $\cdot$ 금강수계에 대한 용당댐의 영향 평가 $\cdot$ 댐 연계운영시 수요량 변화에 따른 영향 평가 $\cdot$ 하도추적을 고려한 일별모형의 검증 개발된 운영률과 하도추적방법을 K-MODSIM 모형에서 검증하기 위해서 vb.net 스크립트 파일을 개발하여 적용하였다.L이하로 이를 유등천 상류부에 공급할 경우 유등천의 수질은 BOD 6.7mg/L, TN 9.80mg/L, TP 0.90mg/L를 나타낼 것으로 예측된다. 고도처리시설의 도입 후 금강 합류점에서 갑천의 예측 BOD는 7.4mg/L로 현재 9.0mg/L에 비하여 개선되지만 이는 금강수계 오염총량 관리계획의 시$\cdot$도 경계지점 목표수질인 5.9mg/L를 만족시키지 못하므로, 이를 만족시키기 위해서는 방류수 BOD 7.2mg/L이하로 처리해야 할 것으로 판단된다.which support only concepts or image features.방하는 것이 선계기준에 적합한 것으로 나타났다. 밸브 개폐에 따른 수압 변화를 모의한 결과 밸브 개폐도를 적절히 유지하여 필요수량의 확보 및 누수방지대책에 활용할 수 있을 것으로 판단된다.8R(mm)(r^2=0.84)$로 지수적으로 증가하는 경향을 나타내었다. 유거수량은 토성별로 양토를 1.0으로 기준할 때 사양토가 0.86으로 가장 작았고, 식양토 1.09, 식토 1.15로 평가되어 침투수에 비해 토성별 차이가 크게 나타났다. 이는 토성이 세립질일 수록 유거수의 저항이 작기 때문으로 생각된다. 경사에 따라서는 경사도가 증가할수록 증가하였으며 $10\% 경사일 때를 기준으로 $Ro(mm)=Ro_{10}{\times}0.797{\times}e^{-0.021s(\%)}$로 나타났다.천성 승모판 폐쇄 부전등을 초래하는 심각한 선천성 심질환이다. 그러나 진단 즉시 직접 좌관상동맥-대동맥 이식술로 수술적 교정을 해줌으로써 좋은 성적을 기대할 수 있음을 보여주었다.특히 교사들이 중요하게 인식하는 해방적 행동에 대한 목표를 강조하여 적용할 필요가 있음을 시사하고 있다.교하여 유의한 차이가 관찰되지 않았다. 또한 HSP 환자군에서도 $IL1RN^{*}2$ allele 빈도와

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3182-3194
• /
• 2000

It is strongly beliefed that Video on Demand(VOD) will become one of the most promising services in Broadband Integrated Services Digital Network(B-ISDN) for the nest generation VOD service can be classified into two types of services 'Near VOD(NVOD) and Interactive VOD(IVOD). For both services, some video servers should be installed at some nodes(especially, at the root node for NVOD service) in the tree structued VOD network,so that each node with video server stores video programs and distribules stored programs to customers. We consider thre kinds of cost.a program transmission cost, a program storage cost, and a video server installation cost. There exists a trade-off relationship among those three costs according to locationsl of video servers and the kinds of programs stord at each video server. Given a tree structured VOD network, and the total number of programs being served in the network, the resource allocation problem in a VOD network providing both IVOD and NVOD services is to determine where to install video servers for IVOD service, which and how many programs should be stored at each video server for both IVOD and NVOD services, so as to minunize the total cost which is the sum of three costs for both IVOD and NVOD services. In this paper we develop an efficient cynamic programming algorithm for solving the problem. We also implement the algorithm based on a service policy assumed in this paper.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.396-401
• /
• 2004

Recently a framework for the cognition-based navigational planning of a mobile robot on dynamic environment has been proposed, and simulation results applied it to the static environment been presented [1]. In this paper, we propose a linguistic map-based framework for the navigational planning of mobile robots, which is applicable to the dynamic environment including not only static obstacles but also dynamic obstacles such as temporal-spatio obstacles, by extending Lee et al. 's framework, and provide computer simulation results obtained by applying to a mobile robot on the dynamic environment in order to show the validity of the proposed algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.8
• /
• pp.67-74
• /
• 2020

One of the missions of active-duty units in charge of managing reserve forces is providing combat supplies to reserve forces to exercise their combat capabilities quickly when declaring a mobilization order. Rear area active-duty units must support large local reserve forces. On the other hand, military units have difficulties due to a lack of forces and the storage of large quantities of firearms and ammunition. For this reason, local reserve forces should move to an integrated storing place and receive their firearms and ammunition. The existing distribution plan (existing plan) is a first-in-first-out plan that can produce inconsistent distribution orders. The inconsistent distribution orders can increase the complete distribution time, which will affect the combat power of local reserve forces. Therefore, firearms and ammunition should be distributed quickly. Accordingly, this paper proposes the priority selection of firearms and ammunition for local reserve forces with a minimum complete distribution time using Dynamic Programming. To verify the proposed model, the existing plan was compared with the proposed model using real data, and the result showed that the proposed model outperformed the existing plan.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.3 no.4
• /
• pp.3-15
• /
• 2001

Generally, it has been noted that underground structures have a consistent record of suffering much less damage than surface facilities during earthquakes; but it is still necessary to illustrate the dynamic response of tunnel structures subject to earthquake loadings and to provide the appropriate method for the seismic analysis of underground tunnel structures since many types of underground structures have been and will be constructed in countries situated within seismic zones. In this study, first, seismic analyses for underground tunnel structures are performed by using quasistatic analysis method and dynamic analysis method. Second, seismic analyses in tunnel portals are performed by using above methods. The results of seismic analyses for the tunnel structure show that the tunnel structure conforms to ground deformation and that seismic design by using the quasi-static analysis method is more conservative than that by using the dynamic analysis. The results of the dynamic FEM analysis for the tunnel structure show that the simplified 2-D FEM analysis using a sine wave rather than the 3-D FEM analysis can be adopted for seismic analysis. Finally, the results of the dynamic FEM analysis in tunnel portals show that the force acting on the lining is largest near to the tunnel portal when an earthquake wave propagates parallel to tunnel axis.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.34
• /
• pp.129-137
• /
• 1995

Recently the recognition of Logistics becomes important to enterprises as a means for improving their competition, but the Korea enterpries falls for far behind in management techniques for analyzing realities and problems in the logistic compare to the advanced countries. In describing a distribution network, we have stated that it is basically a system or a set of locations that ship, receive or store material plus the routes that connect these locations. Using a Dynamic Programming on logistics, we can decrease the inventory level and increase the service level on logistics and the management performance.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.47-61
• /
• 2007

In SCM (supply chain management), companies are pursuing a new approach through which overall functions within the supply chain, ranging from material purchase to production, distribution, and sales are designed, planned, and managed in an integrated way. The core functions among them are production planning and distribution planning. As these problems are mutually related, they should be dealt with simultaneously in an integrated manner. SCM is large-scale and multi-stage problems. Also, its various kinds of internal or external factors can, at any time, dynamically bring a change to the existing plan or situation. Recently, many enterprises are moving toward an open architecture for integrating their activities with their suppliers, customers and other partners within the supply chain. Agent-based technology provides an effective approach in such environments. Multi-agent systems have been proven suitable to represent domains such as supply chain networks which involve interactions among manufacturing organization, their customers, suppliers, etc. with different individual goals and propriety information. In this paper, we propose a multi-agent system based on the genetic algorithm that make it possible to integrate the production and distribution planning on a real-time basis in SCM. The proposed genetic algorithm produced near optimal solution and we checked that there is a great difference in the results between integrated planning and non-integrated planning.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2790-2792
• /
• 2005

This paper proposes a path-planning algorithm that enables a robot to reach the goal position while avoiding obstacles. The proposed method, which is based on dynamic programming, finds an optimum path to follow using a modified skeleton map method which exploits information on obstacle positions. Simulation results show the feasibility of the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.310-310
• /
• 2000

The main problem in stereo vision is to find corresponding points in left and right image known as correspondence problem. Once correspondences determined, the depth information of those points are easily computed form the pairs of points in both image. In this paper, dynamic programming considering half-occluded region is used fer solving correspondence problem.