Skip to main content

Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2008)

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

Abstract

Systems of autonomous mobile robots have been attracted as distributed systems. Minimal setting for robots to solve some class of problems has been studied with theoretical concerns. This paper contributes discussion on relationship between inaccuracy of compasses which give axes of coordinate systems of robots and the possibility of gathering robots. The gathering problem is to make all robots meet at a single point which is not predefined. The problem has been shown to be solvable for two robots with dynamically variable compasses within the difference of π/4 between two robots. This paper improves the limit of difference to π/3. This is shown with the fully asynchronous robot model CORDA. Configurations and executions of robot systems for CORDA with dynamic compasses are formalised. In order to deal with behaviors of robots a concept of relative configurations is also introduced.

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. Prencipe, G.: On the feasibility of gathering by autonomous mobile robots. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 246–261. Springer, Heidelberg (2005)

    Google Scholar 

  2. Prencipe, G.: CORDA: distributed coordination of a set of autonomous mobile robots. In: ERSADS 2001, pp. 185–190 (2001)

    Google Scholar 

  3. Prencipe, G.: Distributed coordination of a set of autonomous mobile robots. PhD thesis, Università di Pisa (2002)

    Google Scholar 

  4. Suzuki, I., Yamashita, M.: Distributed anonymous mobile robot – formation and agreement problems. In: SIROCCO 1996. Carleon Scientific, pp. 313–330 (1996)

    Google Scholar 

  5. Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM Journal of Computing 28(4), 1347–1363 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous oblivious robots with limited visibility. Theoretical Computer Science 337(1-3), 147–168 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  7. Souissi, S., Défago, X., Yamashita, M.: Gathering asynchronous mobile robots with inaccurate compasses. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 333–349. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Imazu, H., Itoh, N., Katayama, Y., Inuzuka, N., Wada, K.: A gathering problem for autonomous mobile robots with disagreement in compasses. In: 1st Workshop on Theoretical Computer Science in Izumo (in Japanese), pp. 43–46 (2005)

    Google Scholar 

  9. Katayama, Y., Tomida, Y., Imazu, H., Inuzuka, N., Wada, K.: Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 274–288. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 549–560. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Souissi, S., Défago, X., Yamashita, M.: Using eventually consistent compasses to gather oblivious mobile robots with limited visibility. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 484–500. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Yamashita, M., Souissi, S., Defago, X.: Tight bound on the gathering of two oblivious mobile robots with inconsistent compasses. Research Report, JAIST, IS-RR-2007-006 (2007)

    Google Scholar 

  13. Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result. In: DISC 2007. LNCS, vol. 4738, pp. 298–312. Springer, Heidelberg (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alexander A. Shvartsman Pascal Felber

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Inuzuka, N., Tomida, Y., Izumi, T., Katayama, Y., Wada, K. (2008). Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses. In: Shvartsman, A.A., Felber, P. (eds) Structural Information and Communication Complexity. SIROCCO 2008. Lecture Notes in Computer Science, vol 5058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69355-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69355-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69326-0

  • Online ISBN: 978-3-540-69355-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics