• Title/Summary/Keyword: ROAD NETWORKS

Search Result 360, Processing Time 0.022 seconds

A Study on GIS Data Development and Distributed Modeling for Hydrological Simulation of Urban Flood (도시홍수 수문모의를 위한 GIS 자료구축 및 분포형 모델링 기법 연구)

  • Kim, Seong-Joon;Park, Geun-Ae
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2006.05a
    • /
    • pp.204-208
    • /
    • 2006
  • This study is to develop a distributed urban flood runoff model that simulates the road runoff and to test the applicability of the model by applying to Pyeongtaek city of $12.2km^2$. To generate the runoff along the runoff, agree burned DEM (Digital Elevation Model) with road networks was suggested and the proper spatial resolution of DEM was identified finer than 15 m. To test the model applicability, 32 points on the road networks were selected and the hydrographs of each point were generated. The test showed reasonable results that increase the road runoff from the high elevation roads to the low elevation roads and the road runoff considering rainwater drainage from the road also showed reasonable results.

  • PDF

A Study on Network Analysis of Flooded Roads (홍수범람에 따른 도로침수 네트워크 분석에 관한 연구)

  • Kim, Kyong-Hoon;Kim, Seok
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2016.05a
    • /
    • pp.241-242
    • /
    • 2016
  • Recently, the interests in safety and prevention from disaster are increasing. In particular, lifeline networks such as water line and sewerage, electricity, gas, and road would be damaged from a disaster. If the lifeline networks do not work in normal, national public service will not properly function. Researches in social network analysis have been conducted for analyzing the interdependency between individuals since 1970s. These network analysis are utilized to investigate a spread of information and disease. However, it is hard to discover the analyzed cases including characteristics of nodes of networks in the area of transportation and disaster. Therefore, this study conducts network analysis of flooded road with flooding scenarios, investigates safe evacuation routes in flooded road network, and suggests efficient approaches for preventing damages from a flooding.

  • PDF

Characteristic Analysis on Urban Road Networks Using Various Path Models (다양한 경로 모형을 이용한 도시 도로망의 특성 분석)

  • Bee Geum;Hwan-Gue Cho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.13 no.6
    • /
    • pp.269-277
    • /
    • 2024
  • With the advancement of modern IT technologies, the operation of autonomous vehicles is becoming a reality, and route planning is essential for this. Generally, route planning involves proposing the shortest path to minimize travel distance and the quickest path to minimize travel time. However, the quality of these routes depends on the topological characteristics of the road network graph. If the connectivity structure of the road network is not rational, there are limits to the performance improvement that routing algorithms can achieve. Real drivers consider psychological factors such as the number of turns, surrounding environment, traffic congestion, and road quality when choosing routes, and they particularly prefer routes with fewer turns. This paper introduces a simple path algorithm that seeks routes with the fewest turns, in addition to the traditional shortest distance and quickest time routes, to evaluate the characteristics of road networks. Using this simple path algorithm, we compare and evaluate the connectivity characteristics of road networks in 20 major cities worldwide. By analyzing these road network characteristics, we can identify the strengths and weaknesses of urban road networks and develop more efficient and safer route planning algorithms. This paper comprehensively examines the quality of road networks and the efficiency of route planning by analyzing and comparing the road network characteristics of each city using the proposed simple path algorithm.

Cellular Parallel Processing Networks-based Dynamic Programming Design and Fast Road Boundary Detection for Autonomous Vehicle (셀룰라 병렬처리 회로망에 의한 동적계획법 설계와 자율주행 자동차를 위한 도로 윤곽 검출)

  • 홍승완;김형석
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.7
    • /
    • pp.465-472
    • /
    • 2004
  • Analog CPPN-based optimal road boundary detection algorithm for autonomous vehicle is proposed. The CPPN is a massively connected analog parallel array processor. In the paper, the dynamic programming which is an efficient algorithm to find the optimal path is implemented with the CPPN algorithm. If the image of road-boundary information is utilized as an inter-cell distance, and goals and start lines are positioned at the top and the bottom of the image, respectively, the optimal path finding algorithm can be exploited for optimal road boundary detection. By virtue of the parallel and analog processing of the CPPN and the optimal solution of the dynamic programming, the proposed road boundary detection algorithm is expected to have very high speed and robust processing if it is implemented into circuits. The proposed road boundary algorithm is described and simulation results are reported.

An Efficient Pre-computing Method for Processing Continuous Skyline Queries in Road Networks (도로망에서 연속적인 스카이라인 절의처리를 위한 효율적인 전처리기법)

  • Jang, Su-Min;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.36 no.4
    • /
    • pp.314-320
    • /
    • 2009
  • Skyline queries have recently received considerable attention in the searching services. The skyline contains interesting objects that are not dominated by any other objects on all dimensions. Many related works have processed a skyline on static data or on moving objects in Euclidean space. However, this paper assumes that the point of a skyline query continuously moves in road networks. We propose a new method that efficiently processes continuous skyline queries in road networks through pre-computed shortest range data of objects. Our experiments show that the proposed method is about 100 times faster than previous methods in terms of query processing time.

Emergency and Permanent Repair Technology for Damaged Road Bases and Slopes using Gravel-Netting Concrete (도로 및 비탈면 유실 항구적 긴급복구를 위한 골재망 콘크리트 활용기술 개발)

  • Kim, Yongjae;Jung, Haekook;Kim, Seungwon;Park, Cheolwoo
    • International Journal of Highway Engineering
    • /
    • v.20 no.2
    • /
    • pp.9-17
    • /
    • 2018
  • PURPOSES : The frequency and severity of natural disasters such as torrential rain or typhoons have become increasingly significant worldwide. Events such as summer typhoons and localized torrential downpour can cause severe damages to a residential area and road networks, resulting in serious harm to the daily lives of people, especially in rural areas by isolating residents from road networks. An immediate and emergency repair technology for the collapsed road networks is urgently needed. This study introduces a new technology to repair road bases or slopes. METHODS : The development of new technology for emergency and permanent repair consists of first, packing of cement paste-coated gravel, second, combining appropriate equipment, and third, conducting a field applicability test. In this research, the compressive strength of cement pastecoated gravel, gravel-netting concrete properties, and packing efficiency were determined, and a full scale field mock-up test was carried out. RESULTS : The compressive strength of the cement paste-coated gravel concrete satisfied the required limit for road base of 5 MPa after 7 days. With appropriate netting materials and packing size, gravel-netting concrete was successful up to a slope of 1:1.5. The full scale field mock-up test showed efficiency in the field and penetration resistance performance. CONCLUSIONS : The new technology of emergency and permanent repair for damaged road bases and slopes, introduced in this study, showed satisfactory performance. The technology is expected to be applied in the field when construction procedures and quality specifications are made.

A fast shortest path algorithm for road networks having turn prohibitions (회전제한이 있는 도로망을 위한 고속 최적경로 알고리즘)

  • 성태경;명선영;홍원철
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.3
    • /
    • pp.73-85
    • /
    • 1999
  • In metropolitan area, intersections having turn Prohibitions are often found and it is important to consider them in path planning. This Paper presents a new path planning method road networks having turn prohibitions. A new road network model is proposed in which an alter-native route for each turn-Prohibition is constructed in off-line using U-turn or P-turn and then Put into road network database. The proposed network model is efficient since it requires no virtual nodes that are usually used in the conventional road networks to represent turns at intersections. In order to find a shortest path with the proposed network, a new shortest path algorithm is proposed. A knot for the turn-Prohibited node is newly defined and is used in comparing the cost of the alternative route with that of the other path.

  • PDF

Estimation of Road-Network Performance and Resilience According to the Strength of a Disaster (재난 강도에 따른 도로 네트워크의 성능 및 회복력 산정 방안)

  • Jung, Hoyong;Choi, Seunghyun;Do, Myungsik
    • International Journal of Highway Engineering
    • /
    • v.20 no.1
    • /
    • pp.35-45
    • /
    • 2018
  • PURPOSES : This study examines the performance changes of road networks according to the strength of a disaster, and proposes a method for estimating the quantitative resilience according to the road-network performance changes and damage scale. This study also selected high-influence road sections, according to disasters targeting the road network, and aimed to analyze their hazard resilience from the network aspect through a scenario analysis of the damage recovery after a disaster occurred. METHODS : The analysis was conducted targeting Sejong City in South Korea. The disaster situation was set up using the TransCAD and VISSIM traffic-simulation software. First, the study analyzed how road-network damage changed the user's travel pattern and travel time, and how it affected the complete network. Secondly, the functional aspects of the road networks were analyzed using quantitative resilience. Finally, based on the road-network performance change and resilience, priority-management road sections were selected. RESULTS : According to the analysis results, when a road section has relatively low connectivity and low traffic, its effect on the complete network is insignificant. Moreover, certain road sections with relatively high importance can suffer a performance loss from major damage, for e.g., sections where bridges, tunnels, or underground roads are located, roads where no bypasses exist or they exist far from the concerned road, including entrances and exits to suburban areas. Relatively important roads have the potential to significantly degrade the network performance when a disaster occurs. Because of the high risk of delays or isolation, they may lead to secondary damage. Thus, it is necessary to manage the roads to maintain their performance. CONCLUSIONS : As a baseline study to establish measures for traffic prevention, this study considered the performance of a road network, selected high-influence road sections within the road network, and analyzed the quantitative resilience of the road network according to scenarios. The road users' passage-pattern changes were analyzed through simulation analysis using the User Equilibrium model. Based on the analysis results, the resilience in each scenario was examined and compared. Sections where a road's performance loss had a significant influence on the network were targeted. The study results were judged to become basic research data for establishing response plans to restore the original functions and performance of the destroyed and damage road networks, and for selecting maintenance priorities.

Fast Road Edge Detection with Cellular Analogic Parallel Processing Networks (도로 윤곽 검출을 위한 셀룰러 아나로직 병렬처리 회 로망(CAPPN) 알고리즘)

  • 홍승완;김형석;김봉수
    • Proceedings of the IEEK Conference
    • /
    • 2002.06c
    • /
    • pp.143-146
    • /
    • 2002
  • The aim of this work is the real-time road edge detection using the fast processing of Cellular Analogic Parallel Processing Networks(CAPPN). The CAPPN is composed of 2D analog cell way. If the dynamic programming is implemented with the CAPPN, the optimal path can be detected in parallel manner Provided that fragments of road edge are utilized as the cost inverse(benefit) in the CAPPN-based optimal path algorithm, the CAPPN determines the most plausible path as the road edge line. Benefits of the proposed algorithm are the fast processing and the utilization of optimal technique to determine the road edge lines.

  • PDF

Beyond the Silk Road Metaphor: Transregional Maritime Exchange and Social Transformation in Iron Age Southeast Asia

  • Sitta VON REDEN
    • Acta Via Serica
    • /
    • v.8 no.2
    • /
    • pp.95-124
    • /
    • 2023
  • Over the past 30 years, intense archaeological research has revealed a great increase in regional and transregional object mobility across the South China Sea during its Iron Age (500 BCE to 500 CE). Some objects had moved from a long distance: intaglios, seals, fine ceramic, glass containers, and gold coins of Mediterranean origin; and large bronzes, mirrors, and lacquerware connected to central East Asia. This evidence has given rise to larger-scale explanations, among which the most prominent has been the growth of (maritime) Silk Road trade. Scholars are divided as to whether the Silk Road is a suitable concept, with some emphasizing its orientalist overtones and colonial baggage and others finding it useful for the investigation of interregional networks trading in silk and other commodities. This paper explores how productive the Silk Road concept or metaphor really is for understanding transregional connectivity and social change in Iron Age Southeast Asia.