• Title/Summary/Keyword: road network

Search Result 964, Processing Time 0.032 seconds

A Study on the Road Network of Jeju-Eupseong in Daehan Empire Period (구한말(舊韓末) 제주읍성(濟州邑城)의 도로체계(道路體系)에 관한 연구(硏究))

  • Yang, Sang-Ho
    • Journal of architectural history
    • /
    • v.20 no.6
    • /
    • pp.169-184
    • /
    • 2011
  • The following research of the road network of Jeju-Eupseong during Daehan Empire period has a twofold purpose: to study some characteristics of the road network at that time; and, to restore it to the original form of that period before a newly constructed road, called Shinjakro, has been established. As an attempt to trace the old shape of Jeju-Eupseong, this study analyzed some historical factors based on the first land cadastral map which was made in 1914, including outskirts of Jeju-Eupseong; such as castle itself, castle gate, road, bridge, lots of land, etc. Then this study also tried to restore the old road network of Jeju-Eupseong, through finding the original land-lot shape in the land cadastral map. There was five Shinjakro made between 1914 and 1917. The road network before then was composed of the double east-west axes and the single north-south axis. These axes was connected to some important place of the inside of Jeju-Eupseong; such as castle gates, fountains, Gaek-sa, etc. There were many branch lines between these main axes at about 80-120m intervals. Also there was an outer road along the outer wall of castle, connected with each castle gates. Especially, the north-west axis was the baseline which divided into two large parts, a government office area and non-government area (housing and commercial street for the people). Finally, this paper examines that the road network of Jeju-Eupseong was the true result for the efficient function of the city, especially considering natural geographical conditions and environment of living of that time.

Speed and Steering Control of Autonomous Vehicle Using Neural Network (신경회로망을 이용한 자율주행차량의 속도 및 조향제어)

  • 임영철;류영재;김의선;김태곤
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.10a
    • /
    • pp.274-281
    • /
    • 1998
  • This paper describes a visual control of autonomous vehicle using neural network. Visual control for road-following of autonomous vehicle is based on road image from camera. Road points on image are inputs of controller and vehicle speed and steering angle are outputs of controller using neural network. Simulation study confirmed the visual control of road-following using neural network. For experimental test, autonomous electric vehicle is designed and driving test is realized

  • PDF

A Study of Main-Road Analysis for Efficient Road Management : Focusing on the Chungcheong Area (효율적 도로관리를 위한 핵심도로망 분석에 관한 연구 : 충청권을 중심으로)

  • Kang, Min-Joon;Oh, Ju Taek;Park, Joon Seok
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.20 no.1
    • /
    • pp.132-145
    • /
    • 2021
  • This study analyzes the main road network for road users to manage roads efficiently and derives problematic road sections to be improved. Traditional road management has been operated by manager-oriented view and a diversified road management system based on congestion. Therefore, in this research, the mail road Network was selected from the viewpoint of passenger-oriented, logistics-oriented and tourism-oriented, and the problematic road sections were derived through Level Of Service (LOS) analysis, safety analysis using EPDO accident rate, and network service analysis. This study emphasizes the efficient user-oriented road construction and management system and the need of constructing a mail road network, and it suggests the improvement strategies.

Application Method of GIS for Planning of Forest Road Network (임도망의 계획에 있어서 GIS 활용방안)

  • Jeon, Kwon-Seok;Ma, Ho-Seop
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.5 no.3
    • /
    • pp.99-106
    • /
    • 2002
  • The application method of GIS for planning of forest road network can be save the efforts and cost by frequently change of forest road and evaluation the forest road route before construction. The purpose of this study is to suggest the proper method for planning an optimal forest road network in mountains forest using geographic information system(GIS) in the national forest of Mt. Kumsan at Namhae-gun, Gyungsangnam-do. In the forest road network planning by the minimum longitudinal gradient, The total length was 20.41km, and road density was 6.92m/ha. In the forest road network planning by mixed with the minimum longitudinal gradient and the maximization of investment effect, The total length was 21.15km, and road density was higher than that of the minimum longitudinal gradient as 7.17m/ha. The road length overlapped by cost path was more short than 3.52m/ha of the minimum longitudinal gradient as 1.73km. So, it appeared that forest road has an high effectiveness in yarding function. Therefore, it considered that the geographic information system could provide an effective and resonable solutions for planning of optimal forest road network.

  • PDF

Indexing Method for Constraint Moving Objects Using Road Connectivity (도로의 연결성을 이용한 제약적 이동 객체에 대한 색인 기법)

  • Bok, Kyoung-Soo;Yoon, Ho-Won;Seo, Dong-Min;Rho, Jin-Seok;Cho, Ki-Hyung;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.7
    • /
    • pp.1-10
    • /
    • 2007
  • In this paper, we propose an indexing method for efficiently updating current positions of moving objects on road networks. The existing road network models increase update costs when objects move to adjacent road segments because their connectivity is not preserved. We propose an intersection based network model and a new index structure to solve this problem. The proposed intersection based network model preserves network connectivity through splitting road networks to contain intersection nodes always. The proposed index structure In our experiments, we show that our method is about 3 times faster than an existing index structure in terms of update costs.

Grid-based Similar Trajectory Search for Moving Objects on Road Network (공간 네트워크에서 이동 객체를 위한 그리드 기반 유사 궤적 검색)

  • Kim, Young-Chang;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.1
    • /
    • pp.29-40
    • /
    • 2008
  • With the spread of mobile devices and advances in communication techknowledges, the needs of application which uses the movement patterns of moving objects in history trajectory data of moving objects gets Increasing. Especially, to design public transportation route or road network of the new city, we can use the similar patterns in the trajectories of moving objects that move on the spatial network such as road and railway. In this paper, we propose a spatio-temporal similar trajectory search algorithm for moving objects on road network. For this, we define a spatio-temporal similarity measure based on the real road network distance and propose a grid-based index structure for similar trajectory search. Finally, we analyze the performance of the proposed similar trajectory search algorithm in order to show its efficiency.

  • PDF

Dynamic Route Guidance via Road Network Matching and Public Transportation Data

  • Nguyen, Hoa-Hung;Jeong, Han-You
    • Journal of IKEEE
    • /
    • v.25 no.4
    • /
    • pp.756-761
    • /
    • 2021
  • Dynamic route guidance (DRG) finds the fastest path from a source to a destination location considering the real-time congestion information. In Korea, the traffic state information is available by the public transportation data (PTD) which is indexed on top of the node-link map (NLM). While the NLM is the authoritative low-detailed road network for major roads only, the OpenStreetMap road network (ORN) supports not only a high-detailed road network but also a few open-source routing engines, such as OSRM and Valhalla. In this paper, we propose a DRG framework based on road network matching between the NLM and ORN. This framework regularly retrieves the NLM-indexed PTD to construct a historical speed profile which is then mapped to ORN. Next, we extend the Valhalla routing engine to support dynamic routing based on the historical speed profile. The numerical results at the Yeoui-do island with collected 11-month PTD show that our DRG framework reduces the travel time up to 15.24 % and improves the estimation accuracy of travel time more than 5 times.

The Research about Map Model of 3D Road Network for Low-carbon Freight Transportation (저탄소 화물운송체계 구현을 위한 3차원 도로망도 모델에 관한 연구)

  • Lee, Sang-Hoon
    • Spatial Information Research
    • /
    • v.20 no.4
    • /
    • pp.29-36
    • /
    • 2012
  • The low-carbon freight transportation system was introduced due to increase traffic congestion cost and carbon-dioxide for global climate change according to expanding city logistics demands. It is necessary to create 3D-based road network map for representing realistic road geometry with consideration of fuel consumption and carbon emissions. This study propose that 3D road network model expressed to realistic topography and road structure within trunk road for intercity freight through overlaying 2D-based transport-related thematic map and 1m-resolution DEM. The 3D-based road network map for the experimental road sections(Pyeongtaek harbor-Uiwang IC) was verified by GPS/INS survey and fuel consumption simulation. The results corresponded to effectively reflect realistic road geometry (RMSE=0.87m) except some complex structure such as overpass, and also actual fuel consumption. We expect that Green-based freight route planning and navigation system reflected on 3D geometry of complex road structure will be developed for effectively resolving energy and environmental problems.

A Network-based Indexing Method for Trajectories of Moving Objects on Roads (도로 위에 존재하는 이동객체의 궤적에 대한 네트워크 기반의 색인 방법)

  • Kim, Kyoung-Sook;Li, Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.879-888
    • /
    • 2006
  • Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.

A Study on Updating Methodology of Road Network data using Buffer-based Network Matching (버퍼 기반 네트워크 매칭을 이용한 도로 데이터 갱신기법 연구)

  • Park, Woo-Jin
    • Journal of Cadastre & Land InformatiX
    • /
    • v.44 no.1
    • /
    • pp.127-138
    • /
    • 2014
  • It can be effective to extract and apply the updated information from the newly updated map data for updating road data of topographic map. In this study, update target data and update reference data are overlaid and the update objects are explored using network matching technique. And the network objects are classified into five matching and update cases and the update processes for each case are applied to the test data. For this study, road centerline data of digital topographic map is used as an update target data and road data of Korean Address Information System is used as an update reference data. The buffer-based network matching method is applied to the two data and the matching and update cases are classified after calculating the overlaid ratio of length. The newly updated road centerline data of digital topographic map is generated from the application of update process for each case. As a result, the update information can be extracted from the different map dataset and applied to the road network data updating.