Skip to main content
SpringerLink
Log in

Visiting Infinitely Often the Unit Interval While Minimizing the Idle Time of High Priority Segments

  • Conference paper
  • First Online:
Book cover Structural Information and Communication Complexity (SIROCCO 2019)

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

  • 315 Accesses

Abstract

Consider a region that require to be protected from unauthorized penetrations. A team of robots can patrol (perpetually move along) the border of the region looking for intruders. The problem is known as the patrolling problem and has been extensively studied.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Chuangpishit, H., Czyzowicz, J., Gąsieniec, L., Georgiou, K., Jurdziński, T., Kranakis, E.: Patrolling a path connecting a set of points with unbalanced frequencies of visits. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 367–380. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73117-9_26

    Chapter  Google Scholar 

  2. Collins, A., et al.: Optimal patrolling of fragmented boundaries. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 241–250. ACM (2013)

    Google Scholar 

  3. Czyzowicz, J., Gąsieniec, L., Kosowski, A., Kranakis, E.: Boundary patrolling by mobile agents with distinct maximal speeds. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 701–712. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23719-5_59

    Chapter  Google Scholar 

  4. Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Krizanc, D., Taleb, N.: When patrolmen become corrupted: monitoring a graph using faulty mobile robots. Algorithmica 79(3), 925–940 (2017)

    Article  MathSciNet  Google Scholar 

  5. Czyzowicz, J., Kosowski, A., Kranakis, E., Taleb, N.: Patrolling trees with mobile robots. In: Cuppens, F., Wang, L., Cuppens-Boulahia, N., Tawbi, N., Garcia-Alfaro, J. (eds.) FPS 2016. LNCS, vol. 10128, pp. 331–344. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-51966-1_22

    Chapter  Google Scholar 

  6. Gąsieniec, L., Klasing, R., Levcopoulos, C., Lingas, A., Min, J., Radzik, T.: Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors). In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 229–240. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-51963-0_18

    Chapter  MATH  Google Scholar 

  7. Kawamura, A., Kobayashi, Y.: Fence patrolling by mobile agents with distinct speeds. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 598–608. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-35261-4_62

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Computer Science, California State University Long Beach, Long Beach, CA, USA

    Oscar Morales-Ponce

Authors
  1. Oscar Morales-Ponce
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oscar Morales-Ponce .

Editor information

Editors and Affiliations

  1. Technion, Haifa, Israel

    Keren Censor-Hillel

  2. University of L'Aquila, L'Aquila, Italy

    Michele Flammini

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Morales-Ponce, O. (2019). Visiting Infinitely Often the Unit Interval While Minimizing the Idle Time of High Priority Segments. In: Censor-Hillel, K., Flammini, M. (eds) Structural Information and Communication Complexity. SIROCCO 2019. Lecture Notes in Computer Science(), vol 11639. Springer, Cham. https://doi.org/10.1007/978-3-030-24922-9_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24922-9_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24921-2

  • Online ISBN: 978-3-030-24922-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation