• Title/Summary/Keyword: 충돌방지정보

Search Result 295, Processing Time 0.035 seconds

Novel Channel Access Method for Mobile RFID Readers using Beacon Channel CCA Scheme (Beacon 채널 CCA 를 통한 모바일 RFID 리더의 채널 액세스)

  • Kim, Yun Ho;Kim, Yeon Joo;Bae, Sung Woo;Yang, Jung Kyu;Roh, Hyoung Hwan;Seong, Yeong Rak;Oh, Ha Ryoung;Park, Jun Seok
    • Annual Conference of KIPS
    • /
    • 2007.11a
    • /
    • pp.797-800
    • /
    • 2007
  • Radio Frequency IDentification(RFID) 시스템은 리더와 태그로 구성되어 리더에서 태그로 신호를 전송하여 태그로부터 원하는 정보를 얻는 시스템이다. 이 시스템에서 리더와 태그가 통신을 할 때 근접한 거리에 있는 리더들이 동일한 주파수를 이용하거나, 여러 리더가 동시에 하나의 태그에 명령을 전송하는 경우 서로 간섭을 일으켜 RFID 리더 충돌이 발생하는데, 본 논문에서는 이 충돌을 방지하기 위한 셀 분할 기법과 셀 내의 충돌 문제를 해결하기 위한 CCA 기법을 소개한다. 또한 CCA 기법의 성능 개선을 위한 Beacon 채널 CCA 방식을 제안한다.

A Control System for Avoiding Collisions between Autonomous Warfare Vehicles and Infantry (군용 무인차량과 보병의 충돌방지를 위한 제어시스템)

  • Nam, Sea-Hyeon;Chung, You-Chung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.3
    • /
    • pp.74-82
    • /
    • 2011
  • This paper describes a control system for positioning the real-time locations of the autonomous warfare vehicles and infantry, and for avoiding collisions between them. The control system utilizes the low-cost RSSI (Received Signal Strength Indication) for positioning the locations of the wireless devices. The mathematical mean filtering processes are applied to the calculation of the RSS matrix to improve the performance for positioning the wireless devices in the multi-path propagation environment. A fuzzy rule is proposed to recover and replace the broken packets occurring in the wireless communication. The gradient and geometric triangulation algorithms are proposed to trace the real-time locations of wireless devices, based on the distances between them. The estimated location results of the geometric triangulation algorithm are compared with the results of the GPS and the gradient algorithm.

전파산업진흥 기본계획

  • Korean Associaton of Information & Telecommunication
    • 정보화사회
    • /
    • s.151
    • /
    • pp.62-67
    • /
    • 2001
  • 정부는 오는 2005년까지 현재 40GHz대역까지 실용화된 전파자원을 80GHz대역까지 개발해 초고속 구내무선통신, 차량 충돌방지서비스 등 신규 광대역 서비스에 활용토록 할 계획이다.또 민.관 합동으로 450억원을 투자, 무궁화위성에 탑재할 중계기.안테나 등 통신방송 위성 탑재체를 산.학.연 공동으로 독자 개발키로 했다.정보통신부는 지난 7월11일 귀중한 국가자원인 주파수를 효율적으로 관리하고 관련 산업을 육성하기 위해 이 길은 내용의 전파산업진흥 기본계획을 확정, 발표했다.

  • PDF

Development of Collision Avoidance Supporting System based on ECDIS (전자해도표시시스템 기반의 충돌회피 지원 시스템 개발)

  • Kim, Da-Jung;Ahn, Kyoungsoo;Lee, Tae-Il;Kim, Young Woo
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2013.10a
    • /
    • pp.167-170
    • /
    • 2013
  • The objective of this paper is to describe the result of development of collision avoidance supporting system, based on the electronic chart display and information system(ECDIS). In real ship operations, collision accidents happen frequently due to human errors such as the lax vigilance, misinterpretation of international regulations for preventing collisions at sea (COLREGs). We developed a system which will help to avoid these kind of accidents. This system can automatically recognize the risk of collisions, generate the safe alternative routes that comply with COLREGs, and then deliver the results into auto pilot. A virtual simulation assuming progressive collision situations revealed the usefulness of this system.

  • PDF

Study on the Collision Avoidance Algorithm against Multiple Traffic Ships using Changeable Action Space Searching Method (가변공간 탐색법을 이용한 다중선박의 충돌회피 알고리즘에 관한 연구)

  • Son, N.S.;Furukawa, Y.;Kim, S.Y.;Kijima, K.
    • Journal of the Korean Society for Marine Environment & Energy
    • /
    • v.12 no.1
    • /
    • pp.15-22
    • /
    • 2009
  • Auto-navigation algorithm have been studied to avoid collision and grounding of a ship due to human error. There have been many research on collision avoidance algorithms but they have been validated little on the real coastal traffic situation. In this study, a Collision Avoidance algorithm is developed by using Fuzzy algorithm and the concept of Changeable Action Space Searching (CAS). In the first step, on a basis of collision risk calculated from fuzzy algorithm in the current time(t=to), alternative Action Space for collision avoidance is planned. In the second step, next alternative Action Space for collision avoidance in the future($t=to+{\Delta}t$) is corrected and re-planned with re-evaluated collision risk. In the third step, the safest and most effective course among Action Space is selected by using optimization method in real time. In this paper, the main features of the developed collision avoidance algorithm (CAS) are introduced. CAS is implemented in the ship-handling simulator of MOERI. The performance of CAS is tested on the situation of open sea with 3 traffic ships, whose position is assumed to be informed from AIS. Own-ship is fully autonomously navigated by autopilot including the collision avoidance algorithm, CAS. Experimental results show that own-ship can successfully avoid the collision against traffic ships and the calculated courses from CAS are reasonable.

  • PDF

A Study of Tram-Pedestrian Collision Prediction Method Using YOLOv5 and Motion Vector (YOLOv5와 모션벡터를 활용한 트램-보행자 충돌 예측 방법 연구)

  • Kim, Young-Min;An, Hyeon-Uk;Jeon, Hee-gyun;Kim, Jin-Pyeong;Jang, Gyu-Jin;Hwang, Hyeon-Chyeol
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.10 no.12
    • /
    • pp.561-568
    • /
    • 2021
  • In recent years, autonomous driving technologies have become a high-value-added technology that attracts attention in the fields of science and industry. For smooth Self-driving, it is necessary to accurately detect an object and estimate its movement speed in real time. CNN-based deep learning algorithms and conventional dense optical flows have a large consumption time, making it difficult to detect objects and estimate its movement speed in real time. In this paper, using a single camera image, fast object detection was performed using the YOLOv5 algorithm, a deep learning algorithm, and fast estimation of the speed of the object was performed by using a local dense optical flow modified from the existing dense optical flow based on the detected object. Based on this algorithm, we present a system that can predict the collision time and probability, and through this system, we intend to contribute to prevent tram accidents.

Architecture of Collision Avoidance System between Bicycle and Moving Object by Using V2V(X) Network (V2V(X) 네트워크를 이용한 자전거와 이동 객체간 충돌 회피 시스템 구조)

  • Gu, Bon-gen
    • Journal of Platform Technology
    • /
    • v.6 no.3
    • /
    • pp.10-16
    • /
    • 2018
  • Bicycle shares road with various traffic elements like car, pedestrian and, the number of bicycle user is increasing in recent. Therefore, bicycle accident continuously increases. Especially in complex traffic environment, bicycle accident which collides with moving object such as pedestrian occupies many parts of bicycle accident in the reason that the cyclist does not recognize moving object. In this paper, to reduce or avoid the bicycle accident, we propose the architecture of bicycle collision avoidance system in which that cyclist can get the information about moving object by connecting bicycle to network of vehicles and does some action for avoiding collision. In our architecture, when traffic element such as car recognizes moving object, it decides the moving direction of object, and transfers information about moving direction via vehicles network. Bicycle collision avoidance system from our proposed architecture receives this information, and alerts to cyclist when the moving object influences the safety of bicycle.

The Proposal of Efficient Hit Prevention Technique according to the Frequency Hopping Pattern in Orthogonal Multi-Carrier FH/CDMA System (직교 멀티캐리어 FH/CDMA 시스템에서 주파수 도약 패턴에 따른 효율적인 충돌 방지 기법 제안)

  • 이문승
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.2
    • /
    • pp.141-150
    • /
    • 2002
  • In this paper, we composed orthogonal multi carrier FH/CDMA system using frequency hopping sequence. Considering hit possibilities by delayed other user's signals we searched the optimal number of user access carrier slots not to influence on performance deterioration with the variation of number of carrier slots according to the number of user access carrier slots. A]io, we evaluated the BER performance improvement due to TCM and Concatenated coding technique by computer simulation.

An Adaptive Persistence Strategy for the CSMA in Dynamic Networks (동적 네트워크에서 CSMA 다중접속을 위한 적응형 Persistence방법)

  • Lee, Wang-Jong;Kim, Byung-Boo;Rhee, Seung-Hyong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.10-13
    • /
    • 2006
  • 통신 기술의 발달로 많은 통신기기들이 하나의 채널을 공유하여 사용하게 되었다 여러 통신기기가 채널을 공유하여 사용하므로 동시에 데이터를 전송하여 발생하는 충돌 가능성이 증가하였다 이러한 충돌로 인한 네트워크 성능의 저하를 방지하기 위하여 다양한 다중 접속(Multiple Access) 기술이 연구되고 있다. CSMA(Carrier Sense Multiple Access)는 다양한 다중 접속 기술의 기반이 되는 기술이다. CSMA는 nonpersistence, 1-persistence, p-persistence와 같이 다양한 전송 방식을 지원하기 때문에 여러 네트워크 환경에 널리 적용된다. 그러나 CSMA가 다양한 네트워크 환경에 적용이 가능하지만 네트워크의 빈번한 상태 변화를 고려하여 최적의 성능을 유지하지는 못한다. CSMA의 전송 방식들은 네트워크 환경에 따라 그 성능의 변화가 심하다 본 논문에서는 동적 네트워크 환경을 고려하여 성능을 향상시키기 위한 적응형 persistence 방법을 제안한다.

  • PDF

Minimum Preemption Scheduling Algorithm based on Least-Laxity-First for Real-Time Systems (실시간 시스템을 위한 최소 여유시간 우선 기반의 최소 선점을 갖는 스케쥴링 알고리즘)

  • O, Seong-Heun;Yang, Seung-Min
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.4
    • /
    • pp.443-454
    • /
    • 1999
  • 최소 여유시간 우선(Least-Laxity-First)스케쥴링 알고리즘은 여유시간이 작은 태스트가 높은 우선순위를 갖는 동적 우선순위 스케줄링 방법으로서 단일프로세서 시스템에서 최적임이 증명되었다. 그러나, 이 알고리즘은 최소 여유시간을 가진 태스크가 여러 개 존재하여 여유시간 충돌이 발생한 경우 이 태스크들 간에 빈번한 문맥교환이 발생하게 되는 문제점이 있어 실용적이지 못하다. 본 논문에서 제한하는 최소 여유시간 우선 기반의 최소선점을 갖는 스케줄링 알고리즘(Least-Laxity-First with Minimum Preemption 또는 LLF/MP)은 여유시간이 충돌했을 때에 문맥교환을 최소화함으로써 최소 여유시간 우선 스케줄링 알고리즘의 단점을 해결하였다. LLF/MP 스케줄링 알고리듬은 불필요한 문맥교환을 줄임으로써 시스템 오버헤드로 인한 시스템의 성능 저하를 방지할 수 있고 보다 많은 시스템 자원을 예측 불가능한 비주기적 태스크에게 할당할수 있다.