• ETRI Journal
• /
• v.42 no.2
• /
• pp.247-257
• /
• 2020

Spatial experiences in route finding, such as the ability of finding low-traffic routes, exert a significant influence on travel time in big cities; therefore, the spatial experiences of seasoned individuals such as taxi drivers in route finding can be useful for improving route-finding algorithms and preventing using routes having considerable traffic. In this regard, a spatial experience-based route-finding algorithm is introduced through ontology in this paper. To this end, different methods of modeling experiences are investigated. Then, a modeling method is chosen for modeling the experiences of drivers for route finding depending on the advantages of ontology, and an ontology based on the taxi drivers' experiences is proposed. This ontology is employed to create an ontology-based route-finding algorithm. The results are compared with those of Google maps in terms of route length and travel time at peak traffic time. According to the results, although the route lengths of route-finding method based on the ontology of drivers' experiences in three cases (from nine cases) are greater than that based on Google maps, the travel times are shorter in most cases, and in some routes, the difference in travel time reaches only 10 minutes.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.83-91
• /
• 2011

The route finding analysis is an essential geo-related decision support tool in a LBS(Location based Services) and previous researches related to route guidance have been mainly focused on route guidances for vehicles. However, due to the recent spread of personal computing devices such as PDA, PMP and smart phone, route guidance for pedestrians have been increasingly in demand. The pedestrian route guidance is different from vehicle route guidance because pedestrians are affected more surrounding environment than vehicles. Therefore, pedestrian path finding needs considerations of factors affecting walking. This paper aimed to extract factors affecting walking and charting the factors for application factors affecting walking to pedestrian path finding. In this paper, we found various factors about environment of road for pedestrian and extract the factors affecting walking. Factors affecting walking consist of 4 categories traffic, sidewalk, network, safety facility. We calculated weights about each factor using analytic hierarchy process (AHP). Based on weights we calculated scores about each factor's attribute. The weight is maximum score of factor. These scores of factor are used to optimal pedestrian path finding as path finding cost with distance, accessibility.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.595-602
• /
• 2002

The watchman routes which an watchman patrols the interior of polygon moving along the route are classified to minimum length or minimum links. The watchman route with minimum links has minimum changes of direction in process. In this paper, we present an algorithm with $O(N^2)$ time for finding the watchman route with minimum links in the weakly visible polygons which have specific property.

• International conference on construction engineering and project management
• /
• 2020.12a
• /
• pp.510-519
• /
• 2020

Within an intelligent automated cyber-physical system, the realization of the autonomous mechanism for data collection, data integration, and data analysis plays a critical role in the design, development, operation, and maintenance of such a system. This construct is particularly vital for fault-tolerant route-finding systems that rely on the imprecise GPS location of the vehicles to properly operate, timely plan, and continuously produce informative feedback to the user. More essentially, the integration of digital twins with cyber-physical route-finding systems has been overlooked in intelligent transportation services with the capacity to construct the network routes solely from the locations of the operating vehicles. To address this limitation, the present study proposes a conceptual architecture that employs digital twin to autonomously maintain, update, and manage intelligent transportation systems. This virtual management simulation can improve the accuracy of time-of-arrival prediction based on auto-generated routes on which the vehicle's real-time location is mapped. To that end, first, an intelligent transportation system was developed based on two primary mechanisms: 1) an automated route finding process in which predictive data-driven models (i.e., regularized least-squares regression) can elicit the geometry and direction of the routes of the transportation network from the cloud of geotagged data points of the operating vehicles and 2) an intelligent mapping process capable of accurately locating the vehicles on the map whereby their arrival times to any point on the route can be estimated. Afterward, the digital representations of the physical entities (i.e., vehicles and routes) were simulated based on the auto-generated routes and the vehicles' locations in near-real-time. Finally, the feasibility and usability of the presented conceptual framework were evaluated through the comparison between the primary characteristics of the physical entities with their digital representations. The proposed architecture can be used by the vehicle-tracking applications dependent on geotagged data for digital mapping and location tracking of vehicles under a systematic comparison and simulation cyber-physical system.

• The Journal of the Convergence on Culture Technology
• /
• v.10 no.6
• /
• pp.597-604
• /
• 2024

This study aims to develop a route-finding simulation focused on lead climbing, an official Olympic discipline. Objects were strategically using Unity placed and variables defined to construct a realistic climbing environment. Various climbing postures were generated, and the joint positions of the climber model were calculated using the FABRIK algorithm. ML-Agents were utilized to define vector observations and discrete actions, with stable postures determined using the CCW algorithm. Functions for behavior masking and agent action selection were implemented. Simulation results confirmed the feasibility of route-finding to the top hold, showing promise in enhancing training for lead climbers.

• Korea Trade Review
• /
• v.44 no.4
• /
• pp.115-128
• /
• 2019

This article analyzes issues regarding the economic development of the arctic area with the aim of finding ways to help solve the problems and to support sustainable economic development of the arctic area. Some proposals are introduced for establishing a sound legal infrastructure of the Korea-Russia economic development of the arctic area. As Russia develops the Arctic area and the route through the Arctic area, Korea will gain the possibility of transportation efficiency, vitalization of international transaction, and finding new markets. Resource development in the North Pole is ongoing, with matching international transaction and economic benefits. To reflect the Korea-Russia interests and to sustain the effect, the legal infrastructure is inevitable. For example, it would be reinforced by pushing forward the Korea-Russia FTA. The legal infrastructure for economic cooperation of Korea and Russia has to reflect that 'the development of the Arctic area and making the route through the Arctic area' should increase the sustainability and vitality of international transaction. The legal infrastructure for economic benefits can also help mitigating non-economic arguments of international community such as the security risk in the Korean-peninsula and around the world.

• Journal of the military operations research society of Korea
• /
• v.10 no.2
• /
• pp.43-49
• /
• 1984

This paper deals with a transportation problem with two objectives, that is, transportation cost and vital-route shipment. In the transportation problem minimizing cost is sometimes conflicting minimizing vital-route shipment. This paper develops an algorithm finding paneto-optimal solutions in minimizing vital-route shipment and cost, and also presents theoretical backgrounds for developing an algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1437-1445
• /
• 1999

n개의 꼭지점을 가진 단조(monotone) 다각형은 2차원 평면상의 임의의 선분에 단조 적인 2개의 체인으로 구성된다. 단조 다각형의 내부를 경로 상에서 모두 감시할 수 있는 최소 링크를 가진 경비원 경로(watchman route with minimum links)는 최소 개수의 선분으로 구성된 경로로서 하나 이상 존재할 수 있다. 본 논문에서는 단조 다각형의 최소 링크를 가진 경비원 경로들 중에서 최단 경비원 경로를 구하는 O(n) 시간의 알고리즘을 제시한다.Abstract A monotone polygon consists of n vertices and is a union of two monotone chains with respect to some line segment in the plane. A watchman route with minimum-links is a polygonal path such that each point in the interior of the polygon can be visible from at least one point along the route. There may be more than one watchman route with minimum links for given monotone polygon. In this paper, we present an algorithm with O(n) time that finds a shortest watchman route among the watchman routes with minimum links in a monotone polygon.

• Proceeding of Spring/Autumn Annual Conference of KHA
• /
• 2005.11a
• /
• pp.311-314
• /
• 2005

Our city structure is being complicated from the development of industry and the increase in population. It makes the ground space overcrowded, so underground space is systematized for use. Because this underground space has very complicated configuration, people have difficulty in finding the route in the underground space. Therefore It is demanded to comprehend configuration of the various space structure, predict pattern of the moving and analyze induction factor of the moving. When people are in the conflagration or dangerous situation, they are in the habit of using the route which they are used to go to and from. It is needed to analyze moving pattern of the pedestrian who usually use the underground space for the sake of dealing with conflagration in the underground space. Finally, this study suggested that general characteristic, distribution, moving route of the pedestrian and factors influencing that they choose the route which the research finds out.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.1
• /
• pp.35-44
• /
• 2002

The watchman routes which an watchman patrols the interior of given polygon moving along the route are classified to minimum length or minimum links. The watchman route with minimum links has minimum changes of direction and a weakly visible polygon consists of two chains which have mutually weakly visibility. In this paper, we present an Ο($n^2$) time algorithm for finding the watchman route with minimum links in the weakly visible polygons, where n is the number of vertices of a given polygon.