Search results for: KONSTRUKCJA MAPY - Bridge of Knowledge

Search results for: KONSTRUKCJA MAPY

results on page:
embed this view on your website

Found little results, maybe try searching with alternative method.

Filters

total: 1

clear all filters disabled

Constructing a map of an anonymous graph: applications of universal sequences
Publication
- J. Chalopin
- S. Das
- A. Kosowski
- LECTURE NOTES IN COMPUTER SCIENCE - Year 2010
We study the problem of mapping an unknown environmentrepresented as an unlabelled undirected graph. A robot (or automaton)starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria...

Full text to download in external service