KLASING, Ralf

doi:10.1007/978-3-642-45278-9_2

Métadonnées

Licence d’utilisation du document

KLASING, Ralf
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]

Langue

Communication dans un congrès

Ce document a été publié dans

Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), 2013-07-10, Rouen. 2013-07, vol. 8288, p. 7-13

Springer

Résumé en anglais

We consider the problem of exploring an anonymous undirected graph using an oblivious robot. The studied exploration strategies are designed so that the next edge in the robot's walk is chosen using only local information. In this paper, we present some current developments in the area. In particular, we focus on recent work on equitable strategies and on the multi-agent rotor-router.< Réduire