• 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.

• 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

• 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.

• International Journal of Computer Science & Network Security
• /
• v.24 no.9
• /
• pp.30-40
• /
• 2024

Building an accurate 3-D spatial road network model has become an active area of research now-a-days that profess to be a new paradigm in developing Smart roads and intelligent transportation system (ITS) which will help the public and private road impresario for better road mobility and eco-routing so that better road traffic, less carbon emission and road safety may be ensured. Dealing with such a large scale 3-D road network data poses challenges in getting accurate elevation information of a road network to better estimate the CO₂ emission and accurate routing for the vehicles in Internet of Vehicle (IoV) scenario. Clustering and regression techniques are found suitable in discovering the missing elevation information in 3-D spatial road network dataset for some points in the road network which is envisaged of helping the public a better eco-routing experience. Further, recently Explainable Artificial Intelligence (xAI) draws attention of the researchers to better interprete, transparent and comprehensible, thus enabling to design efficient choice based models choices depending upon users requirements. The 3-D road network dataset, comprising of spatial attributes (longitude, latitude, altitude) of North Jutland, Denmark, collected from publicly available UCI repositories is preprocessed through feature engineering and scaling to ensure optimal accuracy for clustering and regression tasks. K-Means clustering and regression using Support Vector Machine (SVM) with radial basis function (RBF) kernel are employed for 3-D road network analysis. Silhouette scores and number of clusters are chosen for measuring cluster quality whereas error metric such as MAE ( Mean Absolute Error) and RMSE (Root Mean Square Error) are considered for evaluating the regression method. To have better interpretability of the Clustering and regression models, SHAP (Shapley Additive Explanations), a powerful xAI technique is employed in this research. From extensive experiments , it is observed that SHAP analysis validated the importance of latitude and altitude in predicting longitude, particularly in the four-cluster setup, providing critical insights into model behavior and feature contributions SHAP analysis validated the importance of latitude and altitude in predicting longitude, particularly in the four-cluster setup, providing critical insights into model behavior and feature contributions with an accuracy of 97.22% and strong performance metrics across all classes having MAE of 0.0346, and MSE of 0.0018. On the other hand, the ten-cluster setup, while faster in SHAP analysis, presented challenges in interpretability due to increased clustering complexity. Hence, K-Means clustering with K=4 and SVM hybrid models demonstrated superior performance and interpretability, highlighting the importance of careful cluster selection to balance model complexity and predictive accuracy.

• 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.

• 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.

• 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.

• 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.

• 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.

• 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.