• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.5
• /
• pp.285-293
• /
• 2013

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the Bit Pattern Prediction Algorithm(BPPA) for the efficient identification of the multiple tags. The BPPA is based on the tree algorithm using the time slot and identify the tag quickly and efficiently using accurate bit pattern prediction method. Through mathematical performance analysis, We proved that the BPPA is an O(n) algorithm by analyzing the worst-case time complexity and the BPPA's performance is improved compared to existing algorithms. Through MATLAB simulation experiments, we verified that the BPPA require the average 1.2 times query per one tag identification and the BPPA ensure stable performance regardless of the number of the tags.

• Nuclear Engineering and Technology
• /
• v.54 no.12
• /
• pp.4560-4570
• /
• 2022

Dynamic fault tree (DFT) and its related research methods have received extensive attention in safety analysis and reliability engineering. DFT can perform reliability modelling for systems with sequential correlation, resource sharing, and cold and hot spare parts. A technical modelling method of DFT is proposed for modelling ship collision accidents and loss-of-coolant accidents (LOCAs). Qualitative and quantitative analyses of DFT were carried out using the cutting sequence (CS)/extended cutting sequence (ECS) method. The results show nine types of dynamic fault failure modes in ship collision accidents, describing the fault propagation process of a dynamic system and reflect the dynamic changes of the entire accident system. The probability of a ship collision accident is 2.378 × 10^-9 by using CS. This failure mode cannot be expressed by a combination of basic events within the same event frame after an LOCA occurs in a marine nuclear reactor because the system contains warm spare parts. Therefore, the probability of losing reactor control was calculated as 8.125 × 10^-6 using the ECS. Compared with CS, ECS is more efficient considering expression and processing capabilities, and has a significant advantage considering cost.

• Journal of the Korea Computer Graphics Society
• /
• v.25 no.2
• /
• pp.11-18
• /
• 2019

In this paper, we propose a framework that can perform acceleration collision detection efficiently by using a cone based collision area in a particle-based system which requires collision detection with many objects. Three conditions determine particle and cone-based collision regions: 1) If there is a cone position within the radius of the adjacent particle, 2) In the case where the position of the adjacent particle exists in the cone area, 3) When adjacent particles exist between two vectors forming a cone area. As a result, it is defined that when the above conditions are all satisfied, the particle and the region of a cone have collided. In this paper, we automatically update the area of the cone, which is the collision detection area, according to the particle movement. Determine the direction and length of the cone based on the position and velocity of the particle to calculate the dynamic change of the cone. Collision detection is performed quickly using only the particles in the finally calculated area. The acceleration method proposed in this paper is simple to implement because it is executed with a closed form equation instead of explicitly creating the tree data structure, and collision inspection performance is improved in all results.

• The KIPS Transactions:PartA
• /
• v.15A no.3
• /
• pp.155-160
• /
• 2008

RFID technology has been gradually expanding its application. One of the important performance issues in RFID systems is to resolve the collision among multi-tags identification on restricted area. We consider a new anti-collision scheme based on Class Identification algorithm using Depth-First scheme. We evaluate how much performance can be improved by Class identification algorithm in the cases of Query-tree more then 17% identification rate and 150% performance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.473-476
• /
• 2007

RFID(Radio Frequency IDentification) 기술은 RF 신호를 사용하여 물품에 부착된 전자 태그(tag)를 인식하는 자동인식 기술이다. 이런 RFID 기술의 확산을 위해서는 다수의 태그를 빠르게 읽는 다중접속 방식에서 태그 간 충돌 문제를 해결 하는 충돌방지(anti-collision) 알고리즘이 필수적으로 요구된다. 본 논문에서는 이 문제를 해결하기 위해 충돌 방지 알고리즘 중에서 트리 기반 메모리래스(tree based memoryless) 충돌방지 알고리즘 기반인 충돌 추적(collision tracking) 알고리즘을 개선한 RCT(Revised Collision Tracking) 방식을 제안한다. 그리고 기존의 충돌 추적 알고리즘과의 성능 비교를 통해 제안하는 방식의 성능을 증명한다.

• International Journal of Contents
• /
• v.2 no.1
• /
• pp.34-38
• /
• 2006

In this paper, an overview of anti-collision algorithm for RFID system of a standard EPC Class1 protocol is presented, and the binslotted dynamic search algorithm (BDS) based upon the slotted ALOHA and binary tree procedure is proposed and analyzed. Also, the performance is evaluated as comparing the BDS algorithm with the standard bin-slotted algorithm (BSA) through the simulation program. The performance of the proposed BDS algorithm is improved by dynamically identifying the collided-bit position and the collided bins stored in the stack of the reader. As the results, the number of request command that a reader send to tags in the reader s interrogation zone and the total recognition time are decreased to 59% as compared with BSA algorithm. Therefore, the tag identification performance is fairly improved by resolving a collision problem using the proposed BDS algorithm.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1996.06c
• /
• pp.638-647
• /
• 1996

Robot manipulators for harvesting fruits must be controlled to track the desired path of end-effector to avoid obstacles under the consideration of collision free area and safety path. This paper presents a robot path control algorithm to secure a collision free area with the recognition of work environments. The flexible space, which does not damage fruits or branches of tree due to their flexibility and physical properties , extends the workspace. Now the task is to control robot path in the extended workspace with the consideration of collision avoidance and velocity limitation at the time of collision concurrently. The feasibility and effectiveness of the new algorithm for redundant manipulators were tested through simulations of a redundant manipulator for different joint velocities.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.1
• /
• pp.44-52
• /
• 2008

In this paper we consider detecting collisions between characters whose motion is specified by motion capture data. Since we are targeting on massive crowd simulation, we only consider rough collisions, modeling the characters as a disk in the floor plane. To provide efficient collision detection, we introduce a hierarchical bounding volume, the Motion Oriented Bounding Box tree (MOBB tree). A MOBBtree stores space-time bounds of a motion clip. In crowd animation tests, MOBB trees performance improvements ranging between two and an order of magnitude.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.435-445
• /
• 2013

One of the most challenging issues in radio frequency identification (RFID) and near field communications (NFC) is to correctly and quickly recognize a number of tag IDs in the reader's field. Unlike the probabilistic anti-collision schemes, a query tree based protocol guarantees to identify all the tags, where the distribution of tag IDs is assumed to be uniform. However, in real implements, the prefix of tag ID is uniquely assigned by the EPCglobal and the remaining part is sequentially given by a company or manufacturer. In this paper, we propose an enhanced M-ary query tree protocol (EMQT), which effectively reduces unnecessary query-response cycles between similar tag IDs using m-bit arbitration and tag expectation. The theoretical analysis and simulation results show that the EMQT significantly outperforms other schemes in terms of identification time, identification efficiency and communications overhead.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.16-18
• /
• 2006

RFID는 RF신호를 이용하여 물체에 부착된 태그(tag)를 읽어 물체를 식별하는 비 접촉 인식 기술이다. RFID 리더의 식별영역에 여러 개의 태그가 있는 경우 이들 사이의 충돌(collision)이 발생되기 때문에 이들을 식별할 수 있는 메커니즘이 있어야 한다. 본 논문에서는 먼저 기존에 제안된 트리 기반 메모래스 충돌방지 알고리즘들을 살펴보고, 본 논문에서 제안하는 향상된 쿼리 기반 충돌 알고리즘(AQT : Advanced Query Tree based Collision Algorithm)을 소개한다.