• Title/Summary/Keyword: Time-To-Collision

Search Result 1,088, Processing Time 0.026 seconds

A Predictive Study on Backset Variation on the Neck Injury of Human Model during Rear-end Collision (후방추돌시 백세트 변화에 따른 인체모형의 목상해에 관한 예측 연구)

  • Park, Jin-Su;Baek, Se-Ryong;Lim, Jong-Han;Yoon, Jun-Kyu
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.6
    • /
    • pp.251-258
    • /
    • 2018
  • Recently, due to the increase in the traffic volume of vehicle, the collision of the vehicle collision has been increased so that the neck injuries of the passengers has been increased. In order to prevent this, vehicle collision analysis research using computer simulation has been actively carried out in consideration of the design point of car seat. In this study, I used the MADYMO program for analyzing the passenger behavior using a BioRID II dummy, and predicted the neck injuries of passengers according to the change of the backset at the rearward collision of the driving speed of 16km/h. As a result, it was found that the shorter the backset, the shorter the contact start time but the contact completion time was almost the same and the T1 acceleration showed that the acceleration increased with the backset. In addition, the tensile strength increases as the backset increases, and NIC (Neck Injury Criterion) increases as the head speed reaches the headrest.

Enhanced Anti-Collision Protocol for Identification Systems: Binary Slotted Query Tree Algorithm

  • Le, Nam-Tuan;Choi, Sun-Woong;Jang, Yeong-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9B
    • /
    • pp.1092-1097
    • /
    • 2011
  • An anti-collision protocol which tries to minimize the collision probability and identification time is the most important factor in all identification technologies. This paper focuses on methods to improve the efficiency of tag's process in identification systems. Our scheme, Binary Slotted Query Tree (BSQT) algorithm, is a memoryless protocol that identifies an object's ID more efficiently by removing the unnecessary prefixes of the traditional Query Tree (QT) algorithm. With enhanced QT algorithm, the reader will broadcast 1 bit and wait the response from the tags but the difference in this scheme is the reader will listen in 2 slots (slot 1 is for 0 bit Tags and slot 2 is for 1 bit Tags). Base on the responses the reader will decide next broadcasted bit. This will help for the reader to remove some unnecessary broadcasted bits which no tags will response. Numerical and simulation results show that the proposed scheme decreases the tag identification time by reducing the overall number of request.

A Collision Avoidance System for Intelligent Ship using BK-products and COLREGs (BK곱과 COLREGs에 기반한 지능형 선박의 충돌회피시스템)

  • Kang, Sung-Soo;Lee, Young-Il;Jung, Hee;Kim, Yong-Gi
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.1
    • /
    • pp.181-190
    • /
    • 2007
  • This paper presents a collision avoidance system for intelligent ship. Unlike collision avoidance system of other unmanned vehicles, the collision avoidance system for intelligent ship aims at not only deriving a reasonable and safe path to the goal but also keeping COLRECs(International Regulations for Preventing Collisions at Sea). The heuristic search based on the BK-products is adopted to achieve the general purpose of collision avoidance system; deriving a reasonable and safe path. The rule of action to avoid collision is adopted for the other necessary and sufficient condition; keeping the COLREGs. The verification of proposed collision avoidance system is performed with scenarios that represent encounter situations classified in the COLREGs, then it is compared with $A^{\ast}$ search method in view of optimality and safety. The analysis of simulation result revels that the proposed collision avoidance system is practical and effective candidate for real-time collision avoidance system of intelligent ship.

Longitudinal Motion Planning of Autonomous Vehicle for Pedestrian Collision Avoidance (보행자 충돌 회피를 위한 자율주행 차량의 종방향 거동 계획)

  • Kim, Yujin;Moon, Jongsik;Jeong, Yonghwan;Yi, Kyongsu
    • Journal of Auto-vehicle Safety Association
    • /
    • v.11 no.3
    • /
    • pp.37-42
    • /
    • 2019
  • This paper presents an autonomous acceleration planning algorithm for pedestrian collision avoidance at urban. Various scenarios between pedestrians and a vehicle are designed to maneuver the planning algorithm. To simulate the scenarios, we analyze pedestrian's behavior and identify limitations of fusion sensors, lidar and vision camera. Acceleration is optimally determined by considering TTC (Time To Collision) and pedestrian's intention. Pedestrian's crossing intention is estimated for quick control decision to minimize full-braking situation, based on their velocity and position change. Feasibility of the proposed algorithm is verified by simulations using Carsim and Simulink, and comparisons with actual driving data.

Scheduling of Welding Robots for Shipyard Sub-assembly Process (조선 소조립 공정의 자동화를 위한 용접 로봇 스케줄링)

  • Kang, Jang-Ha;Park, Sung-Soo;Park, Kyung-Chul;Do, Ki-Sang
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.1
    • /
    • pp.21-34
    • /
    • 1999
  • We consider a scheduling problem arising in a shipyard subassembly welding process. There are four welding robots of gantry type, which perform the welding process for the subassemblies. Because the robots perform the welding operations at the same time, there is a possibility of collision between adjacent robots depending on the welding schedule. In this paper, we propose a heuristic method to find a welding schedule which does minimize the welding completion time while avoiding collision among the robots. The method consists of two phases: assignment and scheduling. In the assignment phase, we assign each welding line to a proper robot. In the scheduling phase, we determine the welding schedules for the robots so that collision is avoided. Computational experiences with the data which reflect the real situation are reported.

  • PDF

Dynamic FSA Algorithm for Fast Tag Identification in RFID Systems (RFID 시스템에서 고속 태그 식별을 위한 동적 FSA 알고리즘)

  • Lim In-Taek;Choi Jin-Oh
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.5
    • /
    • pp.806-811
    • /
    • 2006
  • In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to as anti-collision algorithm. Among the existing anti-collision algorithms, SFSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. This paper proposes a new anti-collision algorithm called DFSA which determines the optimal frame size using the number of collided slots at every frame. According to the simulation results, the tag identification time of the proposed algorithm is faster than that of SFSA.

Collision detection algorithm by using mesh grouping (메쉬 그룹화를 이용한 충돌 검출 알고리즘)

  • Park, Jong-Seop;Jang, Tae-Jeong
    • Journal of Digital Contents Society
    • /
    • v.19 no.1
    • /
    • pp.199-204
    • /
    • 2018
  • In this paper, we propose a fast collision detection method for interacting with objects in virtual space. First, in the mesh grouping step, the entire space is divided into small spaces of a predetermined size, and the positions and sizes of the smallest basic stereoscopic shapes (cube or sphere) including all of the meshes belonging to each small space are determined. In the collision detection step, it is checked whether a haptic interface point (HIP) is included in a three-dimensional figure representing a group. When a collision with a specific three-dimensional figure is confirmed, searching is performed only for the meshes in the group to find a mesh on which a possible real collision with HIP occurred. The effectiveness of the proposed algorithm is verified by measuring and comparing the computation time of the proposed method with and without the proposed method.

Tag Anti-Collision Algorithms in Passive and Semi-passive RFID Systems -Part II : CHI Algorithm and Hybrid Q Algorithm by using Chebyshev's Inequality-

  • Fan, Xiao;Song, In-Chan;Chang, Kyung-Hi;Shin, Dong-Beom;Lee, Heyung-Sub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8A
    • /
    • pp.805-814
    • /
    • 2008
  • Both EPCglobal Generation-2 (Gen2) for passive RFID systems and Intelleflex for semi-passive RFID systems use probabilistic slotted ALOHA with Q algorithm, which is a kind of dynamic framed slotted ALOHA (DFSA), as the tag anti-collision algorithm. A better tag anti-collision algorithm can reduce collisions so as to increase the efficiency of tag identification. In this paper, we introduce and analyze the estimation methods of the number of slots and tags for DFSA. To increase the efficiency of tag identification, we propose two new tag anti-collision algorithms, which are Chebyshev's inequality (CHI) algorithm and hybrid Q algorithm, and compare them with the conventional Q algorithm and adaptive adjustable framed Q (AAFQ) algorithm, which is mentioned in Part I. The simulation results show that AAFQ performs the best in Gen2 scenario. However, in Intelleflex scenario the proposed hybrid Q algorithm is the best. That is, hybrid Q provides the minimum identification time, shows the more consistent collision ratio, and maximizes throughput and system efficiency in Intelleflex scenario.

Transmission Interval Optimization by Analysis of Collision Probability in Low Power TPMS (저전력 운영 TPMS에서 충돌 확률 분석을 통한 전송주기 최적화)

  • Lim, Sol;Choi, Han Wool;Kim, Dae Jin
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.5
    • /
    • pp.364-371
    • /
    • 2017
  • TPMS is a vehicle electric system that measures the air pressure of a tire, and informs the driver of current tire states. The TPMS sensor typically uses unidirectional communication for small size, light weight, and low power. The transmission period of the sensor indicates the service quality of monitoring the tire. In order to determine the optimal transmission period, frame collision probability and the life time of the sensor should be analyzed. In this paper, collision probability model using Venn diagram is designed in low power TPMS with the normal and warning mode. And the life time and a collision probability were analyzed with the ratio(n) of the normal mode to warning mode transmission period. As a result, $T_{nP}=31sec$ and $T_{wP}=2.4sec$ at 5 years, and $T_{nP}=71sec$ and $T_{wP}=2.5sec$ at 7 years.

Ship Collision Analysis of Structure (구조물의 선박충돌 해석)

  • Lee Seong-Lo;Bae Yong-Gwi
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2005.05a
    • /
    • pp.347-350
    • /
    • 2005
  • A ship collision analysis by finite element method is performed considering the effects of mass and speed of ship and material and shape of structures to analyze the dynamic characteristics by ship collision. From this analysis, collision load-time history and inelastic deformation of ship and structures are obtained. Dynamic characteristics are different from each other according to interaction. between ship and structures. It seems that there are lots of factor to have effects on the ship-structures interaction. But because little information is available on the behavior of the inelastic deformation of materials and structures during the type of dynamic impacts associated with vessel impact, assumptions based on experience and sound engineering practice should be substituted. Therefore more researches on the interaction between ship and structures are required.

  • PDF