• International Journal of Naval Architecture and Ocean Engineering
• /
• 제11권1호
• /
• pp.154-164
• /
• 2019

A rotor dynamic analysis is mandatory for stability and design optimization of submerged propellers and turbines. An accurate simulation requires a proper consideration of fluid-induced reaction forces. This paper presents a bi-directional coupling of a bond graph method solver and an unsteady vortex lattice method solver where the former is used to model the rotor dynamics of the power train and the latter is used to predict transient hydrodynamic forces. Due to solver coupling, determination of hydrodynamic coefficients is obsolete and added mass effects are considered automatically. Additionally, power grid and structural faults like grid fluctuations, eccentricity or failure could be investigated using the same model. In this research work a fast, time resolved dynamic simulation of the complete power train is conducted. As an example, the rotor dynamics of a tidal stream turbine is investigated under two inflow conditions: I - shear flow, II - shear flow + water waves.

• 한국시뮬레이션학회논문지
• /
• 제14권3호
• /
• pp.21-31
• /
• 2005

In state-of-the-art games, characters can move in a goal-directed manner so that they can move to the goal position without colliding obstacles. Many path-finding methods have been proposed and implemented for these characters and most of them use the A* search algorithm. When .the map is represented with a regular grid of squares or a navigation mesh, it often takes a long time for the A* to search the state space because the number of cells used In the grid or the mesh increases for higher resolution. Moreover the A* search on the grid often causes a zigzag effect, which is not optimal and realistic. In this paper we propose to use visibility graphs to improve the search time by reducing the search space and to find the optimal path. We also propose a method of taking into account the size of moving characters in the phase of planning to prevent them from colliding with obstacles as they move. Simulation results show that the proposed method performs better than the grid-based A* algorithm in terms of the search time and space and that the resulting paths are more realistic.

• 전자공학회논문지CI
• /
• 제47권4호
• /
• pp.71-81
• /
• 2010

그리드 시스템에서 리스트 스케줄링 기반의 알고리즘을 사용한 태스크 스케줄링은 프로세서의 완전 연결된 환경에서 낮은 시간 복잡도와 높은 효율성을 보여준다. 하지만 기존 알고리즘은 태스크 간의 통신비용 및 옵티컬 그리드 환경에서 통신이 이루어지는 경로인 lightpath의 구성 과정을 충분히 고려하지 않았다. 본 논문에서는 옵티컬 그리드 환경에 최적화 된 방향성 비순환 그래프(Directed Acyclic Graph, DAG)를 계층화하여 태스크의 할당 우선순위를 결정하는 계층화 선택 알고리즘인 LSOG(Leveling Selection in Optical Grid)을 제안한다. 이 알고리즘은 동일한 계층 내 태스크들의 할당 우선순위를 결정할 때 부모 태스크와 통신비용이 가장 큰 태스크를 먼저 수행한 뒤 각각의 네트워크에서 태스크 간의 통신이 이루어지는 가장 짧은 길이의 경로를 고려한다. 이 과정은 옵티컬 그리드 환경에서 링크 리소스 사용을 최적화하여 스케줄링 과정의 통신비용을 개선시킨다. 기존의 알고리즘 중 ELSA (Extended List Scheduling Algorithm)와 SCP (Scheduled Critical Path) 알고리즘을 LSOG 와 비교한 결과 CCR 값의 증가와 네트워크 환경이 원활함에 따라 전체 스케줄링 성능이 향상되는 것을 확인하였다.

• 한국농공학회논문집
• /
• 제57권2호
• /
• pp.15-26
• /
• 2015

The purpose of this paper is to develop a software tool, PGA-CC (Projection of hydrology via Grid-based Assessment for Climate Change) to evaluate the present hydrologic cycle and the future watershed hydrology by climate change. PGA-CC is composed of grid-based input data pre-processing module, hydrologic cycle calculation module, output analysis module, and output data post-processing module. The grid-based hydrological model was coded by Fortran and compiled using Compaq Fortran 6.6c, and the Graphic User Interface was developed by using Visual C#. Other most elements viz. Table and Graph, and GIS functions were implemented by MapWindow. The applicability of PGA-CC was tested by assessing the future hydrology of South Korea by HadCM3 SRES B1 and A2 climate change scenarios. For the whole country, the tool successfully assessed the future hydrological components including input data and evapotranspiration, soil moisture, surface runoff, lateral flow, base flow etc. From the spatial outputs, we could understand the hydrological changes both seasonally and regionally.

• 한국항공우주학회지
• /
• 제31권10호
• /
• pp.1-9
• /
• 2003

컴퓨팅 그리드 환경에서는 컴퓨팅 그리드 시스템을 구성하는 단위 시스템들의 성능이 균일하지 않기 때문에, 영역을 균등하게 분할하는 일반적인 로드밸런싱 기법을 적용하기가 적절하지 않다. 본 연구에서는 그래프 분할기법을 기반으로 하여, 컴퓨팅 그리드 시스템을 구성하는 단위 시스템들의 성능가중치를 계산하여 분할하는 2단계 영역 분할 기법을 제시하였다. 2단계 영역 분할 기법 시 발생하는 통신량의 증가는 그래프 분할기법인 WEVM을 적용하여 최소화 할 수 있었으며, 멀티 클러스터 환경과 WAN에서 타당성과 효율성을 검증해 보았다.

• 로봇학회논문지
• /
• 제9권2호
• /
• pp.104-110
• /
• 2014

Mapping is a fundamental element for robotic services. There are available many types of map data representation such as grid map, metric map, topology map, etc. As more robots are deployed for services, more chances of exchanging map data among the robots emerge and standardization of map data representation (MDR) becomes more valuable. Currently, activities in developing MDR standard are underway in IEEE Robotics and Automation Society. The MDR standard is for a common representation and encoding of the two-dimensional map data used for navigation by mobile robots. The standard focuses on interchange of map data among components and systems, particularly those that may be supplied by different vendors. This paper aims to introduce MDR standard and its application to map merging. We have applied the basic structure of the MDR standard to a grid map and Voronoi graph as a kind of topology map and performed map merging between two different maps. Simulation results show that the proposed MDR is suitable for map data exchange among robots.

• Journal of Electrical Engineering and Technology
• /
• 제10권5호
• /
• pp.2135-2141
• /
• 2015

Power line communication (PLC) is one of the major communication technologies in smart grid since it combines good communication capability with easy and simple deployment. As a power network can be modeled as a graph, we propose a vertex coloring based slot reuse scheduling in the time division multiple access (TDMA) period for PLCs. Our objective is to minimize the number of assigned time slots, while satisfying the quality of service (QoS) requirement of each station. Since the scheduling problem is NP-hard, we propose an efficient heuristic scheduling, which consists of repeated vertex coloring and slot reuse improvement algorithms. The simulation results confirm that the proposed algorithm significantly reduces the total number of time slots.

• 로봇학회논문지
• /
• 제8권4호
• /
• pp.256-265
• /
• 2013

A local map-based exploration algorithm for mobile robots is presented. Segmented frontiers and their relative transformations constitute a tree structure. By the proposed efficient frontier segmentation and a local map management method, a robot can reduce the unknown area and update the local grid map which is assigned to each frontier node. Although this local map-based exploration method uses only local maps and their adjacent node information, mapping completion and efficiency can be greatly improved by merging and updating the frontier nodes. Also, we suggest appropriate graph search exploration methods for corridor and hall environments. The simulation demonstrates that the entire environment can be represented by well-distributed frontier nodes.

• International Journal of Contents
• /
• 제6권3호
• /
• pp.19-24
• /
• 2010

Task scheduling is an integrated component of computing with the emergence of grid computing. In this paper, we address two different task scheduling models, which are static Round-Robin (RR) and dynamic Fastest Site First (FSF) task scheduling method, using extended timed marked graphs, which is a special case of Stochastic Petri Nets (SPN). Stochastic reward nets (SRN) is an extension of SPN and provides compact modeling facilities for system analysis. We build hierarchical SRN models to compare two task scheduling methods. The upper level model simulates task scheduling and the lower level model implements task serving process for different sites with multiple servers. We compare these two models and analyze their performances by giving reward measures in SRN.

• 정보과학회 논문지
• /
• 제43권9호
• /
• pp.1026-1033
• /
• 2016

그리드 맵에서의 경로 찾기는 로보틱스, 지능형 에이전트, 컴퓨터 게임 등의 분야에서 보편적으로 다루어지는 문제이다. 기술의 발전에 따라 게임의 가상 세계는 점점 정교하고 사실적으로 표현되는 추세인데, 이는 그리드 타일의 수가 너무 많아져 경로 탐색 시간이 증가한다는 단점을 수반한다. 본 논문에서는 축소된 상태 공간을 생성하고 이에 대한 경로를 사전계산하는 오프라인 전처리 과정을 통해, 실시간 질의에 대해 빠른 응답을 가능하게 하는 경로 찾기 알고리즘을 제안한다. 전처리 과정에서는 그리드 맵상의 자유 공간을 수직 분할하고, 분할된 영역들을 노드로 하는 연결 그래프를 생성하고, 모든 노드 쌍에 대한 경로를 행렬 형태로 저장한다. 실시간 쿼리 단계에서는 질의 점이 속하는 노드들을 찾고, 그에 해당하는 저장된 경로를 검색한다. 그리드 기반 경로 찾기의 수준기표로 이용되는 맵들의 집합에 대해 제안한 방법을 시뮬레이션하여, 탐색 공간과 탐색 시간이 획기적으로 감소됨을 확인한다.