시간 가중치 기반 효율적인 최적 경로 탐색 기법 연구 = Search Algorithm for Efficient Optimal Path based on Time-weighted

다국어 초록 (Multilingual Abstract)

In this paper, we propose an optimal path search algorithm between each node and midpoint that applies the time weighting. Services for using a location of mid point usually provide a mid point location-based on the location of users. There is a problem that is not efficient in terms of time because a location-based search method is only considered for location. To solve the problem of the existing location-based search method, the proposed algorithm sets the weights between each node and midpoint by reflecting user's location information and required time. Then, by utilizing that, it is possible to search for an optimum path. In addition, to increase the efficiency of the search, it ensures high accuracy by setting weights adaptively to the information given. Experimental results show that the proposed algorithm is able to find the optimal path to the midpoint compared with the existing method.

참고문헌 (Reference)

1 배상훈, "장거리 최적경로탐색을 위한 부분탐색기법 연구" 대한토목학회 26 (26): 361-366, 2006

2 김용태, "센서 노드의 위치와 거리 정보를 기반으로 전송 경로를 최적화하는 라우팅 프로토콜" 한국디지털정책학회 13 (13): 127-133, 2015

3 배혜지, "사용자의 위치와 선호도에 기반한 약속 장소 추천 모바일 애플리케이션 구현" 한국정보과학회 21 (21): 403-411, 2015

4 강현중, "다계층 네트워크에서 동적 자원 할당 체계 방식 연구" 한국융합보안학회 13 (13): 77-82, 2013

5 유견아, "가중치 학습과 결합된 전술적 경로 찾기의 구현" 한국시뮬레이션학회 19 (19): 91-98, 2010

6 F. M. Chowdhury, "The Unidirectional Edge Method : A New Approach for Solving Point Enclosure problem for Arbitary Polygon" 4 (4): 537-540, 2005

7 홍성혁, "Research on Security Model and Requirements for Fog Computing: Survey" 한국융합학회 9 (9): 27-32, 2018

8 V. Tereshchenko, "Point triangulation using Graham’s scan" 2015

9 D. Kularathne, "Point in Polygon Determination Algorithm for 2-D Vector Graphics Applications" IEEE 2018

10 C. W. Huang, "On the complexity of point-in-polygon algorithms" 23 (23): 109-118, 1997

11 정구임, "LBSNS 기반 장소 추천 시스템" 한국디지털정책학회 12 (12): 277-287, 2014

12 P. Mitura, "Effective Construction of Convex Hull Algorithms" 105-112, 2017

13 G. S. Nam, "Development of An Optimal Path Finding System(X-Path) : An Interim Report" 486-505, 1995

14 P. Bourke, "Determining if a point lies interior of Polygon"

15 E. Y. Jeong, "Analytic proofs of theorems in the plane geometry using homogeneous barycentric coordinates on triangles" Konkuk University 2009

16 G. Ronald., "An efficient algorithm for determining the convex hull of a finite planar set" 1 : 132-133, 1972

17 O. Rakhmanov, "A new approach (extra vertex) and generalization of Shoelace Algorithm usage in convex polyon (Point-in-Polygon)" 2019

18 왕춘염, "A Study on the Characteristics of the Seasonal Travel Path of Individual Chinese Travellers in Korea" 한국융합학회 10 (10): 23-31, 2019

19 박성택, "A Study on Deriving an Optimal Route for Foreign Tourists through the Analysis of Big Data" 중소기업융합학회 9 (9): 56-63, 2019