Advertisement

Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols

  • François Bonnet
  • Xavier Défago
  • Franck Petit
  • Maria Gradinariu Potop-Butucaru
  • Sébastien Tixeuil
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7596)

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.

Keywords

Mobile Robot Simple Cycle Exploration Problem Exploration Algorithm Torus Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 428–445. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Blin, L., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Exclusive Perpetual Ring Exploration without Chirality. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 312–327. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  3. 3.
    Bonnet, F., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 251–265. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  4. 4.
    Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theoretical Computer Science 390(1), 27–39 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 105–118. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • François Bonnet
    • 1
  • Xavier Défago
    • 1
  • Franck Petit
    • 2
  • Maria Gradinariu Potop-Butucaru
    • 2
  • Sébastien Tixeuil
    • 2
    • 3
  1. 1.School of Information ScienceJAISTJapan
  2. 2.LIP6 CNRSUPMC Sorbone UniversitésFrance
  3. 3.Institut Universitaire de FranceFrance

Personalised recommendations