• Title/Summary/Keyword: collision map

Search Result 100, Processing Time 0.03 seconds

Autonomous swimming technology for an AUV operating in the underwater jacket structure environment

  • Li, Ji-Hong;Park, Daegil;Ki, Geonhui
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.11 no.2
    • /
    • pp.679-687
    • /
    • 2019
  • This paper presents the autonomous swimming technology developed for an Autonomous Underwater Vehicle (AUV) operating in the underwater jacket structure environment. To prevent the position divergence of the inertial navigation system constructed for the primary navigation solution for the vehicle, we've developed kinds of marker-recognition based underwater localization methods using both of optical and acoustic cameras. However, these two methods all require the artificial markers to be located near to the cameras mounted on the vehicle. Therefore, in the case of the vehicle far away from the structure where the markers are usually mounted on, we may need alternative position-aiding solution to guarantee the navigation accuracy. For this purpose, we develop a sonar image processing based underwater localization method using a Forward Looking Sonar (FLS) mounted in front of the vehicle. The primary purpose of this FLS is to detect the obstacles in front of the vehicle. According to the detected obstacle(s), we apply an Occupancy Grid Map (OGM) based path planning algorithm to derive an obstacle collision-free reference path. Experimental studies are carried out in the water tank and also in the Pohang Yeongilman port sea environment to demonstrate the effectiveness of the proposed autonomous swimming technology.

Design of a Low-Power Turbo Decoder Using Parallel SISO Decoders (병렬 SISO 복호기에 의한 저전력 터보 복호기의 설계)

  • Lee, Hee-Jin;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.2C
    • /
    • pp.25-30
    • /
    • 2005
  • Turbo code is popularly used for the reliable communication in the presence of burst errors. Even if it shows good error performance near to the Shannon limits, it requires a large amount of memories and exhibits long latency. This paper proposes an architecture for the low power implementation of the Turbo decoder adopting the Max-Log-Map algorithm. In the proposed design, two SISO decoders are designed to operate in parallel, and a novel interleaver is designed to prevent the collision of memory accesses by two SISO decoders. Experimental results show that power consumption has been reduced by about 40% in the proposed decoder compared to previous Turbo decoders. The area overhead due to the additional interleaver controller is negligible.

Video Based Tail-Lights Status Recognition Algorithm (영상기반 차량 후미등 상태 인식 알고리즘)

  • Kim, Gyu-Yeong;Lee, Geun-Hoo;Do, Jin-Kyu;Park, Keun-Soo;Park, Jang-Sik
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.10
    • /
    • pp.1443-1449
    • /
    • 2013
  • Automatic detection of vehicles in front is an integral component of many advanced driver-assistance system, such as collision mitigation, automatic cruise control, and automatic head-lamp dimming. Regardless day and night, tail-lights play an important role in vehicle detecting and status recognizing of driving in front. However, some drivers do not know the status of the tail-lights of vehicles. Thus, it is required for drivers to inform status of tail-lights automatically. In this paper, a recognition method of status of tail-lights based on video processing and recognition technology is proposed. Background estimation, optical flow and Euclidean distance is used to detect vehicles entering tollgate. Then saliency map is used to detect tail-lights and recognize their status in the Lab color coordinates. As results of experiments of using tollgate videos, it is shown that the proposed method can be used to inform status of tail-lights.

A Study on Multimedia Processor Architecture (멀티미디어 프로세서 아키텍쳐에 관한 연구)

  • Park, Chun-Myoung;Lee, Taek-Keun
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.1177-1180
    • /
    • 2005
  • This paper present a method of constructing the multimedia processor architecture. The proposed multimedia processor architecture be able to handle each text, sound, and video in one chip. Also it have interactive function that is a characteristics of multimedia. Specially, the proposed multimedia processor be able to addressing nodes in memory map without software, and it is completely reconfigurable depend on data. Also it as able to process time and space common that have synchronous/asynchronous and it is able to protect continuous and dynamic media bus collision, and local and overall common memory structure. The proposed multimedia processor architecture apply to virtual reality and mixed reality.

  • PDF

Simulation of Mobile Robot Navigation based on Multi-Sensor Data Fusion by Probabilistic Model

  • Jin, Tae-seok
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.21 no.4
    • /
    • pp.167-174
    • /
    • 2018
  • Presently, the exploration of an unknown environment is an important task for the development of mobile robots and mobile robots are navigated by means of a number of methods, using navigating systems such as the sonar-sensing system or the visual-sensing system. To fully utilize the strengths of both the sonar and visual sensing systems, In mobile robotics, multi-sensor data fusion(MSDF) became useful method for navigation and collision avoiding. Moreover, their applicability for map building and navigation has exploited in recent years. In this paper, as the preliminary step for developing a multi-purpose autonomous carrier mobile robot to transport trolleys or heavy goods and serve as robotic nursing assistant in hospital wards. The aim of this paper is to present the use of multi-sensor data fusion such as ultrasonic sensor, IR sensor for mobile robot to navigate, and presents an experimental mobile robot designed to operate autonomously within indoor environments. Simulation results with a mobile robot will demonstrate the effectiveness of the discussed methods.

An Auto-drawing Algorithm for the Single Line Diagram of Distribution Systems (배전선로 회선별단선도 자동생성 알고리즘)

  • Son, Ju-Hwan;Lim, Seong-Il
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.5
    • /
    • pp.854-859
    • /
    • 2010
  • Distribution Automation System(DAS) is designed to improve operational efficiency by acquisition and control of remote data using its components such as central computation units, communication network and feeder remote terminal units. A conventional human machine interface of the DAS adopts a schematic diagram which is made by drawing power equipments on the geographic information system map. The single line diagram is more useful than the schematic diagram for the main tasks of distribution system operation such as protective relay coordination, service restoration and loss minimization. Since the configuration of the distribution line is changed according to the relocation of the open tie switches, the auto-drawing algorithm based on the connection between the sections and the switches is an essential technique. This paper proposes a new auto-drawing algorithm for a single line diagram of distribution systems based on tertiary tree and collision avoidance method. The feasibility of the proposed algorithm has been testified for various cases using practical distribution system with 12 feeders.

Development of a Guide Robot with Real-Time Linux OS

  • Mun, Jun-Hak;Seo, Gon-Yeon;Kim, Jin-Oh
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.137.1-137
    • /
    • 2001
  • A new method for a guide robot using Real-Time Linux OS is introduced in this paper. A guide robot is to guide people in museums or buildings. So it has to be more reliable and stable in its control system. In addition, it has to satisfy Real-Time operation requirement because it needs to react to changing environment prompty. The task includes localization, map building, collision avoidance, path planning, and user interface software. The modular guide robot is designed with Real-Time Linux OS, which is composed of many open sources for scheduler, interrupt dispatcher, fifos, shared memory, timer services. We developed application software to satisfy the given task. The developed guide robot moves at 0.2ms and the interrupt latency is less than 100$\mu\textrm{s}$ It is thought that the developed system can be a stable and low cost open architecture robot controller for ...

  • PDF

Optimal Path Planning Using Critical Points

  • Lee, Jin-Sun;Choi, Chang-Hyuk;Song, Jae-Bok;Chung, Woo-Jin;Kim, Mun-Sang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.131.4-131
    • /
    • 2001
  • A lot of path planning algorithms have been developed to find the collision-free path with minimum cost. But most of them require complicated computations. In this paper, a thinning method, which is one of the image processing schemes, was adopted to simplify the path planning procedure. In addition, critical points are used to find the shortest-distance path among all possible paths from the start to the goal point. Since the critical points contain the information on the neighboring paths, a new path can be quickly obtained on the map even when the start and goal points change. To investigate the validity of the proposed algorithm, various simulations have been performed for the environment where the obstacles with arbitrary shapes exist. It is shown that the optimal paths can be found with relative easiness.

  • PDF

Path Planning for Cleaning Robots: A Graph Model Approach

  • Yun, Sang-Hoon;Park, Se-Hun;Park, Byung-Jun;Lee, Yun-Jung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.120.3-120
    • /
    • 2001
  • We propose a new method of path planning for cleaning robots. Path planning problem for cleaning robots is different from conventional path planning problems in which finding a collision-free trajectory from a start point to a goal point is focused. In the case of cleaning robots, however, a planned path should cover all area to be cleaned. To resolve this problem in a systematic way, we propose a method based on a graph model as follows: at first, partition a given map into proper regions, then transform a divided region to a vertex and a connectivity between regions to an edge of a graph. Finally, a region is divided into sub-regions so that the graph has a unary tree which is the simplest Hamilton path. The effectiveness of the proposed method is shown by computer simulation results.

  • PDF

Development of a Distributed Road Traffic Simulation System

  • Keawmanee, T.;Seubpradit, K.;Tandayya, P.
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1324-1326
    • /
    • 2002
  • This paper concerns the development of distributed interactive simulation of a road traffic system. The simulation involved models of multiple and distributed road vehicles running on different locations. The simulation system represented a traffic system as if the distributed simulation models were in the same environment. The development of the distributed road traffic simulation was based on High Level Architecture (HLA), a state-of-the-art IEEE standard for the distributed and real-time simulation. Other work concerned modeling and simulating the road vehicles and building the map database for the virtual distributed shared environment. The information used in the simulation system was only in X-axis and Y-axis as the insignificant data in the Z-axis was omitted to simplify the simulation. However, the traffic system has visualized a 3-D coordinate system. The road vehicle models were able to avoid collision. The next direction of a vehicle can be chosen from the provided choices of further paths.

  • PDF