• Title/Summary/Keyword: 속도 기반-다익스트라 알고리즘

Search Result 3, Processing Time 0.022 seconds

RFID-based Shortest Time Algorithm Line Tracer (RFID 기반 최단시간 알고리즘 라인트레이서)

  • Cheol-Min, Kim;Hee-Young, Cho;Tae-Sung, Yun;Ho-Jun, Shin;Hyoung-Keun, Park
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.6
    • /
    • pp.1221-1228
    • /
    • 2022
  • With the development of modern technology, the use of unmanned automation equipment that can replace humans in logistics and industrial sites is increasing. The technology of one such automation facility, the Unmanned Carrier (AGV), includes Line Tracing, which allows you to recognize a line through infrared sensors and drive a predetermined route. In this paper, the shortest time algorithm using Arduino is configured in the line tracing technology to enable efficient driving. It is also designed to collect location and time information using RFID tags.

A Study on Bicycle Route Selection Considering Topographical Characteristics (지형적 특성을 고려한 자전거 경로 선정에 관한 연구)

  • Yang, Jung Lan;Jun, Chul Min
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.21 no.3
    • /
    • pp.3-9
    • /
    • 2013
  • As interest in green growth picks up, the importance of bicycles which are an environment friendly means of communication has been magnified. However, bicycle routes which are the base of bicycles are designed without considering topographic elements and thus many users are experiencing inconvenience in using bicycles. The present study presents a routing technique to select optimal routes when selecting routes in commuting to school utilizing bicycles. To this end, a formula for optimum route calculation considering slope and intersections was drawn and a method to select optimum routes by applying modified Dijkstra Algorithms was studied. According to the results, the bicycle routes for commuting to school should be selected by the shortest time rather than the shortest distances to the destination, because it required reach the destination faster. Therefore when selecting the routes, it must be based on the shortest time considering waiting time due to crosswalks or crossroads and speed variations due to slopes.

A Seamline Extraction Technique Considering the Characteristic of NDVI for High Resolution Satellite Image Mosaics (고해상도 위성영상 모자이크를 위한 NDVI 특성을 이용한 접합선 추출 기법)

  • Kim, Jiyoung;Chae, Taebyeong;Byun, Younggi
    • Korean Journal of Remote Sensing
    • /
    • v.31 no.5
    • /
    • pp.395-408
    • /
    • 2015
  • High-resolution satellite image mosaics are becoming increasingly important in the field of remote sensing image analysis as an essential image processing to create a large image constructed from several smaller images. In this paper, we present an automatic seamline extraction technique and the procedure to generate a mosaic image by this technique. For more effective seamline extraction in the overlap region of adjacent images, an NDVI-based seamline extraction technique is developed, which takes advantage of the computational time and memory. The Normalized Difference Vegetation Index(NDVI) is an index of plant "greeness" or photosynthetic activity that is employed to extract the initial seamline. The NDVI can divide into manmade region and natural region. The cost image is obtained by the canny edge detector and the buffering technique is used to extract the ranging cost image. The seamline is extracted by applying the Dijkstra algorithm to a cost image generated through the labeling process of the extracted edge information. Histogram matching is also conducted to alleviate radiometric distortion between adjacent images acquired at different time. In the experimental results using the KOMPSAT-2/3 satellite imagery, it is confirmed that the proposed method greatly reduces the visual discontinuity caused by geometric difference of adjacent images and the computation time.