#### Filter Results:

- Full text PDF available (50)

#### Publication Year

2004

2016

- This year (0)
- Last 5 years (15)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
- Algorithmica
- 2007

We consider the problem of exploring an anonymous unoriented ring by a team of k identical, oblivious, asynchronous mobile robots that can view the environment but cannot communicate. This weak scenario is standard when the spatial universe in which the robots operate is the two-dimensional plane, but (with one exception) has not been investigated before… (More)

Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to a factor depending on the cone number k and the dimension of the space. TD-Delaunay graphs, a.k.a. triangular-distance Delaunay triangulations introduced by Chew, have been shown… (More)

- Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
- ACM Trans. Algorithms
- 2005

A finite automaton, simply referred to as a <i>robot</i>, has to explore a graph, that is, visit all the nodes of the graph. The robot has no a priori knowledge of the topology of the graph, nor of its size. It is known that for any <i>k</i>-state robot, there exists a graph of maximum degree 3 that the robot cannot explore. This article considers the… (More)

- Pierre Fraigniaud, David Ilcinkas
- STACS
- 2004

Under the robot model, we show that a robot needsΩ(n log d) bits of memory to perform exploration of digraphs with n nodes and maximum out-degree d. We then describe an algorithm that allows exploration of any n-node digraph with maximum out-degree d to be accomplished by a robot with a memory of size O(nd logn) bits. Under the agent model, we show that… (More)

- Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
- SIROCCO
- 2008

In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. The weakest of the commonly used models is Asynch where the autonomous mobile robots, endowed with visibility sensors (but otherwise unable to communicate), operate in… (More)

- Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
- Distributed Computing
- 2009

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, and so that some local equity (fairness) criterion is satisfied for the adjacent undirected edges. Such strategies can be seen as an… (More)

- Jurek Czyzowicz, Stefan Dobrev, +7 authors Wing-Kin Sung
- SIROCCO
- 2009

We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an input simple, connected, undirected graph in a periodic manner. Graphs are assumed to be anonymous, that is, nodes are unlabeled. While visiting a node, the agent may distinguish between the edges incident to it; for… (More)

- Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
- MFCS
- 2004

Two anonymous mobile agents (robots) moving in an asynchronous manner have to meet in an infinite grid of dimension δ > 0, starting from two arbitrary positions at distance at most d. Since the problem is clearly infeasible in such general setting, we assume that the grid is embedded in a δ-dimensional Euclidean space and that each agent knows the Cartesian… (More)

- Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
- PODC
- 2006

We study the problem of the amount of knowledge about a communication network that must be given to its nodes in order to efficiently disseminate information. While previous results about communication in networks used particular partial information available to nodes, such as the knowledge of the neighborhood or the knowledge of the network topology within… (More)