Robot Positioning Using Torus Packing for Multisets
<|reference_start|>Robot Positioning Using Torus Packing for Multisets: We consider the design of a positioning system where a robot determines its position from local observations. This is a well-studied problem of considerable practical importance and mathematical interest. The dominant paradigm derives from the classical theory of de Bruijn sequences, where the robot has access to a window within a larger code and can determine its position if these windows are distinct. We propose an alternative model in which the robot has more limited observational powers, which we argue is more realistic in terms of engineering: the robot does not have access to the full pattern of colours (or letters) in the window, but only to the intensity of each colour (or the number of occurrences of each letter). This leads to a mathematically interesting problem with a different flavour to that arising in the classical paradigm, requiring new construction techniques. The parameters of our construction are optimal up to a constant factor, and computing the position requires only a constant number of arithmetic operations.<|reference_end|>
@article{chen2024robot,
    title={Robot Positioning Using Torus Packing for Multisets},
    author={Chung Shue Chen, Peter Keevash, Sean Kennedy, 'Elie de Panafieu,
  Adrian Vetta},
    journal={arXiv preprint arXiv:2404.09981},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.09981},
    primaryClass={cs.DM}
}