• International Journal of Highway Engineering
• /
• v.14 no.5
• /
• pp.123-132
• /
• 2012

PURPOSES: This study is to investigate the consideration which relates with a disaster from route alignment process and proposed the method it will be able to evaluate a disaster danger fixed quantity. METHODS: Use the landslide disaster probabilistic map of GIS based and in about landslide occurrence of the route alignment at the time of neighboring area after evaluating a risk fixed quantity, it compared LCC expense in about each alternative route. It developed the system it will be able to analyze a LCC and a disaster risk in about the alternative route. In order to verify a risk analytical algorithm and the system which are developed it selected national road 59 lines on the demonstrative route and it analyzed a disaster risk. RESULTS: Demonstrative route not only the disaster risk to be it will be able to compare a disaster risk fixed quantity like the economical efficiency degree in compliance with LCC expense productions it compared and there being the designer will be able to decide the alternative route, it confirmed. CONCLUSIONS: Roads can be designed by considering occurs repeatedly landslides and debris flow caused by disasters in advance and expect to be able to effect that can reduce the overall cost to recover losses caused by the disaster, and temporally loss is expected.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.3
• /
• pp.157-164
• /
• 2022

In this paper, we describe how to implement the mountainous terrain, radar, and air defense network for UAV path planning in a 3-D environment, and perform path planning and re-planning using the PRM algorithm, a sampling-based path planning algorithm. In the case of the original PRM algorithm, the calculation to check whether there is an obstacle between the nodes is performed 1:1 between nodes and is performed continuously, so the amount of calculation is greatly affected by the number of nodes or the linked distance between nodes. To improve this part, the proposed LineGridMask method simplifies the method of checking whether obstacles exist, and reduces the calculation time of the path planning through parallelization. Finally, comparing performance with existing PRM algorithms confirmed that computational time was reduced by up to 88% in path planning and up to 94% in re-planning.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.11 no.2
• /
• pp.108-120
• /
• 2008

This paper discusses the prediction of deforestation areas using probability models from forest census database, Geographic information system (GIS) database and the land cover database. The land cover data was analyzed using remotely-sensed (RS) data of the Landsat TM data from 1989 to 2001. Over the analysis period of 12 years, the deforestation area was about 40ha. Most of the deforestation areas were attributable to road construction and residential development activities. About 80% of the deforestation areas for residential development were found within 100m of the road network. More than 20% of the deforestation areas for forest road construction were within 100m of the road network. Geographic factors and vegetation change detection (VCD) factors were used in probability models to construct deforestation occurrence map. We examined the size effect of area partition as training area and validation area for the probability models. The Bayes model provided a better deforestation prediction rate than that of the regression model.

• Economic and Environmental Geology
• /
• v.47 no.2
• /
• pp.121-131
• /
• 2014

The stability of rock slope is mainly controlled by the orientation and shear strength of discontinuties in rock mass. Therefore, in kinematic analysis, the orientation of the combination of discontinuities and slope face is examined to determine if certain modes of failure can be occurred. In previous kinematic analysis, a representative orientation of the slope face and mean orientation of discontinuity set were used as input parameters. However, since the orientations of slope face varies according to locations of measurement, the representative slope face orientation could cause misunderstanding for kinematic instability. In addition, since the orientations of each discontinuity are scattered in the same discontinuity set, there is the possibility that uncertainties are involved in the procedure of kinematic analysis. Therefore, in this study, the detailed digital topographic map was used to obtain the orientation of slope face. In addition, the probabilistic analysis approach was utilized to deal properly with the uncertainties in discontinuity orientation. The proposed approach was applied to steep slopes in mountain road located in Baehuryeong, Chunncheon city, Gangwon-Do. The analysis results obtained from the deterministic and probabilistic analysis were compared to check the feasibility of proposed the analysis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.587-595
• /
• 2015

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1931-1938
• /
• 2012

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.