Distance-based solution of patrolling problems with individual waiting times

DOI10.4230/OASICS.ATMOS.2021.14MaRDI QIDQ6587292zbMATH OpenFDO

Authors Peter Damaschke

Publication date 13 August 2024

Full work available at URL https://doi.org/10.4230/OASICS.ATMOS.2021.14

zbMATH Keywords

patrollingperiodic schedulingshortest pathwell-quasi ordering

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Patrolling a path connecting a set of points with unbalanced frequencies of visits
• Generalised formulations for minimum distance trajectory in patrolling problems
• Patrolling by robots equipped with visibility
• Two Robots Patrolling on a Line: Integer Version and Approximability
• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling

Cited in

(3)

• Two Robots Patrolling on a Line: Integer Version and Approximability
• Generalised formulations for minimum distance trajectory in patrolling problems
• The Fagnano triangle patrolling problem

This page was built for publication: Distance-based solution of patrolling problems with individual waiting times

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