Adrian Kosowski - Profil naukowy - MOST Wiedzy

Wyszukiwarka

Kontakt

Wybrane publikacje

  • How to meet when you forget: log-space rendezvous in arbitrary graphs

    - DISTRIBUTED COMPUTING - 2011

    Two identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...

    Pełny tekst w serwisie zewnętrznym

  • Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring

    - THEORETICAL COMPUTER SCIENCE - 2010

    One of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...

    Pełny tekst w serwisie zewnętrznym

  • Constructing a map of an anonymous graph: applications of universal sequences

    - LECTURE NOTES IN COMPUTER SCIENCE - 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...

    Pełny tekst w serwisie zewnętrznym

wyświetlono 109 razy