• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.69-74
• /
• 2011

In this paper, we propose a foot-and-mouth disease prevention system using the RTLS technology and $A^*$ algorithm-based optimal path search method to avoid foot-and-mouth disease areas. The main features and contributions of the proposed system are as follows. First, the proposed system is developed based on active-tag for identifying status and location information of livestock. Second, the system is newly designed based on $A^*$ algorithm for supporting optimal path search services. The performance evaluation of the proposed system is performed via simulation. The results of performance evaluation show that the proposed system can efficiently support the optimal path search services.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.463-466
• /
• 2009

MANET(Mobile Ad-Hoc Network) mean network that configured to mobile device without the help of Fixed infra. Node in MANET constraints have such as liquidity and battery. Node concentrated areas or the size of the network becomes large that causes some issues. It's the problem of routing overhead when path set, path navigation and reset path. In this paper ZRP(Zone Routing Protocol) and ZHLS(Zone-Based Hierarchical Link State) are analyzed. As a result, offers the Fixed ZRP.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.219-221
• /
• 2022

In recent summer, as it is concentrated, even in mountainous areas, flooding and flooding cause casualties in pedestrian evacuation situations. To compensate for this, a system that detects the occurrence of flooding and allows pedestrians to evacuate safely is required. Therefore, in this paper, we propose a research on pedestrian path search based on the shortest distance algorithm using Map API. The pedestrian route search system outputs a map using the T Map API, selects nearby buildings as shelters, and stores data. A shelter close to the pedestrian's current location is selected, and the shortest route is output and the distance and time are provided. If there is a problem with the current route during evacuation, another shelter route is provided from the current location. Therefore, it is thought that the pedestrian route search evacuation system proposed in this paper will prevent accidents during evacuation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.304-309
• /
• 2005

In this paper, we propose a localized Adaptive QoS Routing using TD method and evaluate performance of various exploration methods when path is selected. Expecially, through extensive simulation, the proposed routing algorithm and exploration method using Exploration Bonus are shown to be effective in significantly reducing the overall blocking probability, when compared to the other path selection method(exploration method), because the proposed exploration method is more adaptive to network environments than others when path is selected.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.4
• /
• pp.287-296
• /
• 2015

Recent navigation systems provide quick guide services, based on processing real-time traffic information and past traffic information by applying predictable pattern for traffic information. However, the current pattern for traffic information predicts traffic information by processing past information that it presents an inaccuracy problem in particular circumstances(accidents and weather). So, this study presented a more precise predictive traffic information system than historical traffic data first by analyzing route search data which the drivers ask in real time for the quickest way then by grasping traffic congestion levels of the route in which future drivers are supposed to locate. First results of this study, the congested route from Yang Jae to Mapo, the analysis result shows that the accuracy of the weighted value of speed of existing commonly congested road registered an error rate of 3km/h to 18km/h, however, after applying the real predictive traffic information of this study the error rate registered only 1km/h to 5km/h. Second, in terms of quality of route as compared to the existing route which allowed for an earlier arrival to the destination up to a maximum of 9 minutes and an average of up to 3 minutes that the reliability of predictable results has been secured. Third, new method allows for the prediction of congested levels and deduces results of route searches that avoid possibly congested routes and to reflect accurate real-time data in comparison with existing route searches. Therefore, this study enabled not only the predictable gathering of information regarding traffic density through route searches, but it also made real-time quick route searches based on this mechanism that convinced that this new method will contribute to diffusing future traffic flow.

• Journal of Advanced Navigation Technology
• /
• v.19 no.2
• /
• pp.116-122
• /
• 2015

Motivated by continuous increase in flight demand, awareness of the importance in developing ways to increase aircraft operational efficiency on the airport movement area has been raised. This paper proposes a new routing algorithm for providing the shortest path in a right time, enhancing the aircraft movement efficiency. Many researches on developing algorithms have been performed, for example, Dijkstra algorithm and $A^*$ algorithm. The Dijkstra algorithm provide optimal solution but could possibly provide it with a cost of relatively longer computation time. On the other hand, $A^*$ algorithm does not guarantee the optimality of a solution. In this paper, we suggest a Hybrid $A^*$ algorithm, incorporating both algorithms to eliminate the weaknesses. Rigorous test shows the proposed Hybrid $A^*$ algorithm may achieve shorter computing time and optimality in searching the shortest path.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.5D
• /
• pp.649-654
• /
• 2008

In the definition of non additive path, the sum of travel costs of links making up the path is not equal to the path cost. There are a variety of cases that non-additivity assumption does not hold in transportation fields. Nonetheless, traffic equilibrium models are generally built up on the fundamental hypothesis of additivity assumption. In this case traffic equilibrium models are only applicable within restrictive conditions of the path cost being linear functions of link cost. Area-wide road pricing is known as an example of realistic transportation situations, which violates such additivity assumption. Because travel fare is charged at the moment of driver's passing by exit gate while identified at entry gate, it may not be added linearly proportional to link costs. This research proposes a novel Wordrop type of traffic equilibrium model in terms of area-wide road pricing schemes. It introduces binary indicator variable for the sake of transforming non-additive path cost to additive. Since conventional shortest path and Frank-Wolfe algorithm can be applied without route enumeration and network representation is not required, it can be recognized more generalized model compared to the pre-proposed approaches. Theoretical proofs and case studies are demonstrated.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.1135-1136
• /
• 2023

자율주행에서의 경로 계획을 위해서는 costmap을 활용할 수 있다. Costmap은 map 정보와 센서 데이터를 토대로 해당 지역을 통과할 때의 위험도를 cost로 할당한다. 그러나 local costmap에는 센서로 인식한 장애물만이 고려되며, 차선 정보를 경로 계획에 포함하기 위해서는 별도의 정보 처리가 필요하다. 본 연구에서는 카메라로 인식한 차선 정보를 costmap에 포함함으로써 통합적인 판단 방법론을 탐색하고, 위치 추정 및 경로 계획에서의 활용 가능성을 제시한다.

• Journal of the Economic Geographical Society of Korea
• /
• v.10 no.1
• /
• pp.1-18
• /
• 2007

This study examines the development direction of Ulsan automobile cluster and suggests strategic interventions, based on the possibility of system transformation in the open economic system. The spatial characteristics of global, national and local production and R&D networks were analyzed to investigate the conditions of Ulsan automobile cluster. And the agglomeration process of automobile industry and the capabilities accumulated in Ulsan were analyzed and alternative developmental path and policy suggestions were proposed.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.40-53
• /
• 2018

In smart card data, movement of railway passengers appears in order of smart card terminal ID. The initial terminal ID holds information on the entering station's tag-in railway line, the final terminal ID the exit station tag-out railway line, and the middle terminal ID the transfer station tag subway line. During the past, when the metropolitan city rail consisted of three public corporations (Seoul Metro, Incheon Transit Corporation, and Korail), OD data was expressed in two metrics of initial and final smart card terminal ID. Recently, with the entrance of private corporations like Shinbundang Railroad Corporation, and UI Corporation, inclusion of entering transfer line terminal ID and exiting transfer line terminal ID as part of Chain OD has become standard. Exact route construction using Chain OD has thus become integral as basic data for revenue allocation amongst metropolitan railway transport corporations. Accordingly, path detection in railway networks has evolved to an optimal path detection problem using Chain OD, hence calling for a renewed solution method. This research proposes an optimal path detection method between the initial terminal ID and final terminal ID of Chain OD terminal IDs within the railway network. Here, private line transfer TagIn/Out must be reflected in optimal path detection using Chain OD. To achieve this, three types of link-based optimum path detection methods are applied in order of 1. node-link, 2. link-link, 3. link-node. The method proposed based on additional path costs is shown to satisfy the optimal conditions.