The Fagnano triangle patrolling problem
From MaRDI portal
Cites work
- A distributed ant algorithm for efficiently patrolling a network
- Continuous patrolling and hiding games
- Distance-based solution of patrolling problems with individual waiting times
- Distributed patrolling with two-speed robots (and an application to transportation)
- Dual billiards, Fagnano orbits and regular polygons
- Elliptic billiards and ellipses associated to the 3-periodic orbits
- Fence patrolling by mobile agents with distinct speeds
- scientific article; zbMATH DE number 1950764 (Why is no real title available?)
- Makespan trade-offs for visiting triangle edges
- Minimization of the maximum distance between the two guards patrolling a polygonal region
- Multi-robot area patrol under frequency constraints
- Obtuse Triangular Billiards I: Near the (2, 3, 6) Triangle
- Obtuse Triangular Billiards II: One Hundred Degrees Worth of Periodic Trajectories
- On periodic billiard trajectories in obtuse triangles
- Patrolling a path connecting a set of points with unbalanced frequencies of visits
- Patrolling games
- Patrolling trees with mobile robots
- Periodic billiard trajectories in polygons: generating mechanisms
- Periodic billiard trajectories in smooth convex bodies
- Periodic Orbits for Billiards on an Equilateral Triangle
- Simple strategies versus optimal schedules in multi-agent patrolling
- Two Robots Patrolling on a Line: Integer Version and Approximability
This page was built for publication: The Fagnano triangle patrolling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257263)
