dr inż. Adrian Kosowski
Contact
 adrkosow@pg.edu.pl
Publication showcase

How to meet when you forget: logspace rendezvous in arbitrary graphs
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 wellknown recent result...

Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
One of the recently considered models of robotbased computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in LookComputeMove 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...

Constructing a map of an anonymous graph: applications of universal sequences
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...
seen 129 times