• Title/Summary/Keyword: Route

Search Result 5,375, Processing Time 0.031 seconds

Determination of Optimal Ship Route in Coastal Sea Considering Sea State and Under Keel Clearance (해상 상태 및 선저여유수심을 고려한 연안 내 선박의 최적 항로 결정)

  • Lee, Wonhee;Yoo, Wonchul;Choi, Gwang-Hyeok;Ham, Seung-Ho;Kim, Tae-wan
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.56 no.6
    • /
    • pp.480-487
    • /
    • 2019
  • Ship route planning is to find a route to minimize voyage time and/or fuel consumption in a given sea state. Unlike previous studies, this study proposes an optimization method for the route planning to avoid the grounding risk near the coast. The route waypoints were searched using A* algorithm, and the route simplification was performed to remove redundant waypoints using Douglas-Peucker algorithm. The optimization was performed to minimize fuel consumption by setting the optimization design parameters to the engine rpm. The sea state factors such as wind, wave, and current are also considered for route planning. We propose the constraint to avoid ground risk by using under keel clearance obtained from electoronic navigational chart. The proposed method was applied to find the optimal route between Mokpo and Jeju. The result showed that the proposed method suggests the optimal route that minimizes fuel consumption.

PDAODMRP: An Extended PoolODMRP Based on Passive Data Acknowledgement

  • Cai, Shaobin;Yang, Xiaozong;Wang, Ling
    • Journal of Communications and Networks
    • /
    • v.6 no.4
    • /
    • pp.362-375
    • /
    • 2004
  • An ad hoc network is a multi-hop wireless network. Its limited bandwidth and frequently changing topology require that its protocol should be robust, simple, and energy conserving. We have proposed PoolODMRP to reduce its control overhead greatly by its one-hop local route maintenance. However, PoolODMRP still has some shortcomings. In this paper, we propose PDAODMRP (passive data acknowledgement ODMRP) to extend PoolODMRP. Compared with PoolODMRP, PDAODMRP has the following contributions: (1) It knows the status of its downstream forwarding nodes by route information collected from data packets instead of BEACON signal of MAC layer; (2) it max simplifies the route information collected from data packets by pool nodes; (3) it adopts a dynamic local route maintenance to enforce its local route maintenance; (4) it adopts the route evaluation policy of NSMP (neighbor supporting multicast protocol). Compared with PoolODMRP, PDAODMRP has lower control overhead, lower data delivery delay, and lower data overhead.

Design and Implementation of Optimized Route Search Technique based on User Experience Using Open APIs (지도 오픈 API를 활용한 사용자 경험 기반 최적화 이동 경로 탐색 기법의 설계와 구현)

  • Sagong, Woon
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.5
    • /
    • pp.682-690
    • /
    • 2015
  • Among location-based systems, a route search service is very highly utilized as a representative technique, but it provides relatively low accuracy when we find a route path on foot in our real environment. In this paper, we design and implement an optimized route search technique based on user experience utilizing open APIs as location-based services. Finally, we develop an Android-based application to provide this feature. In our experiment, we found that our technique enhanced performance by about 14-36% compared to previous solutions, such as route path searches using map APIs. In addition, the performance of our technique can be further enhanced, as the number of users who find such optimized route path is increasing.

A Study on Route Optimization Scheme using Correspondent Information for in the PMIPv6 considering Inter-MAG (Inter-MAG이 고려된 PMIPv6 환경에서 전달자 정보를 이용한 경로 최적화 기법에 관한 연구)

  • Choi, Young Hyun;Park, Min Woo;Eom, Jung Ho;Chung, Tai M
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.3
    • /
    • pp.59-68
    • /
    • 2010
  • In the paper, we proposed the Using Correspondent Information for Route Optimization on PMIPv6 over Inter-MAG. Proxy Mobile IPv6 has the problem that a mobile node sends data packets through inefficient routing paths when communicating other mobile node. Route optimization schemes are proposed to solve the triangle routing problem that creates the shortest routing path by leaving the inefficient routing paths. We proposed Correspondent Information Route Optimization scheme to reduce signaling cost as compared with other route optimization scheme. We can reduce signaling cost of route optimization through the Correspondent Information message on basic PMIPv6 and hand-off environment.

Methodology for Selecting Optimal Earthmoving Haul-Routes using Genetic Algorithm (유전알고리즘을 이용한 토사운반 최적경로 탐색 방법론)

  • Gwak, Han-Seong;Yi, Chang-Yong;Lee, Dong-Eun
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2014.05a
    • /
    • pp.4-5
    • /
    • 2014
  • Planning earthmoving haul-route must be preceded for appropriate equipment fleet assignment. However, traditional haul-route planning methods have limitations relative to practical usage because multiple variables (e.g., grade/rolling resistance, length, equipment's weight etc.) should be considered at a time. Genetic algorithm(GA) was introduced to improve these traditional methods. However, GA based haul-route planning method still remains in inefficiency relative to computation performance. This study presents a new haul-route searching method that computes an optimal haul-route using GA. The system prototype is developed by using MATLAB(ver. 2008b). The system identifies an optimal haul-route by considering equipment type, soil type, and soil condition.

  • PDF

Design and Implementation of Routing System Using Artificial Neural Network

  • Kim, Jun-Yeong;Kim, Seog-Gyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.12
    • /
    • pp.137-143
    • /
    • 2017
  • In this paper, we propose optimal route searching algorithm using ANN(Artificial Neural Network) and implement route searching system. Our proposed scheme shows that the route using artificial neural network is almost same as the route using Dijkstra's algorithm but the time in our propose algorithm is shorter than that of existing Dijkstra's algorithm. Proposed route searching method using artificial neural network has better performance than exiting route searching method because it use several weight value in making different routes. Through simulation, we show that our proposed routing system improves the performance and reduces time to make route irrespective of the number of hidden layers.

Route Analysis Algorithm using Fuzzy Reasoning in Route Planning (항로 계획시의 퍼지 항로분석 알고리즘)

  • 구자윤
    • Journal of the Korean Institute of Navigation
    • /
    • v.20 no.3
    • /
    • pp.65-71
    • /
    • 1996
  • Recently, the Track Control System which was separated from the Course Control System so-called Auto-Pilot has been developed for track-keeping in coastal area. From this year, the NAV Sub-committee in IMO commenced to consider the Performance Standard for the Track Control System vigorously. This system will be integrated with ECDIS and IBS so that captain/officers should analysis ship's motion characteristics accurately in the route planning using the electronic nautical charts. In this paper, a new Route Analysis Algorithm using fuzzy reasoning in route planning was proposed for 2, 700 TEU container ship. In order to verify the track-keeping, the author established a ship mathematical model and executed the simulation of the Route Analysis Algorithm at on-line condition with Pentium PC. The results of ship trajectories of the Route Analysis Algorithm were found to be effective to get track control automatically.

  • PDF

Analysis of Route Stability in Mobile Ad Hoc Networks (모바일 애드 혹 네트워크 환경에서 경로 신뢰성 분석)

  • Lee, Do-Hyeon
    • Convergence Security Journal
    • /
    • v.11 no.5
    • /
    • pp.13-19
    • /
    • 2011
  • Mobile nodes in MANETs have the nature of unrestricted mobility so that they will join and leave the network frequently. Therefore, it important consideration to determine the optimal distance progress between relaying nodes along the route in order to maintain the established route for an arbitrary length of time (i.e., route duration). In this paper, we derived the link maintenance probability by considering the initial distance between two relaying nodes and node mobility. Based on the link maintenance probability, we further analyzed the route stability by considering the impact of distance progress between relaying nodes along the route.

An algorithm for finding a watchman route with minimum links in the characteristic polygons (특성 다각형에서 최소링크의 경비원 경로를 구하는 알고리즘)

  • Ryu, Sang-Ryul
    • The KIPS Transactions:PartA
    • /
    • v.9A no.4
    • /
    • pp.595-602
    • /
    • 2002
  • The watchman routes which an watchman patrols the interior of polygon moving along the route are classified to minimum length or minimum links. The watchman route with minimum links has minimum changes of direction in process. In this paper, we present an algorithm with $O(N^2)$ time for finding the watchman route with minimum links in the weakly visible polygons which have specific property.

Optimal Route Planning for Maritime Autonomous Surface Ships Using a Nonlinear Model Predictive Control

  • Daejeong Kim;Zhang Ming;Jeongbin Yim
    • Journal of Navigation and Port Research
    • /
    • v.47 no.2
    • /
    • pp.66-74
    • /
    • 2023
  • With the increase of interest in developing Maritime Autonomous Surface Ships (MASS), an optimal ship route planning is gradually gaining popularity as one of the important subsystems for autonomy of modern marine vessels. In the present paper, an optimal ship route planning model for MASS is proposed using a nonlinear MPC approach together with a nonlinear MMG model. Results drawn from this study demonstrated that the optimization problem for the ship route was successfully solved with satisfaction of the nonlinear dynamics of the ship and all constraints for the state and manipulated variables using the nonlinear MPC approach. Given that a route generation system capable of accounting for nonlinear dynamics of the ship and equality/inequality constraints is essential for achieving fully autonomous navigation at sea, it is expected that this paper will contribute to the field of autonomous vehicles by demonstrating the performance of the proposed optimal ship route planning model.