Research About Robust Positioning Sequences

Robust positioning pattern is a large array that allows a mobile device to locate its position by reading a possibly corrupted small window around it.The one-dimensional robust positioning pattern is usually called robust positioning sequence.In this paper,we first introduce and summarize the current research on robust positioning patterns,and then we will focus on the one-dimensional case,respectively introducing the research method of the upper bound of robust positioning sequences and the construction method of the current robust positioning sequences with minimum redundancy for a given distance.At the same time,we use the difference set structure to construct a number of new robust location sequences whose length reaches the upper bound,and prove that it is impossible to construct new robust location sequences whose length reaches the upper bound by the difference set.