Artificial intelligence

Abstract: The problem of self-localization of a mobile agent (MA) in an environment modeled by a graph with labeled vertices is considered. This problem is actual in connection with problems of navigation of autonomous mobile robots. MA reads labels of the current vertex and its neighborhood. It can move along the edges of the graph from vertex to vertex. In addition MA can drop the pebble at the vertex or pick up the pebble that it has previously dropped at the vertex. We propose construction and realization methods for experiments on the recognition of MA initial position on graph. These methods are based on checking the isomorphism of subgraphs generated by hypothetical initial vertices.

Keywords:

References: