#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2010

2016

- This year (0)
- Last 5 years (14)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil
- SIROCCO
- 2011

We consider a set of k autonomous robots that are endowed with visibility sensors (but that are otherwise unable to communicate) and motion ac-tuators. Those robots must collaborate to reach a single vertex that is unknown beforehand, and to remain there hereafter. Previous works on gathering in ring-shaped networks suggest that there exists a tradeoff… (More)

We propose a gathering protocol for an even number of robots in a ring-shaped network that allows symmetric but not periodic configurations as initial configurations, yet uses only local weak multiplicity detection. Robots are assumed to be anonymous and oblivious, and the execution model is the non-atomic CORDA model with asynchronous fair scheduling. In… (More)

We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating exploration (exploration for short) of a grid-shaped network by a team of k asynchronous oblivious robots in the asynchronous non-atomic model, so-called CORDA. In more details, we first consider the ATOM model. We show that it is impossible to explore a grid of at… (More)

We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the ability to sense their environment and take decisions based on their local view. Previous works in this weak scenario prove that k must not divide n for a deterministic solution to… (More)

- Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
- 2013 IEEE 33rd International Conference on…
- 2013

The problem of exploring a discrete environment by identical oblivious asynchronous agents (or robots) devoid of direct means of communication has been well investigated so far. The (terminating) exploration requires that starting from a configuration where no two agents occupy the same node, every node needs to be visited by at least one agent, with the… (More)

- Zohir Bouzid, Anissa Lamani
- SSS
- 2011

In this paper, we consider the problem of formation of a series of geometric patterns [4] by a network of oblivious mobile robots that communicate only through vision. So far, the problem has been studied in models where robots are either assumed to have distinct identifiers or to be completely anonymous. To generalize these results and to better understand… (More)

In this paper, we present the first snap-stabilizing message forwarding protocol that uses a number of buffers per node being independent of any global parameter, that is 4 buffers per link. The protocol works on a linear chain of nodes, that is possibly an overlay on a large-scale and dynamic system, e.g., Peer-to-Peer systems, Grids.. . Provided that the… (More)

- Alain Cournier, Swan Dubois, Anissa Lamani, Franck Petit, Vincent Villain
- ICDCN
- 2012

In this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide solutions that either use a significant number of buffers (that is n buffers per processor , where n is the number of processors in the network) making the solution not scalable… (More)

- S. Devismes, A. Lamani, F. Petit, S. Tixeuil
- 2013

We consider autonomous robots that are endowed with motion actuators and visibility sensors. The robots we consider are weak, i.e., they are anonymous, uniform, unable to explicitly communicate, and oblivious (they do not remember any of their past actions). In this paper, we propose an optimal (w.r.t. the number of robots) solution for the terminating… (More)

- Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
- 2015 IEEE International Parallel and Distributed…
- 2015

We consider the deterministic terminating exploration of an anonymous, unoriented ring using asynchronous and oblivious robots.We address the problem of reducing the resource as much as possible in terms of number of required robots and in terms of vision capacities. We assume myopic robots, i.e., their vision is limited within a certain distance f,… (More)