• Title/Summary/Keyword: Route

Search Result 5,154, Processing Time 0.139 seconds

A Study for Technique of Detecting the Real-time Route Aberrance in the Passage Route Using Ship's Domain Theory

  • Gang, Sang-Guen
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.23 no.3
    • /
    • pp.273-278
    • /
    • 2017
  • This paper is to study a technique to detect the real-time route aberrance on the passage route using bumper area of the ship domain theory. In order to evaluate the risk of route aberrance, a quarter line was created between the center line and the outer line, and a passage route with the image line outside the outer line was designed. It calculated the real-time route aberrance with the vessel bumper area to measure the risk level on the passage route. The route aberrance using overlap bumper area was simulated through three kinds of scenario vessel at the designed passage route. In this paper, we proposed Ratio to Aberrance Risk as one of the evaluation parameter to detect the route aberrance risk at each sector in the passage route and to give the evaluation criteria of 5 levels for seafarer's navigation safety. The purpose of this work is to provide the information of the route aberrance to seafarer automatically, to make it possible to prevent the human errors of seafarer on the high risk aberrance route. As the real-time risk of route aberrance on the passage route is automatically evaluated, it was well thought that seafarer can have only a little workload in order to know the risk of route aberrance at early-time. Following the further development of this work, the techniques for detecting the real-time route aberrance will be able to use the unmanned vessel.

A Route Information Provision Strategy in ATIS Considering User's Route Perception of Origin and Destination (ATIS에서 기종점의 경로인지특성을 반영한 경로정보제공방안)

  • Cho Chong-Suk;Sohn Kee-Min;Shin Seong-Il
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.4 no.3 s.8
    • /
    • pp.9-22
    • /
    • 2005
  • Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm.

  • PDF

Choice Behavior of the Third Pedestrian Route in Mixed-use Complex (복합건축의 일상적 이동에서 나타나는 제3의 동선 선택 행동)

  • Lee, Jin-Kyoung;Jeong, Yong-Kyo;Kim, Chan-Ju;Lee, Sang-Ho
    • Journal of the Architectural Institute of Korea Planning & Design
    • /
    • v.33 no.5
    • /
    • pp.3-11
    • /
    • 2017
  • The purpose of the study is to analyze the behavior of pedestrian route choice and the factors affecting pedestrian route selection in Mixed-use complex. For the study, surveys and interviews are performed to find out the factor for pedestrian route choice in Mixed-use complex. Through the analysis, circulation planning is developed that is efficiently applied to both typical and emergency situations. The study is accomplished by the following steps: First, literature reviews are performed related to pedestrian movement model and route choice model. Second, surveys and interviews are carried out focusing on the factor of route choice at each section in Mixed-use complex pedestrian route. Third, pedestrian route and route choice factor are analyzed based on the result of survey and interview. Finally, circulation planning is derived considering the pedestrian route and route choice behavior.

An optimal and genetic route search algorithm for intelligent route guidance system (지능형 주행 안내 시스템을 위한 유전 알고리즘에 근거한 최적 경로 탐색 알고리즘)

  • Choe, Gyoo-Seok;Woo, Kwang-Bang
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.2
    • /
    • pp.156-161
    • /
    • 1997
  • In this thesis, based on Genetic Algorithm, a new route search algorithm is presented to search an optimal route between the origin and the destination in intelligent route guidance systems in order to minimize the route traveling time. The proposed algorithm is effectively employed to complex road networks which have diverse turn constrains, time-delay constraints due to cross signals, and stochastic traffic volume. The algorithm is also shown to significantly promote search efficiency by changing the population size of path individuals that exist in each generation through the concept of age and lifetime to each path individual. A virtual road-traffic network with various turn constraints and traffic volume is simulated, where the suggested algorithm promptly produces not only an optimal route to minimize the route cost but also the estimated travel time for any pair of the origin and the destination, while effectively avoiding turn constraints and traffic jam.

  • PDF

A Study on the Standardization for Railway Route Control Locking Logic (철도 진로 제어 연동 로직의 표준화를 위한 연구)

  • Jeong, Seung-Ki;Kim, Myung-Soo
    • Proceedings of the KSR Conference
    • /
    • 2008.11b
    • /
    • pp.1220-1226
    • /
    • 2008
  • A route control in railway is one of the very important system to operate a train. An efficient train route control assures to increase train operation performance with a same railway system. The erroneous route control can accompany serious accidents which occur train collision or derailment which provokes death. A Route control carries out exactly lest the accident should take place. An interlocking table is widely used for the exact route control. The table has the problem of its exactness proving because it has been established by experts. In this paper, We tried to formalize a route control using mathematical logic. A route consists of symbolized tracks, signals, switch and crossing. It represents as a set, respectively. We proposed route setting control logic, converted the elements to set logics and construct route logics with the set logics of the elements. Finally we proposed a model which presents a prototype routes and we proved the proposed logics using the proposed method.

  • PDF

A Study on the Feeder Transit Route Choice Technique (대중교통 지선노선 선정기법에 관한 연구)

  • Bae, Gi-Mok
    • Journal of Navigation and Port Research
    • /
    • v.27 no.4
    • /
    • pp.479-484
    • /
    • 2003
  • In the case of the feeder bus route choice, it is more desirable to choose the route by treating as a single route linked from origin to destination than the whole network. This study is to establish a concept that frames the feeder bus route choice technique for the change of the existing single bus route or the creation of the new feeder bus route. The concept of the feeder bus route choice technique in this study is not to frame the whole bus network but to frame a single route to a unit O-D pair. So, this study has the assumption that does not consider the waiting and transfer time at the bus stop. This system technique consists of the following phases: I) limitation of the road network examined for the study, ii) enumeration of the appropriate candidate routes by the permissive route length, and iii) determination of the optimum bus route by the route evaluation value.

A Performance Analysis of Routing Protocols Avoiding Route breakages in Ad hoc Networks (애드 흑 네트워크에서 경로 손실 회피 라우팅 프로토콜의 성능평가)

  • Wu Mary;Jung Sang Joon;Jung Youngseok;Kim Chonggun
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.1
    • /
    • pp.49-58
    • /
    • 2006
  • When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.

ARM: Anticipated Route Maintenance Scheme in Location-Aided Mobile Ad Hoc Networks

  • Park Seungjin;Yoo Seong-Moo;Al-Shurman Mohammad;VanVoorst Brian;Jo Chang-Hyun
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.325-336
    • /
    • 2005
  • Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

A Study on the Optimal Route Surveying Shooting Technique Using Unmanned Aerial Vehicles (UAV) (무인비행체(UAV)를 활용한 최적의 노선측량 촬영기법 연구)

  • Yun, Bu-Yeol
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.24 no.2_2
    • /
    • pp.127-134
    • /
    • 2021
  • Route surveying refers to surveying for the planning and construction of facilities built over a narrow and long distance such as roads, railroads, waterways, pipelines, transmission lines, and ropeways. The general route surveying method is an important process so that the center of the route is connected and staked, and vertical and cross-sectional surveys are performed along the center line to calculate the amount of construction work according to the slope and plan height of the route, and to prepare detailed drawings after skeleton surveying. If various basic drawings are calculated using an unmanned aerial vehicle for such route surveying, it is believed that the effects of shortening the process and reducing construction costs can be obtained. Therefore, this study attempted to contribute to the improvement of reliability in the application of route surveying using an unmanned aerial vehicle by deriving an optimal photographing technique by conducting route photography in various ways.

Route Optimization Using Correspondent Information handover on Proxy Mobile IPv6 (Proxy Mobile IPv6에서 Correspondent Information Route Optimization 기법의 핸드오버)

  • Choi, Young-Hyun;Chung, Tai-Myoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.641-644
    • /
    • 2010
  • Proxy Mobile IPv6에서는 같은 Local Mobility Anchor 내의 다른 Mobile Access Gateway에 있는 Mobile Node 들의 패킷 전송에 있어서 발생하는 삼각 라우팅 문제는 여전히 존재한다. 이 문제점을 해결하기 위해 인터넷 드래프트 Liebsch와 Dutta에서 제안된 두 가지 Route Optimization 기법의 동작과정을 알아보고, 상호 데이터 전송 상황에서 더 나은 성능을 제공하는 Correspondent Route Optimization 기법을 제안한다. 통신을 맺고 있던 Mobile Node가 Local Mobility Anchor 내 다른 Mobile Access Gateway의 범위로 이동할 경우 발생하는 핸드오버 상황에서 Correspondent Route Optimization 기법을 사용하여 signaling cost를 줄이는 방법을 제안한다. 제안한 Route Optimization 기법은 Correspondent Flag를 추가하여 Mobile Access Gateway 간 Corresponding Binding을 완료하여, Route Optimization을 설정한다. 제안한 Correspondent Route Optimization 기법은 기존의 기법보다 상호 데이터 전송 상황에서 Route Optimization에 필요한 메시지 수가 적기 때문에 시그널링 비용이 감소한다.

  • PDF