• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.886-889
• /
• 2014

본 논문에서는 사용자로부터 실시간으로 전송 받은 교통정보 이용하여 강화학습에 의한 최적 경로탐색을 제안한다. ITS(Intelligent Transportation Systems)를 서비스하기 위한 시스템을 구축하기에는 많은 시간적 비용과 물질적 비용이 소모된다. 이를 보완하기 위해 사용자의 단말기로부터 실시간으로 수집한 교통 정보를 이용하여 강화학습기법을 적용한다. 강화학습의 목표는 환경 내에서의 에이전트가 행동에 대한 보상의 총합을 최대화 하는 것이다. 본 논문에서는 실시간으로 사용자의 단말기로부터 획득한 교통 정보를 이용하여 강화학습기법을 적용하고, 최단경로탐색 알고리즘을 분석하여 비교한다.

• Journal of Digital Contents Society
• /
• v.13 no.3
• /
• pp.451-457
• /
• 2012

Recently, as the use of real time traffic information of a car navigation system increases rapidly with the development of Intelligent Transportation Systems (ITS), path search is getting more important. Previous algorithms, however, are mostly for the shortest distance searching and provide route information using static distance and time information. Thus they could not provide the most optimal route at the moment which changes dynamically according to traffic. Accordingly, in this study, Semantic Shortest Path algorithm with Reduction ratio & Distance(SSP_RD) is proposed to solve this problem. Additionally, a routing model based on velocity reduction ratio and distance and a dynamic route link map are proposed.

• Journal of The Korean Association of Information Education
• /
• v.2 no.2
• /
• pp.252-259
• /
• 1998

Vehicle navigation systems employ a certain route planning algorithm that provides the shortest path between the starting point and the destination point. The performance of a given route planning algorithm is measured through the degree of optimal route selection and the time cost to complete searching an optimal path. In this paper, various route planning algorithms are evaluated through computer simulation based on a real digital map database. Among those algorithms evaluated in this paper, the Modified Bi-directional A${\ast}$ algorithm is found to be the best algorithm for use in vehicle navigation systems.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.5
• /
• pp.117-125
• /
• 2022

Recently, as users' interest for travel increases, research on a travel route recommendation service that replaces the cumbersome task of planning a travel itinerary with automatic scheduling has been actively conducted. The most important and common goal of the itinerary recommendations is to provide the shortest route including popular tour spots near the travel destination. A number of existing studies focused on providing personalized travel schedules, where there was a problem that a survey was required when there were no travel route histories or SNS reviews of users. In addition, implementation issues that need to be considered when calculating the shortest path were not clearly pointed out. Regarding this, this paper presents a quantified method to find out popular tourist destinations using social big data, and discusses problems that may occur when applying the shortest path algorithm and a heuristic algorithm to solve it. To verify the proposed method, 63,000 places information was collected from the Gyeongnam province and big data analysis was performed for the places, and it was confirmed through experiments that the proposed heuristic scheduling algorithm can provide a timely response over the real data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.109-111
• /
• 2006

본 논문은 애니메이터로 하여금 얼굴 표정들의 공간으로부터 일련의 표정을 선택하게 함으로써 3차원 아바타의 표정을 실시간적으로 제어할 수 있도록 하기 위한 표정공간의 생성방법에 관하여 기술한다. 본 시스템에서는 약 2400여개의 얼굴 표정 프레임을 이용하여 표정공간을 구성하였다. 본 기법에서는 한 표정을 표시하는 상태표현으로 얼굴특징 점들 간의 상호거리를 표시하는 거리행렬을 사용한다. 이 거리행렬의 집합을 표정공간으로 한다. 그러나 이 표정공간은 한 표정이 다른 표정까지 이동할 때 두 표정간의 직선경로를 통해 이동할 수 있는 그런 공간이 아니다. 본 기법에서는 한 표정에서 다른 표정까지 거쳐 갈 수 있는 경로를 캡쳐된 표정 데이터로부터 근사적으로 유추한다. 우선, 각 표정상태를 표현하는 거리행렬간의 거리가 일정 값 이하인 경우 두 표정을 인접해 있다고 간주한다. 임의의 두 표정 상태가 일련의 인접표정들의 집합으로 연결되어 있으면 두 표정간에 경로가 존재한다고 간주한다. 한 표정에서 다른 표정으로 변화할 때 두 표정간의 최단경로를 통해 이동한다고 가정한다. 두 표정간의 최단거리를 구하기 위해 다이내믹 프로그래밍 기법을 이용한다. 이 거리행렬의 집합인 표정공간은 다차원 공간이다. 3차원 아바타의 얼굴 표정 제어는 애니메이터들이 표정공간을 항해할 때 실시간적으로 수행된다. 이를 도와주기 위해 표정공간을 차원 스케일링 기법을 이용하여 2차원 공간으로 가시화하였고, 애니메이터들로 하여금 본 시스템을 사용하여 실시간 표정 제어를 수행하게 했는데, 본 논문은 그 결과를 평가한다.참여하는 빈들 간의 관계를 분석하여 워크플로우에 대한 성능 측정이 가능하도록 한다. 또한 제안된 메트릭을 통하여 EJB 어플리케이션의 성능 향상을 도모할 수 있도록 한다.로 표면 위로 자라났고, 부종은 창상 밑 조직까지 감소하였으며, 육아조직은 교원질 섬유로 대체되었다. 창상 유발 21일 후, 다른 창상에 비해, HG 처치창은 유의적으로 창상 표면이 거의 재생성 상피로 덮였으며, 육아조직은 창상 유발 14일 후와 비교해서 유의적으로 교원질 섬유로 대체되었다. 위의 모든 결과에서 보듯이, 개에서 전층피부 창상의 처치 시 HG의 사용은 HC와 생리 식염수에 비해 창상치유 복구기의 치유 속도를 촉진하는 것으로 사료된다.시범학교의 자녀를 들 부모들은 환경관련문제에 대한 의식 및 환경관련 제품에 대한 구매행동의 변화가 두드러지게 나타났다.EX>$d^{2+}$ + SA처리구는 두 화합물의 이중 효과에 의해 전반적인 생리 활성을 억제하여, 결국에는 식물의 고사를 유도하는 것으로 사료된다.목에 대한 보안'이 가장 중요한 것으로 나타났다. 본 연구에서는 솔루션 선정요인에 관한 중요도를 e-마켓플레이스의 유형과 산업 별로 평가해보았는데, 여기에서 밝혀진 중요도를 통해 e 마켓플레이스를 구축하고 자 하는 기업은 솔루션을 자체 개발하거나 구입할 때 올바른 의사결정을 할 수 있다. 그리고 솔루션을 제공하려는 기업측면에서는 e-마켓플레이스를 구축하고자 하는 기업에게 유형과 산업별로 적절한 솔루션을 제공할 수 있다.순환이 뇌대사 및 수술 후 신경학적 결과에 보다 유익한 효과를 제공해 줄 수 있음

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.145-153
• /
• 2008

Existing shortest-path algorithms mainly consider a single attribute. But traveler actually chooses a route considering not single attribute but various attributes which are synthesized travel time, route length, personal preference, etc. Therefore, to search the optimal path, these attributes are considered synthetically. In this study route searching algorithm which selects the maximum utility route using discrete choice model has developed in order to consider various attributes. Six elements which affect route choice are chosen for the route choice model and parameters of the models are estimated using survey data. A multinomial logit models are developed to design the function of route choice model. As a result, the model which has route length, delay time, the number of turning as parameter is selected based on the significance test. We use existing shortest path algorithm, which can reflect urban transportation network such as u-turn or p-turn, and apply it to the real network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.131-140
• /
• 2012

The shortest path search algorithm of navigation is generally based on Dijkstra algorithm and considers only the distance using the weight. Dijkstra algorithm based on the distance mainly ought to perform the 'number of nodes 1' and requires a lot of memory, for it is to start from the starting node and to decide the shortest path for all the nodes. Also, it searches only the same identical path in case of any bottleneck due to an accident nearby, since it is based only on the distance, and hence does not have a system that searches the detour road. In order to solve this problem, this paper considers only the travelling time per road (travelling speed * distance), without applying speed criteria (smoothness, slow speed, stagnation and accident control) or road class (express road, national road and provincial road). This provides an advantage of searching the detour, considering the reality that there are differences in time take for the car to travel on different roads with same distance, due to any accident, stagnation, or repair construction. The suggested algorithm proves that it can help us to reach the destination within the shortest time, making a detour from any congested road (outbreak) on providing an information on traveling time continuously(real-time) even though there is an accident in a particular road.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.17-25
• /
• 2011

At the computer games, we can experience a variety of environments using a virtual object. It is similar to that be trained in War-game simulator of the defense. Actual soldiers and a computer-generated virtual group(Computer Generated Force: CGF) in 3-D virtual battlefield environment are training. However, path finding algorithm, one of the techniques of simulation models, to the current level only considers the shortest time path. So, this current level at the special situation of the army in the battlefield for selecting the optimal path is limited. The focus of this paper is to select the least-cost path using the deadline with several different mission conditions(METT+TC). For the only shortest time path algorithm and the least-cost path algorithm using dealine,($d_t$, one of METT+TC elements), Its usefulness is verifying the change of the move spent time(t) for all possible paths and the fighting power of the combat troops(Troops ability, a) through a comparison of the total cost of moves(c(t)). According to the results, when considering the deadline, the proposed algorithm saves about 62.5% of the maximum cost.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.46-55
• /
• 2012

This study proposes an estimate method of willingness to pay(WTP) for real-time route guidance systems using contingent valuation method(CVM) under double bounded dichotomous choice question(DBDCQ) and analysis for impact factors of WTP estimation. This study assumed that provided real-time traffic information service is optimal route concepts dealing with traffic conditions on origin-destination. Analysis targets were classified into two groups as short distance path and middle distance path for estimating WTP for realtime route guidance system in a year using the survival analysis method and the regression model with personal information, actual condition and satisfaction of information usage and users' awareness and usage of facilities. As a result, mean WTP of realtime route guidance system is 4,034won/year in short distance path, and 4,884won/year in middle distance path. Therefore real-time route guidance system for longer distance path is recognized as more valuable than shorter distance path. Moreover, the necessity of information was required on a higher income group and higher WTP was estimated on owners of vehicle group and lower awareness of a route group.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.