• Journal of The Korea Institute of Healthcare Architecture
• /
• v.21 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.41-47
• /
• 2016

This paper considers simple polygon search problem. How many searchers find a mobile intruder that is arbitrarily faster than the searcher within polygon art gallery? This paper uses the visibility graph that is connected with edges for mutually visible vertices. Given visibility graph, we select vertex u that is conjunction ${\Delta}(G)$ in $N_G(v)$ for $d_G(v){\leq}4$. We decide 1-searchable if $1{\leq}{\mid}u{\mid}{\leq}2$ and 2-searchable if ${\mid}u{\mid}{\geq}3$. We also present searcher's shortest path. This algorithm is verified by varies 1 or 2-searchable polygons.

• International Journal of Aeronautical and Space Sciences
• /
• v.8 no.2
• /
• pp.37-43
• /
• 2007

Coordination of multiple UAVs is an essential technology for various applications in robotics, automation, and artificial intelligence. In general, it includes 1) waypoints assignment and 2) trajectory generation. In this paper, we propose a new method for this problem. First, we modify the concept of the standard visibility graph to greatly improve the optimality of the generated trajectories and reduce the computational complexity. Second, we propose an efficient stochastic approach using simulated annealing that assigns waypoints to each UAV from the constructed visibility graph. Third, we describe a method to detect collision between two UAVs. FinallY, we suggest an efficient method of controlling the velocity of UAVs using A* algorithm in order to avoid inter-UAV collision. We present simulation results from various environments that verify the effectiveness of our approach.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.739-741
• /
• 2005

최근 게임에서 자주 등장하기 시작한 랜덤 지형 맵 생성기법으로 인해 단순한 경로 찾기가 아닌 지형분석을 통한 복잡한 경로 찾기 문제가 많은 관심을 받고 있다. 이에 로보틱스 분야에서 경로 찾기에 이용되는 가시성그래프(Visibility Graph, Vgraph)가 지형분석과 경로 찾기를 동시에 해결할 수 있는 방법으로 제안되고 있다. Vgraph를 이용하면 지형의 로드맵을 효과적으로 생성할 수 있을 뿐 아니라 A* 알고리즘과 결합하여 최적의 경로를 찾는 것을 보장하는 장점이 있다. 그러나 Vgraph에 의해 구해진 경로는 장애물의 정점에서 정점으로 이동하기 때문에 항상 장애물의 모서리를 향해 움직이며 벽에 붙어가는 듯이 보여 부자연스러운 것이 단점이다. 본 논문에서는 설계자가 요구하는 여유공간 c만큼 장애물을 확장하여 확장된 장애물에 대해 가시성그래프를 생성함으로써, Vgraph의 장점은 유지하며 단점을 보완할 수 있는 방법에 대해 제안한다.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2732-2734
• /
• 2000

This paper proposes a path planning algorithm for mobile robots. To generate a minimum-distance path for mobile robots, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance path between a start and a goal point, the path is revised to find the smooth subminimum-distance path by a path-smoothing algorithm. Simulation results show that the proposed algorithms are effective.

• International Journal of High-Rise Buildings
• /
• v.7 no.2
• /
• pp.171-183
• /
• 2018

Turner and Penn (1) from UCL have proved that Visibility Graph Analysis (VGA) can be used as a more accurate method to predict the pedestrian distribution in building spaces. However, this methodology neglects certain elements that are of special influence on pedestrian distribution in buildings, especially the entrances and exits. Based on Space Syntax, this dissertation improves on the traditional method of Visibility Graph Analysis, using three shopping centers in Shenzhen as examples, attempts to explore a new parameter - "attenuation index of pedestrians at the entrances and exits" - using relevant data of the entrances and exits of the three cases, and combines it with traditional VGA analysis through weighted calculation, in order to provide more accurate predictions of pedestrian patterns in shopping centers.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.327-331
• /
• 2005

In this paper, Another way to measure the visibility of image is presented, and this way is different with existing way which is measured by filtering such as High pass, Low pass. Dynamic range, Gray level and Condition Curve Graph is used among much information of histogram, and the output is limited by log scale. As a result, I can confirm that the output is reasonable. With this output, I present that the possibility of another way to measure the visibility of image is existing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.397-400
• /
• 2004

본 논문에서는 Navigation Mesh로 이루어진 3D 게임에서 가시성 그래프(Visibility Graph)와 $A^*$ 알고리즘을 혼용한 효율적인 경로 탐색 방법을 제안한다. Navigation Mesh로 지형을 생성할 때 이동에 꼭 필요한 Mesh로만 최대한 단순하게 지형을 구성하는 경우에는 경로 탐색을 위하여 $A^*$ 알고리즘을 적용할 수 있으나, 일반적으로 세밀하게 구성된 Navigation Mesh에서 $A^*$ 알고리즘을 적용할 경우 탐색할 공간이 많아지기 때문에 경로 탐색이 매우 비효율적이 된다. 세밀하게 구성된 Navigation Mesh에서도 효율적인 탐색을 하기 위해서 본 논문에서는 가시성 그래프를 이용하여 탐색 공간을 줄이는 방법을 사용하였다. 장애물들의 정점을 찾아 반드시 통과하여야 하는 mesh 들을 선정하고 $A^*$의 휴리스틱 함수를 이 mesh들을 지나가는 거리로 정의함으로써 기본적인 $A^*$ 알고리즘을 수행하는 것보다 탐색을 위하여 방문하는 mesh들의 수를 현저히 줄일 수 있었다.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.34 no.11
• /
• pp.23-32
• /
• 2018

The purpose of this study is to establish a walking energy weighted ERAM model that can predict the pedestrian volume by the connection structure of the vertical and horizontal spaces within a three-dimensional building. The process of building a walking-energy weighted ERAM model is as follows. First, the spatial graph was used to reproduce three-dimensional buildings with vertical and horizontal spatial connection structures. Second, the walking energy was measured on the spatial graph. Third, ERAM model was used to apply weights with spatial connection properties in random walking environment, and the walking energy weights were applied to the ERAM model to calculate the walk energy weighted ERAM values and visualize the distribution of pedestrian flow. To verify the validation of the established model, existing and proposed spatial analysis models were compared to real space. The results of this study are as follows : The model proposed in this study showed as much elaborated estimation of pedestrian traffic flow in real space as in traditional spatial analysis models, and also it showed much higher level of forecasting pedestrian traffic flow in real space than existing models.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.36 no.4
• /
• pp.83-92
• /
• 2020

The purpose of this study is to develop a publicness evaluation index for indoor privately owned public spaces (POPS). In order to develop the index, 10 cases of indoor POPS in New York City were analyzed using Visibility Graph Analysis by evaluating its accessibility and visual openness. The results are as follows; (1) Accessibility and openness of indoor POPS were higher compared to other public spaces on the first floor. (2) Cases with high accessibility index installed a higher number of entrances. (3) Cases with high openness index were mostly composed of a glass wall. (4) The publicness index was high when the lobby and the indoor POPS are shared. (5) Atrium types were highly utilized and the evaluation index was also high whereas, linear types were less utilized and the evaluation index was lower.