• Journal of Korea Multimedia Society
• /
• v.25 no.2
• /
• pp.297-310
• /
• 2022

Road facilities such as CCTV poles have potential risk of collision accidents with a car. A collision detection algorithm installed in the facility allows the collision accident to be known remotely. Most collision detection algorithms are operated by simply focusing on whether a collision have occurred, because these methods are used to measure only acceleration data from a 3-axis sensor to detect collision. However, it is difficult to detect other detailed information such as malfunction of the sensor, collision direction and collision strength, because it is not known without witness the accident. Therefore, we proposed enhanced detection algorithm to get the collision direction, and the collision strength from the tilt of the facility after accident using a 9-axis sensor in this paper. In order to confirm the performance of the algorithm, an accuracy evaluation experiment was conducted according to the data measurement cycle and the invocation cycle to an detection algorithm. As a result, the proposed enhanced algorithm confirmed 100% accuracy for 50 weak collisions and 50 strong collisions at the 9-axis data measurement cycle of 10ms and the invocation cycle of 1,000ms. In conclusion, the algorithm proposed is expected to provide more reliable and detailed information than existing algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6B
• /
• pp.450-455
• /
• 2008

We analyze the tag identification procedure of conventional EPC Class 1 RFID system and propose the fast anti-collision algorithm for the performance improvement of the system. In the proposed algorithm, the reader uses information of tag collisions and reduces unnecessary procedures of the conventional algorithm. We evaluate the performance of the proposed anti-collision algorithm and the conventional algorithm using mathematical analysis and simulation. According to the results, the fast anti-collision algorithm shows greatly better performance than conventional algorithm.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.17 no.2
• /
• pp.49-56
• /
• 2009

In this study, a side collision accident reconstruction using database based on the deformed shape information from the collision test using model cars is suggested. A deformation index and angle index related to the deformed shape is developed to set the database for the collision accident reconstruction algorithm. Two small size RC cars are developed to carry out the side collision test. Several side collision tests according to the velocity and collision angles are performed for establishing the side collision database. A high speed camera with 1000fps is used to capture the motion of the car. A side collision accident reconstruction algorithm is developed and applied to find the collision conditions before the accident occurs. Two collision cases are tested to validate the database and the algorithm. The results obtained by the reconstruction algorithm show good match with original conditions with regard to the velocity and angle.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.647-652
• /
• 2000

This paper proposes a collision warning/avoidance algorithm using a trajectory prediction method. This algorithm is based on 2-dimensional kinematics and the Kalman filter has been used to obtain the information of the object vehicle. This algorithm has been investigated via computer simulation and showed a good trajectory prediction performance. The proposed collision warning/avoidance algorithm would enhanced driver acceptance for a collision warning/avoidance system.

• KSCI Review
• /
• v.14 no.1
• /
• pp.249-254
• /
• 2006

In this paper, I review the collision processing algorithm using existing quadrilateral unit and present problems with it. Then I propose a collision check technique of a small quadrilateral unit, by which the defects with simple quadrilateral collision has been made up for. I finally show that the proposed algorithm can be applied to real games in terms of presenting the experiment results and screen design for implemented real games.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.316-327
• /
• 2007

RFID (Radio Frequency Identification) is one of the most promising air interface technologies in the future for object identification using radio wave. If there are multiple tags within the range of the RFID tag reader, all tags send their tag identifications to the reader at the same time in response to the reader's query. This causes collisions on the reader and no tag is identified. A multi-tag identification problem is a core issue in the RFID. It can be solved by anti-collision algorithm such as slot based ALHOA algorithms and tree based algorithms. This paper, proposes a collision tree based anti-collision algorithm using collision tree in RFID system. It is a memory-less algorithm and is an efficient RFID anti-collision mechanism. The collision tree is a mechanism that can solve multi-tag identification problem. It is created in the process of querying and responding between the reader and tags. If the reader broadcasts K bits of prefix to multiple tags, all tags with the identifications matching the prefix transmit the reader the identifications consisted of k+1 bit to last. According to the simulation result, a proposed collision tree based anti-collision algorithm shows a better performance compared to tree working algorithm and query tree algorithm.

• Journal of the Society of Naval Architects of Korea
• /
• v.61 no.2
• /
• pp.106-114
• /
• 2024

In the 21st century, the rapid development of automation and artificial intelligence technologies is driving innovative changes in various industrial sectors. In the transportation industry, this is evident with the commercialization of autonomous vehicles. Moreover research into autonomous navigation technologies is actively underway in the aviation and maritime sectors. Consequently, for the practical implementation of autonomous ships, an effective collision avoidance algorithm has become a crucial element. Therefore, this study proposes a collision avoidance algorithm based on the Obstacle Zone by Target(OZT), which visually represents areas with a high likelihood of collisions with other ships or obstacles. The A-star algorithm was utilized to represent obstacles on a grid and assess collision risks. Subsequently, a collision avoidance algorithm was developed that performs fuzzy control based on calculated waypoints, allowing the vessel to return to its original course after avoiding the collision. Finally, the validity of the proposed algorithm was verified through collision avoidance simulations in various encounter scenarios.

• Journal of Information Technology Services
• /
• v.12 no.3
• /
• pp.331-343
• /
• 2013

In RFID systems, the anti-collision algorithm is being improved to recognize Tag's ID within recognition area of the reader quickly and efficiently. This paper focuses on Tag collision. Many studies have been carried out to resolve Tag collision. This paper proposes a new N-ary Query Tree Algorithm to resolve more than Tag collision simultaneously, according to the value of m(2 ~ 6). This algorithm can identify more tags than existing methods by treating a maximum 6 bit collision, regardless of the continuation/non-continuation Tag's ID patterns. So, it extracts maximumly different $2^6$ bit patterns per single prefix in recognition process. The performance of N-ary Query Tree Algorithm is evaluated by theoretical analysis and simulation program.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.235-242
• /
• 2012

In RFID System, one of the problem that we must slove is to devise a good anti-collision algorithms to improve the efficiency of tag identification which is usually low because of tag collision. Among of the existing RFID anti-collision algorithm, BS (Binary Search) algorithm, though simple, has a disadvantage that the stage of times used to identify the tags increase exponentially as the number of tags does. In this paper, I propose a new anti-collision algorithm called Multi-collision reflected frame which restricts the number of stages and decided bit. Since the proposal algorithm keep the length size of UID and density of total tag when have 100%. The simulation results showed that the proposed algorithm improves the efficiency by 30~50% compared to the existing algorithm.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.44-49
• /
• 2011

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In Gen-2 RFID system, if the slot-count size varies during a query round due to the collisions, a new query round begins with a QueryAdjust command. Anti-collision algorithm of Gen-2 RFID system is simple. But, it has the tag starvation problem that a tag may never be successfully identified because its responses always collide with others. Therefore, this paper proposes a scheme to guarantee the fair identification delay. In the proposed scheme, if the slot-count value changes due to the collisions, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that occurred collision during the previous query round.