• 해양환경안전학회지
• /
• 제23권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.

• 한국ITS학회 논문지
• /
• 제4권3호
• /
• pp.9-22
• /
• 2005

교통망에서 경로의 총 통행비용은 통행비용과 인지비용으로 구분된다. 출발지와 도착지간에 상이하게 인지되는 비용을 고려하여 경로를 탐색하는 것은 전체경로를 열거해야 하는 문제 때문에 현실 적용에 한계가 있다. 따라서 현재 활용되고 있는 첨단교통정보체계(ATIS)에서 경로정보를 제공할 때 통행비용 만을 고려하여 경로를 탐색하는 기법을 적용하는 것이 일반적이다. 본 연구는 경로열거문제 없이 상이한 링크인지비용을 반영하는 최적 및 K 경로탐색기법을 제안한다. 이를 위해 링크를 경로의 최소단위로 정의하고, 따라서 두 링크의 비교가 경로의 비교로 확대되는 링크표지기반경로탐색기법을 활용하며, 도착지를 기반으로 후방향 최적링크인지경로트리를 구축한 후 출발지기반으로 전방향 최적의 링크총비용 경로트리를 구축하는 수식과 알고리즘을 제안한다.

• 한국항해항만학회지
• /
• 제47권2호
• /
• pp.75-84
• /
• 2023

Ships need to ensure safety during their navigation, which makes route determination highly important. It must be accompanied by a route following controller that can accurately follow the route. This study proposes a method for automatically generating the ship route based on deep reinforcement learning algorithm and following it using a route following controller. To generate a ship route, under keel clearance was applied to secure the ship's safety and navigation chart information was used to apply ship navigation related regulations. For the experiment, a target ship with a draft of 8.23 m was designated. The target route in this study was to depart from Busan port and arrive at the pilot boarding place of the Ulsan port. As a route following controller, a velocity type fuzzy P ID controller that could compensate for the limitation of a linear controller was applied. As a result of using the deep Q network, a route with a total distance of 62.22 km and 81 waypoints was generated. To simplify the route, the Douglas-Peucker algorithm was introduced to reduce the total distance to 55.67 m and the number of way points to 3. After that, an experiment was conducted to follow the path generated by the target ship. Experiment results revealed that the velocity type fuzzy P ID controller had less overshoot and fast settling time. In addition, it had the advantage of reducing the energy loss of the ship because the change in rudder angle was smooth. This study can be used as a basic study of route automatic generation. It suggests a method of combining ship route generation with the route following control.

• 제어로봇시스템학회논문지
• /
• 제3권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.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2008년도 추계학술대회 논문집
• /
• 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.

• Journal of Communications and Networks
• /
• 제7권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.

• 한국항해항만학회지
• /
• 제27권4호
• /
• pp.479-484
• /
• 2003

지선버스 노선선정의 경우, 전체 네트워크로서의 노선선정 보다는 지하철 역 등의 특정 기ㆍ종점과의 연계차원에서 단일 노선으로 취급하여 노선선정을 행함이 바람직하다. 본 연구에서는 이와 같은 관점 하에 정류장 대기시간, 환승시간 등은 고려하지 않고, 일정 기ㆍ종점을 연결하는 지선노선 선정을 위한 간편 기법을 구축하였다. 검토대상 도로망 한정, 허용노선장에 의한 후보노선의 열거, 노선평가치에 의한 최종 노선의 선정 등의 3가지 단계를 통해 지선기능으로서의 마을버스 노선을 선정하는 기법을 구축하였다.

• 한국정보과학회논문지:정보통신
• /
• 제33권1호
• /
• pp.49-58
• /
• 2006

애드 흑 네트워크의 요구 기반 라우팅 프로토콜은 노드가 이동하여 경로가 손실되는 경우, 경로 유지를 위해 지역 탐색을 수행하거나 송신 노드가 새 경로 탐색을 수행하여 경로를 유지한다. 새 경로탐색이나 지역 경로 탐색을 수행할 경우, 전송중인 패킷의 지연이 발생한다. 경로 손실로 인한 지연을 줄이기 위해 경로 손실을 예측하고 대체 경로를 구성하여 경로 손실 지연을 줄이는 기법으로써 ARMP와 RPAODV가 있다. 이 라우팅 프로토콜은 링크 상태가 불안정 상태가 될 때, 지역적으로 대체 경로를 구성하여 경로 손실을 회피하는 기법으로써 대체 경로 생성의 성공률은 경로 손실과 전송 지연에 직접적인 영향을 가져온다. 본 연구에서는 이전에 제안된 경로 손실 회피 라우팅 기법들의 효율성을 검증하기 위해서 대표적인 요구 기반 라우팅 프로토콜인 AODV, 경로 손실 회피 라우팅 기법인 ARMP와 RPAODV의 수치 평가식을 제안하고, 각 프로토콜의 성능을 평가하였다. 또한, 제안한 수치 평가식의 효용성을 검증하기 위해서 컴퓨터 시뮬레이션 결과와 비교 분석한다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2010년도 춘계학술발표대회
• /
• 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에 필요한 메시지 수가 적기 때문에 시그널링 비용이 감소한다.

• 한국측량학회지
• /
• 제9권2호
• /
• pp.127-138
• /
• 1991

본 연구는 지형정보시스템을 활용한 최적 노선선정에 관한 연구이다. 일반적으로 노선의 선정은 후보노선대, 최적노선대, 최적노선의 선정 순으로 이루어지는데 본 연구에서는 노선선정계획의 마지막 부분인 최적노선선정부분을 고려하였다. 최적노선의 선정은 연구대상지역을 일정한 크기의 정규형격자로 구분하고, 각 정규형격자에 토지이용현황, 지가, 경상도 등을 고려하여 얻어진 가중치를 적용하였다. 이를 지형 정보시스템의 속성 데이타로 활용하여 노선선정에 적용되는 가중치의 특정부분으로 고려하고, 세개의 노선을 선정하였다. 이들 세개의 노선을 비교ㆍ분석하여 실제노선의 선정과정에서 지형정보시스템의 활용 가능성을 제시하고자 하였다.