Article

Experiments on Recognition of Infinite Grid Graph Labelling

Authors:
  • Institute of Applied Mathematics and Mechanics of NAS of Ukraine
To read the full-text of this research, you can request a copy directly from the author.

Abstract

In recent years, topics related to automaton analysis of geometric environment have attracted widespread attention. The interaction of an automaton and an environment is often represented as a process of an automaton walks along a graph (labyrinth) of environment. Treating environment as vertex-labelled graph was suggested as one approach to addressing the problem of automaton analysis of environment properties. Research in this regard received a wide range of applications, for example, in the problems of image analysis and navigation of mobile robots. This paper considers a four-way infinite lattice graph as a model of an environment for a graph-walking automaton. All vertices of this graph are labelled with labels from a known set but concrete labelling function is not a priori known. The automaton looking over neighbourhood of the current vertex and may travel to some neighbouring vertex selected by its label. The objective of the automaton is to determine two pairs of opposite directions on the aforementioned graph embedded onto integer lattice, i.e. recognizing the graph labelling. In previous work we have proposed a labelling thanks to which a finite automaton can walk on graph in any arbitrary direction. We have called this labelling deterministic. We have proved that minimal deterministic vertex labelling of infinite lattice graph uses labels of five different types. The paper demonstrates that there exists 240 different minimal deterministic labellings of the infinite lattice graph with a fixed set of labels. We prove that a single automaton cannot recognize minimal deterministic labelling of the infinite lattice graph, but automaton with one pebble can. The novelty associated with this paper is a new type of experiment with vertex labelled graphs designed to recognition their labelling. The method of constructing and performing recognition experiment for labelled infinite grid graph is proposed.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the author.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
Automata walking on graphs are a mathematical formalization of autonomous mobile agents with limited memory operating in discrete environments. Under this model broad area of studies of the behaviour of automata in finite and infinite labyrinths (a labyrinth is an embedded directed graph of special form) arose and intensively developing. Research in this regard received a wide range of applications, for example, in the problems of image analysis and navigation of mobile robots. Automata operating in labyrinths can distinguish directions, that is, they have a compass. This paper examines vertex labellings of infinite square grid graph thanks to these labellings a finite automaton without a compass can walk along graph in any arbitrary direction. The automaton looking over neighbourhood of the current vertex and may move to some neighbouring vertex selected by its label. We propose a minimal deterministic traversable vertex labelling that satisfies the required property. A labelling is said to be deterministic if all vertices in closed neighbourhood of every vertex have different labels. It is shown that minimal deterministic traversable vertex labelling of square grid graph uses labels of five different types. Minimal deterministic traversable labelling of subgraphs of infinite square grid graph whose degrees are less than four are developed. The key problem for automata and labyrinths is the problem of constructing a finite automaton that traverse a given class of labyrinths. We say that automaton traverse infinite graph if it visits any randomly selected vertex of this graph in a finite time. It is proved that a collective of one automaton and three pebbles can traverse infinite square grid graph with deterministic labelling and any collective with fewer pebbles cannot. We consider pebbles as automata of the simplest form, whose positions are completely determined by the remaining automata of the collective. The results regarding to exploration of an infinite deterministic square grid graph coincide with the results of A.V. Andzhan (Andzans) regarding to traversal of an infinite mosaic labyrinth without holes. It follows from above that infinite grid graph after constructing a minimal traversable deterministic labelling on it and fixing two pairs of opposite directions on it becomes an analogue of an infinite mosaic labyrinth without holes.
Conference Paper
Full-text available
In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We propose to extract plane graphs, because of algorithmic properties these graphs have for isomorphism elated problems. We also consider the problem of extracting semantically well-founded graphs as a compression issue: we get simple graphs from which can be rebuilt images similar to the initial image. The technique we introduce consists in segmenting the original image, extracting interest pixels on the segmented image, then converting these pixels into pointels, which in turn can be related by region-based triangulation. We show the feasibility and interest of this approach in a series of experiments.
Book
This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theory.” Bulletin of the Institute of Combinatorics and its Applications “Succeeds dramatically ... a hell of a good book.” MAA Reviews “A highlight of the book is what is by far the best account in print of the Seymour-Robertson theory of graph minors.” Mathematika “ ... like listening to someone explain mathematics.” Bulletin of the AMS
Conference Paper
General-purpose exhaustive graph mining algorithms have seldom been used in real life contexts due to the high complexity of the process that is mostly based on costly isomorphism tests and countless expansion possibilities. In this paper, we explain how to exploit grid-based representations of problems to efficiently extract frequent grid subgraphs and create Bag-of-Grids which can be used as new features for classification purposes. We provide an efficient grid mining algorithm called GriMA which is designed to scale to large amount of data. We apply our algorithm on image classification problems where typical Bag-of-Visual-Words-based techniques are used. However, those techniques make use of limited spatial information in the image which could be beneficial to obtain more discriminative features. Experiments on different datasets show that our algorithm is efficient and that adding the structure may greatly help the image classification process.
Article
We analyse the state of the art of a rather new field of automata theory – the study of behaviour of automata in labyrinths; more than a hundred publications devoted to this topic have been published. We consider key notions, problems, achievements, methods of problem solutions, and open problems in an important direction of this study, the behaviour of independent systems of automata in labyrinths. In a series of cases, we give base assertions in a more-strong form and give a more general presentation than the authors of the corresponding papers do. New results are also contained in this survey.
Article
The behaviour of automata in labyrinths is a rather new field of automata theory, but more than one hundred papers devoted to this topic have been published. In this paper, we consider the key notions, problems, achievements, methods to solve problems, and open problems related to an important direction of this field, the behaviour of collectives of automata in labyrinths. In a series of cases, we give base assertions in a more strong form and give a more general presentation than the authors of the corresponding papers do. New results are also contained in this survey.
Article
We propose a new information-graph model for information storage and search. This model generalizes a number of known data-representation models. We study the main properties of the proposed model. We solve the problem of optimal informational graph synthesis for a wide class of search problems, including the most acute database search problems.
Reconstruction of the Graph of Operating Environment of Mobile Robot by Vertex Labeling Sufficient for Further Navigation
  • I S Grunsky
  • S V Sapunov