• Title/Summary/Keyword: 도로망

Search Result 226, Processing Time 0.232 seconds

A Heuristic Path-Finding Scheme Based on the Road Hierarchy (도로망의 계층성을 이용한 휴리스틱 주행 경로 탐색)

  • 김기홍;유승원;강현민;차상균
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.183-185
    • /
    • 1999
  • 주행 경로 안내는 최근 국내에서도 활발히 연구되고 있는 지능형 교통 시스템(ITS)의 주요 기능 중 하나이다. 주행 경로 안내를 위해서는 대규모 도로망에서 신속하게 경로를 찾는 방법과 찾은 경로를 음성 또는 기호로 운전자에게 효율적으로 안내하는 방법등이 필요하다. 본 논문에서는 도로망의 계층성을 휴리스틱 정보로 활용하여 최단시간 경로를 효율적으로 찾는 방법을 제안한다. 제안된 방법은 고속국도, 국도 등의 고속 주행용 도로만으로 소규모 상위 계층 도로망을 만들고 이를 기존 도로망에 덧붙이는 방식으로 통합한다. 이 통합망에 상위 계층 도로망을 우선적으로 찾도록 구성한 A* 알고리즘을 수행하여 최단시간 경로를 찾는다. 또 경로 탐색용 그래프가 디스크에 저장된 경우에, 디스크 접근을 최적화하기 위한 데이터베이스 설계 및 디스크 접근 방법을 기술한다. 제안된 방법의 효율성을 검증하기 위해 서울시 도로망 데이터를 이용하여 실험한 결과, 제안된 방법을 통해 경로 탐색 소요 시간, 디스크 입출력 회수, 메모리 사용량 등을 75%이상 줄일 수 있었다.

  • PDF

A Coarse Grid Method for the Real-Time Route Search in a Large Network (복잡한 대규모의 도로망에서 실시간 경로 탐색을 위한 단계별 세분화 방법)

  • Kim, Seong-In;Kim, Hyun-Gi
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.5
    • /
    • pp.61-73
    • /
    • 2004
  • The efficiency of the real-time route guidance system(RGS) depends largely on the quality of route search algorithms. In this paper, we implement the coarse grid method(CGM) in mathematical programming for finding a good quality route of real-time RGS in large-scale networks. The proposed CGM examines coarser and wider networks as the search phase proceeds, in stead of searching the whole network at once. Naturally, we can significantly reduce computational efforts in terms of search time and memory requirement. We demonstrate the practical effectiveness of the proposed CGM with nationwide real road network simulation.

A fast shortest path algorithm for road networks having turn prohibitions (회전제한이 있는 도로망을 위한 고속 최적경로 알고리즘)

  • 성태경;명선영;홍원철
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.3
    • /
    • pp.73-85
    • /
    • 1999
  • In metropolitan area, intersections having turn Prohibitions are often found and it is important to consider them in path planning. This Paper presents a new path planning method road networks having turn prohibitions. A new road network model is proposed in which an alter-native route for each turn-Prohibition is constructed in off-line using U-turn or P-turn and then Put into road network database. The proposed network model is efficient since it requires no virtual nodes that are usually used in the conventional road networks to represent turns at intersections. In order to find a shortest path with the proposed network, a new shortest path algorithm is proposed. A knot for the turn-Prohibited node is newly defined and is used in comparing the cost of the alternative route with that of the other path.

  • PDF

Shortest Paths on the L$_1$ Plane with a Transportation Network (도로망이 설치된 L$_1$평면에서의 최단경로 문제)

  • 배상원;좌경룡
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.724-726
    • /
    • 2004
  • 본 논문에서는 L$_1$평면상에 도로망이 주어져 있어서 여행자들이 그 도로들을 이용하여 더욱 빠르게 이동할 수 있는 가정 하에서 가장 기초적인 기하문제 중에 하나인 두 점 사이의 최단 경로를 찾는 문제를 다룬다. 이 때, 두 점 사이의 거리는 L$_1$ 거리가 아닌 주어진 도로들을 이용하여 두 점 사이를 이동할 때 필요한 최소시간으로 측정한다. 단순한 평면상에서의 최단경로와는 달리 도로망이 설치되어 있는 경우는 그것을 해결하기가 일반적으로 쉽지 않다. 본 논문에서는 도로망이 있는 평면에 대한 깊은 관찰과 이해를 통해 도로망이 설치되어 있는 L$_1$ 평면상에서의 최단경로 문제를 해결하는 효율적인 알고리즘을 제시한다. 덧붙여, 본 논문에서 제시하는 문제 해결 방법은 L$_1$ 평면뿐만 아니라 유클리드 평면에도 어렵지 않게 적용할 수 있으며 보로노이 다이어그램으로의 일반화도 간단하다.

  • PDF

Indexing Method for Constraint Moving Objects Using Road Connectivity (도로의 연결성을 이용한 제약적 이동 객체에 대한 색인 기법)

  • Bok, Kyoung-Soo;Yoon, Ho-Won;Seo, Dong-Min;Rho, Jin-Seok;Cho, Ki-Hyung;Yoo, Jae-Soo
    • 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.

Signal Optimization Model Considering Traffic Flows in General Traffic Networks (일반적인 네트워크에서의 신호최적화모형 개발 연구)

  • 신언교;김영찬
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.2
    • /
    • pp.127-135
    • /
    • 1999
  • Most existing progression bandwidth models maximize the single or multi weighted sum of bandwidths in the both directions to improve traffic mobility on an arterial, but they cannot be applied to general networks. Even though a few models formulating a looped network problem cannot be applied to networks have not loops. Also they have some defects in optimizing phase sequences. Therefore, the objective of this study is to develope a mathematical formulation of the synchronization problem for a general traffic network. The goal is achieved successfully by introducing the signal phasing for each movement and expanding the mixed integer linear programming of MAXBAND. The experiments indicate that the proposed model can formulate the general traffic network problem mere efficiently than any other model. In conclusion, this model may optimize signal time to smooth progression in the general networks.

  • PDF

세계사에서의 무기발달과 전술 전략의 변화 VIII

  • Heo, Jung-Gwon
    • Defense and Technology
    • /
    • no.2
    • /
    • pp.54-63
    • /
    • 2001
  • 샤를마뉴가 발전시킨 군사 제도 중 핵심 요소는 국경의 요새화된 기지와 도시의 이용에 있었다. 이러한 것은 모든 정복된 지역들의 국경을 따라 구축되어, 국경을 따라 이어진 도로망에 의해 서로 연결되어 있었다. 여기에 추가하여 각각의 소도시들과 연결되는 이전의 국경에 직접적으로 연결되는 도로망이 있었다. 보급품을 저장한 이 요새들은 훈련된 프랑크 기병부대의 기동 기지가 되었고, 정복된 지역들에 질서를 유지하게 하였고, 차후의 작전을 구사하는 프랑크 군의 힘이 되었다.

  • PDF

An Efficient Pre-computing Method for Processing Continuous Skyline Queries in Road Networks (도로망에서 연속적인 스카이라인 절의처리를 위한 효율적인 전처리기법)

  • Jang, Su-Min;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.36 no.4
    • /
    • pp.314-320
    • /
    • 2009
  • Skyline queries have recently received considerable attention in the searching services. The skyline contains interesting objects that are not dominated by any other objects on all dimensions. Many related works have processed a skyline on static data or on moving objects in Euclidean space. However, this paper assumes that the point of a skyline query continuously moves in road networks. We propose a new method that efficiently processes continuous skyline queries in road networks through pre-computed shortest range data of objects. Our experiments show that the proposed method is about 100 times faster than previous methods in terms of query processing time.

A Study on Road Detection Based on MRF in SAR Image (SAR 영상에서 MRF 기반 도로 검출에 관한 연구)

  • 김순백;김두영
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.2
    • /
    • pp.7-12
    • /
    • 2001
  • In this paper, an estimation method of hybrid feature was proposed to detect linear feature such as the road network from SAR(synthetics aperture radar) images that include speckle noise. First we considered the mean intensity ratio or the statistical properties of locality neighboring regions to detect linear feature of road. The responses of both methods are combined to detect the entire road network. The purpose of this paper is to extract the segments of road and to mutually connect them according to the identical intensity road from the locally detected fusing images. The algorithm proposed in this paper is to define MRF(markov random field) model of the priori knowledge on the roads and applied it to energy function of interacting density points, and to detect the road networks by optimizing the energy function.

  • PDF

A Study on Automatic Threshold Selection in Line Simplification for Pedestrian Road Network Using Road Attribute Data (보행자용 도로망 선형단순화를 위한 도로속성정보 기반 임계값 자동 선정 연구)

  • Park, Bumsub;Yang, Sungchul;Yu, Kiyun
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.4
    • /
    • pp.269-275
    • /
    • 2013
  • Recently, importance of pedestrian road network is getting emphasized as it is possible to provide mobile device users with both route guidance services and surrounding spatial information. However, it costs a tremendous amount of budget for generating and renovating pedestrian road network nationally, which hinder further advances of these services. Hence, algorithms extracting pedestrian road network automatically based on raster data are needed. On the other hand, road dataset generated from raster data usually has unnecessary vertices which lead to maintenance disutility such as excessive turns and increase in data memory. Therefore, this study proposed a method of selecting a proper threshold automatically for separate road entity using not only Douglas-Peucker algorithm but also road attribute data of digital map in order to remove redundant vertices, which maximizes line simplification efficiency and minimizes distortion of shape of roads simultaneously. As a result of the test, proposed method was suitable for automatic line simplification in terms of reduction ratio of vertices and accuracy of position.