Nothing Special   »   [go: up one dir, main page]

Skip to main content

Brief Announcement: Perpetual Exploration of Triangular Grid by Myopic Oblivious Robots Without Chirality

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2024)

Abstract

Exploration of different network topologies is one of the fundamental problems of distributed systems. The problem has been studied on networks like lines, rings, tori, rectangular grids, etc. In this work, we have considered a rectangle enclosed triangular grid (RETG). A RETG is a part of an infinite triangular grid and the part is enclosed by a rectangle whose one pair of parallel sides aligns with a family of parallel straight lines of the infinite triangular grid. We have studied the problem of perpetual exploration on a RETG using oblivious robots. We have considered the robots with limited visibility i.e. the robots are myopic. Infinite visibility becomes impractical for a very large network. Limited visibility is more practical than infinite visibility. The robots have neither any chirality nor any axis agreement. An algorithm is provided to explore the RETG perpetually without any collision. The algorithm works under a synchronous scheduler. The algorithm requires three robots with two hop visibility.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

Similar content being viewed by others

References

  1. Bramas, Q., Lafourcade, P., Devismes, S.: Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality. Theor. Comput. Sci. 977, 114162 (2023). https://doi.org/10.1016/J.TCS.2023.114162

    Article  MathSciNet  MATH  Google Scholar 

  2. Rauch, A., Bramas, Q., Devismes, S., Lafourcade, P., Lamani, A.: Optimal exclusive perpetual grid exploration by luminous myopic robots without common chirality. In: Echihabi, K., Meyer, R. (eds.) Networked Systems—9th International Conference, NETYS 2021, Virtual Event, May 19-21, 2021, Proceedings. Lecture Notes in Computer Science, vol. 12754, pp. 95–110. Springer (2021). https://doi.org/10.1007/978-3-030-91014-3_7

Download references

Acknowledgement

The first author is supported by Council of Scientific & Industrial Research (CSIR), Govt. of India. The second author is supported by University Grants Commission (UGC), Govt. of India. The third author is supported by Science and Engineering Research Board (SERB), Govt. of India.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Raja Das .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Das, R., Goswami, P., Sau, B. (2025). Brief Announcement: Perpetual Exploration of Triangular Grid by Myopic Oblivious Robots Without Chirality. In: Masuzawa, T., Katayama, Y., Kakugawa, H., Nakamura, J., Kim, Y. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2024. Lecture Notes in Computer Science, vol 14931. Springer, Cham. https://doi.org/10.1007/978-3-031-74498-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-74498-3_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-74497-6

  • Online ISBN: 978-3-031-74498-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics