Dynamic Slot Partition Algorithm of Contention Avoid Positioning of UWB Label Based on Markov Model
Multiple mobile UWB labels' positioning without conflict in a intensive environment is a problem, we put forward a method that takes the labels number as the only limited units in the envelope area with conflict free collision conditions for time slot length optimization, it is concluded the optimal capacity is estimated under the transition probability of markov and constraint functions. In order to keep balance between sampling data frequency of labels' effective positioning and increasing the utilization rate of time slot in each time frame as far as possible, we will construct dynamic time slot that is based on the algorithmic label numbers. Flight experiments were carried out to verify the result. We take a rectangle envelope as a multiple base station area for an example. Data processing and analysis are proved to optimize the positioning rate of each UWB label and to reduce the formation of large sparse time slot and empty slots, which is compared to a primary model of the fixed time slot in the fixed time frame.
AsiaSim/SCS AutumnSim