Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots

DOI10.1016/J.TCS.2022.01.046OpenAlexW2978369170MaRDI QIDQ2118868FDOQ2118868

Oscar Morales-Ponce

Publication date: 23 March 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.046

zbMATH Keywords

lower boundrobotsidle timepatrolling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• Patrolling trees with mobile robots
• Fence patrolling by mobile agents with distinct speeds
• When patrolmen become corrupted: monitoring a graph using faulty mobile robots
• Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
• Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits
• Two Robots Patrolling on a Line: Integer Version and Approximability
• Patrolling by Robots Equipped with Visibility

Cited In (3)

• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• Multi-robot area patrol under frequency constraints
• Visiting infinitely often the unit interval while minimizing the idle time of high priority segments

This page was built for publication: Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118868)