Simple and Robust Binary Self-Location Patterns

TL;DR

This paper introduces a straightforward binary grid pattern for accurate self-location within a finite area, enabling efficient and robust position decoding from minimal pixel data.

Contribution

It proposes a simple, local encoding method for binary patterns that allows for precise and robust self-positioning in planar regions.

Findings

Pattern enables accurate self-location with few pixel reads

Decoding process is efficient and robust against noise

Applicable in various localization scenarios

Abstract

A simple method to generate a two-dimensional binary grid pattern, which allows for absolute and accurate self-location in a finite planar region, is proposed. The pattern encodes position information in a local way so that reading a small number of its black or white pixels at any place provides sufficient data from which the location can be decoded both efficiently and robustly.