Visiting infinitely often the unit interval while minimizing the idle time of high priority segments

Oscar Morales-Ponce

Conference Proceedings

Visiting infinitely often the unit interval while minimizing the idle time of high priority segments

Morales-Ponce O

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11639 LNCS 361-365

DOI: 10.1007/978-3-030-24922-9_30

0Citations

1Readers

Get full text

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.

Cite

CITATION STYLE

APA

Morales-Ponce, O. (2019). Visiting infinitely often the unit interval while minimizing the idle time of high priority segments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11639 LNCS, pp. 361–365). Springer Verlag. https://doi.org/10.1007/978-3-030-24922-9_30

Visiting infinitely often the unit interval while minimizing the idle time of high priority segments

Abstract

Cite

Register to see more suggestions