On mobile agent self-location using topological properties of environment

The paper is dedicated to methods of distinction of vertices in labeled graphs by an automaton walking on the graph and reading vertex labels. This problem arises in the navigation of mobile robots using topological maps of the environment. We propose construction and realization methods for distinguishing experiments with deterministic graphs based on checking the isomorphism of subgraphs generated by all vertices that are accessible from compared vertices.