Brief announcement: discovering and assessing fine-grained metrics in robot networks protocols

Authors:
François Bonnet;Xavier Défago;Franck Petit;Maria Gradinariu Potop-Butucaru;Sébastien Tixeuil
Affiliations:
School of Information Science, JAIST, Japan;School of Information Science, JAIST, Japan;LIP6 CNRS, UPMC Sorbone Universités, France;LIP6 CNRS, UPMC Sorbone Universités, France;LIP6 CNRS, UPMC Sorbone Universités, France,Institut Universitaire de France, France
Venue:
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Year:
2012

Citing 5
Cited 0

Gathering asynchronous oblivious mobile robots in a ring

Theoretical Computer Science
On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Computing without communicating: ring exploration by asynchronous oblivious robots

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Exclusive perpetual ring exploration without chirality

DISC'10 Proceedings of the 24th international conference on Distributed computing
Asynchronous exclusive perpetual grid exploration without sense of direction

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In discrete anonymous environments, robot algorithms consist in a list of rules, where each rule takes a configuration of the system as input and outputs the set of robots that are required to move when the system is in this configuration. Based on these rules and on the robots' activations by the scheduler, the system globally evolves and, when the algorithm is correct, it solves the targeted problem.