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

DOI10.1016/J.TCS.2022.01.046MaRDI QIDQ2118868zbMATH OpenOpenAlexFDO

Authors Oscar Morales-Ponce

Publication date 23 March 2022

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• Visiting infinitely often the unit interval while minimizing the idle time of high priority segments
• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
• Patrolling a path connecting a set of points with unbalanced frequencies of visits
• Patrolling by robots equipped with visibility
• Distributed patrolling with two-speed robots (and an application to transportation)

Cites work

• Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• Patrolling a path connecting a set of points with unbalanced frequencies of visits
• Patrolling by robots equipped with visibility
• Patrolling trees with mobile robots
• Two Robots Patrolling on a Line: Integer Version and Approximability
• When patrolmen become corrupted: monitoring a graph using faulty mobile robots

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)