Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency
From MaRDI portal
Publication:3381954
DOI10.1007/978-3-030-66723-8_7zbMath1469.68118arXiv2005.02530OpenAlexW3170635652MaRDI QIDQ3381954
No author found.
Publication date: 20 September 2021
Published in: Algorithmic Foundations of Robotics XIV (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.02530
Analysis of algorithms (68W40) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)
Uses Software
Cites Work
- On fence patrolling by mobile agents
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Multi-robot area patrol under frequency constraints
- The vehicle routing problem. Latest advances and new challenges.
- The Euclidean traveling salesman problem is NP-complete
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- Cyclic Routing of Unmanned Aerial Vehicles
- Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
- Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Range-clustering queries
- Approximations for minimum and min-max vehicle routing problems
This page was built for publication: Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency