• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.904-907
• /
• 1996

In this paper, we propose an efficient collision-free path planning method of two cooperating robot manipulators grasping a common object rigidly. For given two robots and an object, the procedure is described which constructs the reduced dimensional configuration space by the kinematic analysis of two cooperating robot manipulators. A path planning algorithm without explicit representation of configuration obstacles is also described. The primary steps of the algorithm is as follows. First, we compute a graph which represents the skeleton of the free configuration space. Second, a connection between an initial and a goal configuration to the graph is searched to find a collision-free path.

• 의료ㆍ복지 건축 : 한국의료복지건축학회 논문집
• /
• 제21권3호
• /
• pp.25-35
• /
• 2015

Purpose: Signs that are installed at unnoticeable places or that disconnect before the destination can bring errors of location information delivery. Therefore, this study aims to find out the spatial relation between structure of space and signs in the perspective of visual exposure possibility, operating arrangement and assesment by applying spatial structure theory. Methods: Effectiveness of organization of guidance signs was evaluated after the four way-finding factors(Plan Configuration, Sign System, Perceptual Access, Architectural Difference) that G.D.Weisman suggested were interpreted by spatial structure theory(J-Graph analysis, Space Syntax, Visual Graph Analysis) under the premise that it is closely related to the structure of space. Results: 1) Because the south corridor that connects each department of outpatient division is located in the hierarchy center of the space, and walking density is expected to be high, guidance signs need to be organized at the place with high integration value. 2) The depth to the destination space can be estimated through J-Graph analysis. The depth means a switch of direction, and the guidance signs are needed according to the number. 3) According to visibility graph analysis, visual exposure can be different in the same hierarchy unit space according to the shape of the flat surface. Based on these data, location adjustment of signs is possible, and the improvement effect can be estimated quantitatively. Implications: Spatial structure theory can be utilized to design and evaluate sign systems, and it helps to clearly understand the improvement effect. It is desirable to specify design and estimation of sign systems in the order of J-Graph analysis${\rightarrow}$Space Syntax Theory${\rightarrow}$visibility graph analysis.

• 인터넷정보학회논문지
• /
• 제8권6호
• /
• pp.135-144
• /
• 2007

특성 모델(Feature Model)은 소프트웨어 제품 라인 개발 시 도메인 공학 단계에서 제품들 사이의 공통된 개념들과 서로 다른 개념들을 모델링하는데 널리 사용된다. 특성 모델로부터 특정 제품에 포함될 특성들을 선택한 결과를 특성 구성(Feature Configuration)이라고 하며, 이것은 특정 제품에 대한 요구 사항을 나타낸다. 현재 소프트웨어 제품 라인 개발 시 특성 모델과 특성 구성을 어떻게 구축하고 이용하는지에 대한 연구는 많이 되어 있지만, 이들에 대한 정형적 시맨틱과 논리적 추론에 대한 연구는 부족하다. 본 논문에서는 소프트웨어 제품 라인 공학에서의 표준 문제로 제안된 Graph Product Line을 예제로 하여 규칙 기반 시스템인 JESS를 이용한 특성 구성 검증 기법을 제안한다. 본 논문의 기법은 특성 구성의 불일치성을 일으키는 원인을 명확히 제시하는 장점을 가지며, 자바 언어와의 결합성이 뛰어난 JESS 시스템에 기반을 두었기 때문에 다른 소프트웨어 제품 라인 개발 환경과 쉽게 통합될 수 있다.

• Nuclear Engineering and Technology
• /
• 제51권2호
• /
• pp.444-452
• /
• 2019

To assess the availability of a nuclear power plant's dynamic systems, it is necessary to consider the impact of dynamic interactions, such as components, software, and operating processes. However, there is currently no simple, easy-to-use tool for assessing the availability of these dynamic systems. The existing method, such as Markov chains, derives an accurate solution but has difficulty in modeling the system. When using conventional fault trees, the reliability of a system with dynamic characteristics cannot be evaluated accurately because the fault trees consider reliability of a specific operating configuration of the system. The dynamic reliability graph with general gates (DRGGG) allows an intuitive modeling similar to the actual system configuration, which can reduce the human errors that can occur during modeling of the target system. However, because the current DRGGG is able to evaluate the dynamic system in terms of only reliability without repair, a new evaluation method that can calculate the availability of the dynamic system with repair is proposed through this study. The proposed method extends the DRGGG by adding the repair condition to the dynamic gates. As a result of comparing the proposed method with Markov chains regarding a simple verification model, it is confirmed that the quantified value converges to the solution.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 춘계학술대회
• /
• pp.22-24
• /
• 2021

본 논문은 노드와 엣지로 이루어진 그래프 구성을 통해 신경망을 활용하여 엣지 가중치 예측 방안을 제안하고자 한다. 사회 구성요소 중 하나인 브랜드들의 중요도 높은 전략 중 출점전략에 대해 초점을 맞추어보았다. 본 논문에서는 1) 브랜드 지점들을 노드로 구성하고, 지점 간 관계를 엣지로 구성한다. 그리고 지점 간 실제 도보 및 주행 가능 거릿값을 엣지 가중치로 표현한 그래프를 구성한다. 그리고 2) 엣지를 수치화하여 신경망을 학습해 엣지의 가중치인 지점 간 거릿값을 예측하는 방안을 제안한다. 제안한 방식을 활용함으로 예측되는 특정 브랜드의 출점 범위를 성공적인 브랜드의 출점전략 분석할 시에 활용할 수 있을 것으로 예상한다.

• 한국초등과학교육학회지:초등과학교육
• /
• 제31권3호
• /
• pp.386-397
• /
• 2012

The purpose of this study was to find a way to improve the science textbook graph through analyzing teachers' interpretation process with eye movement tracking when they try to read the science textbook graph. Participants in this project were 10 elementary school teachers while bar graphs, line graphs, pie charts in 2007 revision science textbooks were used as materials. SMI (SensoMotoric Instruments)' iView X TM RED 120 Hz was used in order to collect eye movement data. Although subjects paid attention to the title of the graph at first, the consequence of the eye fixation was changed by the composition of the graph in case of the rest of areas. In particular, the flow of visual attention and fixation time were affected by the form and configuration of the graph. The diversity of graph construction caused confusion in interpreting graphs; the manner of presenting title, the difference of background colors, size of characters, the name of X-axis and Y-axis. Out results showed that the conformation of graphs as well as the presentation of each factor should be composed in accordance with the educational purpose for helping users to easier understanding.

• 대한산업공학회지
• /
• 제22권4호
• /
• pp.579-588
• /
• 1996

The purpose of this paper is to develop a method of Collision-Free Path Planning (CFPP) for an articulated robot. First, the configuration of the robot is built by a set of robot joint angles derived from robot inverse kinematics. The joint space, that is made of the joint angle set, forms a Configuration space (Cspcce). Obstacles in the robot workcell are also transformed into the Cobstacles using slice projection method. Actually the Cobstacles means the configurations of the robot causing collision with obstacles. Secondly, a connected graph, a kind of roadmap, is constructed by the free configurations in the Cspace, where the free configurations are randomly sampled from a free Cspace immune from the collision. Thirdly, robot paths are optimally determinant in the connected graph. A path searching algorithm based on $A^*$ is employed in determining the paths. Finally, the whole procedures for the CFPP method are shown for a proper articulated robot as an illustrative example.

• 충청수학회지
• /
• 제19권4호
• /
• pp.403-408
• /
• 2006

A pebbling move on a connected graph G is taking two pebbles off of one vertex and placing one of them on an adjacent vertex. The domination cover pebbling number ${\psi}(G)$ is the minimum number of pebbles required so that any initial configuration of pebbles can be transformed by a sequence of pebbling moves so that the set of vertices that contain pebbles forms a domination set of G. We determine the domination cover pebbling number for fans, fuses, and pseudo-star.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2002년도 가을 학술발표논문집 Vol.29 No.2 (1)
• /
• pp.727-729
• /
• 2002

가시화 그래프(visibility graph, Vgraph)는 로봇의 경로를 계획할 때, 최적의 경로를 구하기 위해 널리 이용되는 지도접근 방식중의 하나이다. 원래 Vgraph는 다각형으로 모델링된 로봇이 다각형 환경의 평면상에서 움직일 때 움직이는 로봇을 점으로 환산한 환경인 형상공간(configuration space, C-공간)에서 정의되었는데 이를 원형 로봇 혹은 일반화 다각형(generalized polygon) 환경으로 확장한 것이 일반화 가시화 그래프(GVgraph)이다. 본 논문에서는 기존의 다각형 환경에서 정의된 Vgraph를 형성하는 알고리즘과 동일한 시간복잡도로 GVgraph를 구현하는 알고리즘을 소개하고 미세 운동계획(fine motion planning)에 응용하는 예를 보여준다.

• 국제학술발표논문집
• /
• The 1th International Conference on Construction Engineering and Project Management
• /
• pp.383-388
• /
• 2005

In the construction industry, complex works are carried out with significant resources under non-linear circumstances where clear concepts of project management could be of benefit to all parties and personnel involved. In this paper, we define the optimum project management configuration for construction management by using DSM (Design Structure Matrix). Furthermore DSM can be visualized as a network model, and then Graph Theory provides us the numerical results.