• Title/Summary/Keyword: 다수의 선박이 조우하는 경우

Search Result 3, Processing Time 0.015 seconds

Analysis of a Distributed Stochastic Search Algorithm for Ship Collision Avoidance (선박 충돌 방지를 위한 분산 확률 탐색 알고리즘의 분석)

  • Kim, Donggyun
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.25 no.2
    • /
    • pp.169-177
    • /
    • 2019
  • It is very important to understand the intention of a target ship to prevent collisions in multiple-ship situations. However, considering the intentions of a large number of ships at the same time is a great burden for the officer who must establish a collision avoidance plan. With a distributed algorithm, a ship can exchange information with a large number of target ships and search for a safe course. In this paper, I have applied a Distributed Stochastic Search Algorithm (DSSA), a distributed algorithm, for ship collision avoidance. A ship chooses the course that offers the greatest cost reduction or keeps its current course according to probability and constraints. DSSA is divided into five types according to the probability and constraints mentioned. In this paper, the five types of DSSA are applied for ship collision avoidance, and the effects on ship collision avoidance are analyzed. In addition, I have investigated which DSSA type is most suitable for collision avoidance. The experimental results show that the DSSA-A and B schemes offered effective ship collision avoidance. This algorithm is expected to be applicable for ship collision avoidance in a distributed system.

A Study on Cost Function of Distributed Stochastic Search Algorithm for Ship Collision Avoidance (선박 간 충돌 방지를 위한 분산 확률 탐색 알고리즘의 비용 함수에 관한 연구)

  • Kim, Donggyun
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.25 no.2
    • /
    • pp.178-188
    • /
    • 2019
  • When using a distributed system, it is very important to know the intention of a target ship in order to prevent collisions. The action taken by a certain ship for collision avoidance and the action of the target ship it intends to avoid influence each other. However, it is difficult to establish a collision avoidance plan in consideration of multiple-ship situations for this reason. To solve this problem, a Distributed Stochastic Search Algorithm (DSSA) has been proposed. A DSSA searches for a course that can most reduce cost through repeated information exchange with target ships, and then indicates whether the current course should be maintained or a new course should be chosen according to probability and constraints. However, it has not been proven how the parameters used in DSSA affect collision avoidance actions. Therefore, in this paper, I have investigated the effect of the parameters and weight factors of DSSA. Experiments were conducted by combining parameters (time window, safe domain, detection range) and weight factors for encounters of two ships in head-on, crossing, and overtaking situations. A total of 24,000 experiments were conducted: 8,000 iterations for each situation. As a result, no collision occurred in any experiment conducted using DSSA. Costs have been shown to increase if a ship gives a large weight to its destination, i.e., takes selfish behavior. The more lasting the expected position of the target ship, the smaller the sailing distance and the number of message exchanges. The larger the detection range, the safer the interaction.

A Study on Navigation Speed of Jet-foil Ships in Busan Port (부산항내 제트포일 여객선의 항해 속력에 대한 연구)

  • Park, Young-Soo;Jeon, Tae-Young;Park, Sung-Yong;Kim, Deug-Bong
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.19 no.4
    • /
    • pp.359-365
    • /
    • 2013
  • There are more than 10 ships and jetfoil passenger ships with speeds of 30~40 kts navigating between Japan and Busan ports per hour. Busan port has the highest density of traffic among the Korean ports and waterways. Jetfoil ships are the most frequently encountered amongst other vessels and about 18 % of passing jetfoil vessels violated port regulations. Based on the analysis of traffic survey carried out for 10 days, jetfoil vessels often overtook other vessels in route and deviated with high speed. This paper verified a proper speed and how to navigate in or out route of jetfoil ships by marine traffic flow simulation. A acceptable navigation speed for jetfoil vessel's mariner was calculated at less than about 32kts in Busan Port. It is a little different that shiphandling difficulty of jetfoil was almost the same whether passing in and out route in Busan Port. This paper proposes that the passing time of jetfoil ships should avoid the peak time to improve the traffic safety in Busan Port.