• Title/Summary/Keyword: 대수속력

Search Result 11, Processing Time 0.028 seconds

A Study on Speed Limit Rules under Sailing Regulations - Focusing on the Perspective of VTS Control - (항법상 속력의 제한규칙에 관한 고찰 - VTS의 관제 관점에서 -)

  • Chong, Dae-Yul
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.28 no.2
    • /
    • pp.254-261
    • /
    • 2022
  • Every vessel shall proceed at a safe speed to avoid collision. Additionally, every vessel shall comply with the speed limit rules in the territorial water and internal waters of Korea. The VTS operator shall properly control the compliance of the vessel with the safe speed and speed limit rules. Safe speed under the COLREG 1972 is not explicitly stipulated in knots. However, under the Domestic law for traffic safety-specific sea areas, etc., the speed limit is specified in knots and complied with. This speed limit rule is mainly based on the 'speed made good over the ground'; however, in some places, it is based on the 'speed making way through the water'. In this paper, I analyzed marine accidents that occurred in the past 5 years and the rate of violation of speed limits. Furthermore, I reviewed safe speed under the COLREG 1972, speed limit rules under domestic and foreign laws, and cases of non-compliance with safe speed in the judgment of the Korea Maritime Safety Tribunal. Resultantly, I suggested in this paper that the speed limit rules in the domestic law must be observed by vessels to prevent marine accidents, and the rules which are stipulated in terms of 'speed making way through the water' must be revised as 'speed made good over the ground' such that the vessels can easily comply with them and the VTS operator can control the vessel properly.

Implementation of Path-finding Algorithm with Maximum Speed Dynamic Heuristic (최고속력 동적휴리스틱을 활용한 경로탐색 알고리즘의 구현)

  • Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.08a
    • /
    • pp.87-90
    • /
    • 2008
  • Dynamic Heuristic(DH) is not fixed data and is dynamically modified using transferred real time road data from server In this paper, we propose path-finding algorithm with Maximum Speed Dynamic Heuristic (DH-MAX) and do an experiment. The DH-MAX is to be used the highest speed as DH, in real map divided by same sire. And proposed algorithm searches path using the priority searching only of the fixed data, but also the highest speed with real time information. In the performance test, the quality of path is enhanced but the cost of searching is increased than $A^*$ algorithm.

  • PDF

Assessment of External Force Acting on Ship Using Big Data in Maritime Traffic (해상교통 빅데이터에 의한 선박에 작용하는 외력영향 평가에 관한 연구)

  • Kim, Kwang-Il;Jeong, Jung Sik;Park, Gyei-Kark
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.5
    • /
    • pp.379-384
    • /
    • 2013
  • For effective ship management in VTS(Vessel Traffic Service), it needs to assess the external force acting on ship. Big data in maritime traffic can be roughly categorized into two groups. One is the traffic information including ship's particulars. The other is the external force information e.g., wind, sea wave, tidal current. This paper proposes the method to assess the external force acting on ship using big data in maritime traffic. To approach Big data in maritime traffic, we propose the Waterway External Force Code(WEF code) which consist of wind, wave, tidal and current information, Speed Over the Water(SOW) of each ship, weather information. As a results, the external force acting a navigating ship is estimated.

Difference in biomasses depending on apllication of speed over the ground and speed through the water during biomass estimation of Metapenaeus joyneri via swept area methods (소해면적법에 의한 중하(Metapenaeus joyneri) 자원량 추정 시 대지속력과 대수속력 사용에 따른 자원량 차이)

  • Young-Hwan JOO;Min-Son KIM;Hyun-Su JO
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.60 no.1
    • /
    • pp.27-36
    • /
    • 2024
  • The towing distance, which is speed over the ground, and the water flow quantity, which is speed through the water, were used when estimating the amount of Metapenaeus joyneri resources that rose to the surface at night using the swept area method in order to compare and analyze the difference. It was conducted using a shrimp dredge, trial fishing gear for catching Metapenaeus joyneri. Catch during the entire survey period was 188.9 kg. Monthly catch ranged from 3.1 to 109.2 kg, highest in June and lowest in September. The swept volume calculated using the speed over the ground was about 13% higher than using the speed through the water. Metapenaeus joyneri resources estimated using the towing distance ranged from 320.1 to 14,649.8 kg. Resources estimated using the water flow quantity ranged from 278.5 to 12,886.3 kg. Therefore, the amount of Metapenaeus joyneri resources estimated using the speed over the ground was about 14% higher than the method using the speed through the water, indicating that the amount of resources was overestimated.

Path Finding with Maximum Speed Dynamic Heuristic (최고 속력 동적 휴리스틱을 이용한 경로탐색)

  • Kim, Ji-Soo;Lee, Ji-Wan;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1615-1622
    • /
    • 2009
  • Generally, the Terminal Based Navigation System(TBNS) used embedded road data searches a path that has less qualitative than The Center Based Navigation System(CBNS). TBNS has not used real time road data but it is recently able to use it with technique such as TPEG. However, it causes to increase a cost of exploring by using real time road data for improvement quality of a path, because of limited performance. In this paper, we propose a Dynamic Heuristic to improve quality of path in the TBNS. Dynamic Heuristic(DH) is not fixed data and is dynamically modified using transferred real time road data from server. In this paper, we propose path-lading algorithm with Maximum Speed Dynamic Heuristic (DH-MAX) and do an experiment. The DH-MAX is to be used the highest speed as DH, in real map divided by same size. And proposed algorithm searches path using the priority searching only of the fixed data, but also the highest speed with real time information. In the performance test, the quality of path is enhanced but the cost of searching is increased than A* algorithm.

A Study on the Improvement of Sailing Efficiency Using Big Data of Ship Operation (선박 운항 빅데이터를 활용한 운항 효율 향상 방법 연구)

  • Shin, Jung-Hun;Shim, Jeong-Yeon;Park, Jin-Woo;Choi, Dae-Han;BYEON, Sang-Su
    • Proceedings of KOSOMES biannual meeting
    • /
    • 2017.04a
    • /
    • pp.244-244
    • /
    • 2017
  • Recently, A study is actively underway to apply to various industries, which are one of the major changes in the key drivers of the industry 4.0.. The data generated by the ship include various indicators such as the fuel volume, engine power, ground speed, speed, speed, main engine rpm, DFOC, SFOC, and FOC. This paper analyzes the sensitivity of the Gathering data and analyzes the impact energy efficiency of the vessel operation by analyzing the influence among each parameter, using the mathematical models, you create an surrogate model using the math model, comparative analysis of actual measurement data and predictive results were analyzed. Through the use of big data analysis technology, it is possible to identify the sensitivity between the energy efficiency related variables of the ship, The possibility of utilization of fuel efficiency indicators using of the surrogate model is identified.

  • PDF

Design of Max Speed Dynamic Heuristic with Real Time Transportation Data (실시간 도로 정보를 이용한 최고속력 동적 휴리스틱의 설계)

  • Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.827-830
    • /
    • 2008
  • The Center Based Navigation System(CBNS) used real time road data searches an optimal path. The other hand, the Terminal Based Navigation System(TBNS) used embedded road data searches a path that has less qualitative than the CBNS. But the TBNS has been favored, because it has no additional fees. Generally, TBNS has not used real time road data but it is recently able to use it with technique such as TPEG. However, it causes to increase a cost of exploring by using real time road data for improvement qualify of a path, because of limited performance. We propose a path-finding algorithm using a Maximum peed Dynamic Heuristic to improve quality and reduce a cost of exploring. Proposed method is to use a maximum road speed of appropriate region as dynamic heuristic for path-finding.

  • PDF

Enhanced Methods of Path Finding Based on An Abstract Graph with Extension of Search Space (탐색 영역 확장 기법들을 활용한 추상 그래프 기반의 탐색 알고리즘 성능 개선)

  • Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.1
    • /
    • pp.157-162
    • /
    • 2011
  • In this paper, we propose enhanced methods of path finding based on an abstract graph with extension of search space to improve the quality of path. The proposed methods that are called simple buffering method, velocity constrained method and distance constrained method are to extract buffering-cells for using search space with valid-cells. The simple buffering method is to extract adjacent cells of valid-cells as buffering-cells. velocity constrained method and distance constrained method are based on simple buffering method, these eliminate buffering-cells through each of threshold. In experiment, proposed methods can improve the quality of path. The proposed methods are applicable to develop various kinds of telematics application, such as path finding and logistics.

VTA* Algorithm: A* Path-Finding Algorithm using Variable Turn Heuristic (VTA* 알고리즘: 가변적인 턴 휴리스틱을 적용한 A* 경로탐색 알고리즘)

  • Kim, Ji-Soo;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.3
    • /
    • pp.663-668
    • /
    • 2010
  • In driving a car, turns such as left turns, right turns, or u-turns, make the speed of the car decrease considerably. A more straight path, therefore, is probably faster to arrive at the destination than zig-zag path with same distance. In this paper, we have newly proposed the turn heuristic to make more straight path. The path navigation algorithm with turn heuristic(called as TA* algorithm) could enhance the straightness of a path by putting the turned-edges to the turn cost. It requires higher cost to use TA* algorithm than traditional A* algorithm because the straight-edge first searching have increased the search space. We have improved the TA* algorithm into the variable TA* algorithm(called as VTA* algorithm) which adopt the turn-heuristic during the a portion of the whole path.

Path Finding with Minimum Speed Dynamic Heuristic (최저 속력 동적 휴리스틱을 이용한 경로탐색)

  • Moon, Dae-Jin;Cho, Dae-Soo
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.2
    • /
    • pp.35-48
    • /
    • 2008
  • In this paper, we propose a Dynamic Heuristic to reduce the number of node accesses and improve quality of path in the client-based navigation service. The Dynamic Heuristic is to use heuristic data from server that is calculated with traffic data. The server-based navigation service provides a path searched on server and transmits it to client, but we propose that server only provide heuristic data to client. The proposed client searches a path with heuristic transmitted data from server. We present a new algorithm for using Dynamic Heuristic in the path-finding. The algorithm bases Grid Based Path-Finding, and has minimum speed data of edges in grid. It removes several grids whose minimum speed is less than limited speed.

  • PDF