报告人：魏恒嘉博士 (Ben-Gurion University of the Negev )
线上讲座，Tencent会议 ID：155 136 630
报告摘要：A robust positioning pattern is a large array in which the contents of any subarray of given dimension can determine the subarray's position, even if they are corrupted by errors. The design of such patterns is fundamental in robotics. In this talk, we present an explicit construction of positioning patterns, equipped with an efficient locating algorithm, that are robust to a constant fraction of errors and have asymptotically optimal rate. In addition, we discuss the maximum length of one-dimensional robust poisoning sequences.