Mathematical Analysis for Binary Tree Algorithm in RFID

2008 ◽  
Author(s):  
Yinghua Cui ◽  
Yuping Zhao
Keyword(s):  
Mathematical Analysis ◽  
Binary Tree ◽  
Tree Algorithm

scholarly journals Path Planning of Anti ship Missile based on Voronoi Diagram and Binary Tree Algorithm

2019 ◽  
Vol 69 (4) ◽  
pp. 369-377
Author(s):  
Yan Shi ◽  
Lihua Zhang ◽  
Shouquan Dong
Keyword(s):  
Path Planning ◽  
Voronoi Diagram ◽  
Binary Tree ◽  
Dijkstra Algorithm ◽  
Tree Algorithm ◽  
Multiple Missiles ◽  
Intractable Problem ◽  
The Relationship

The path planning of anti-ship missile should be considered both cruising in safety and striking in quick, which is an intractable problem. In particular, it is difficult to consider the safety of each missile path in the path planning of multiple missiles. To solve this problem, the “AREA Algorithm” is presented to divide the relative relations of areas：relative security area of the threat areas and fast-attack area of target approaching. Specifically，it is a way to achieve area division through the relationship between the target and the center of the operational area. The Voronoi diagram topology network, Dijkstra algorithm and binary tree algorithm have been used in the above process as well. Finally, Simulations have verified the feasibility and obvious advantages of “AREA Algorithm” compared with the single algorithm, and the tactical meaning in path planning of multiple missiles.

scholarly journals cytometree: A binary tree algorithm for automatic gating in cytometry analysis

2018 ◽  
Vol 93 (11) ◽  
pp. 1132-1140 ◽  
Author(s):  
Daniel Commenges ◽  
Chariff Alkhassim ◽  
Raphael Gottardo ◽  
Boris Hejblum ◽  
Rodolphe Thiébaut
Keyword(s):  
Binary Tree ◽  
Tree Algorithm

scholarly journals ClusterTree-RS: A binary tree algorithm identifying coregulated genes by clustering regulatory signals

2006 ◽  
Vol 40 (3) ◽  
pp. 465-473
Author(s):  
E. D. Stavrovskaya ◽  
V. Yu. Makeev ◽  
A. A. Mironov
Keyword(s):  
Binary Tree ◽  
Tree Algorithm

Path planning with obstacle avoidance based on visibility binary tree algorithm

2013 ◽  
Vol 61 (12) ◽  
pp. 1440-1449 ◽  
Author(s):  
Abdulmuttalib Turky Rashid ◽  
Abduladhem Abdulkareem Ali ◽  
Mattia Frasca ◽  
Luigi Fortuna
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Binary Tree ◽  
Tree Algorithm

scholarly journals A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System

Micromachines ◽  
2020 ◽  
Vol 11 (8) ◽  
pp. 755
Author(s):  
Yen-Hung Chen ◽  
Yen-An Chen ◽  
Shu-Rong Huang
Keyword(s):  
Radio Frequency Identification ◽  
Binary Tree ◽  
Arrival Rate ◽  
Tag Identification ◽  
Coverage Area ◽  
Tree Algorithm ◽  
Clinical Laboratories ◽  
Conveyor Belts ◽  
Time Required ◽  
Specimen Management

Hospitals are continuously working to reduce delayed analysis and specimen errors during transfers from testing stations to clinical laboratories. Radio-frequency identification (RFID) tags, which provide automated specimen labeling and tracking, have been proposed as a solution to specimen management that reduces human resource costs and analytic delays. Conventional RFID solutions, however, confront the problem of traffic jams and bottlenecks on the conveyor belts that connect testing stations with clinical laboratories. This mainly results from methods which assume that the arrival rate of specimens to laboratory RFID readers is fixed/stable, which is unsuitable and impractical in the real world. Previous RFID algorithms have attempted to minimize the time required for tag identification without taking the dynamic arrival rates of specimens into account. Therefore, we propose a novel RFID anti-collision algorithm called the Mobility Aware Binary Tree Algorithm (MABT), which can be used to improve the identification of dynamic tags within the reader’s coverage area and limited dwell time.

Sign in / Sign up

Export Citation Format

Share Document