Skip to main content

Geometric Computations by Broadcasting Automata on the Integer Grid

  • Conference paper
Unconventional Computation (UC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6714))

Included in the following conference series:

Abstract

In this paper we introduce and apply a novel approach for self-organization, partitioning and pattern formation on the non-oriented grid environment. The method is based on the generation of nodal patterns in the environment via sequences of discrete waves. The power of the primitives is illustrated by giving solutions to two geometric problems using the broadcast automata model arranged in an integer grid (a square lattice) formation. In particular we show linear time algorithms for: the problem of finding the centre of a digital disk starting from any point on the border of the disc and the problem of electing a set of automata that form the inscribed square of such a digital disk.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alderighi, S., Mazzei, T.: Broadcast Automata: a Parallel Scalable Architecture for Prototypal Embedded Processors for Space Applications. HICSS (5), 208–217 (1997)

    Google Scholar 

  2. Czyzowicz, J., Gąsieniec, L., Pelc, A.: Gathering Few Fat Robots in the Plane. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 350–364. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Peleg, D., Efrima, A.: Distributed algorithms for partitioning a swarm of autonomous mobile robots. Theoretical Computer Science 410(14), 1355–1368 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hendriks, M.: Model Checking the Time to Reach Agreement. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 98–111. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Lee, G., Chong, N.: A geometric approach to deploying robot swarms. Annals of Mathematics and Artificial Intelligence, 257–280 (2008)

    Google Scholar 

  6. Kari, J.: Theory of cellular automata: a survey. Theor. Comput. Sci. 334 (2005)

    Google Scholar 

  7. Standing Waves (January 2010), http://en.wikipedia.org/wiki/Standing_wave

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martin, R., Nickson, T., Potapov, I. (2011). Geometric Computations by Broadcasting Automata on the Integer Grid. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds) Unconventional Computation. UC 2011. Lecture Notes in Computer Science, vol 6714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21341-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21341-0_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21340-3

  • Online ISBN: 978-3-642-21341-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics