Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency.
Peyman AfshaniMark de BergKevin BuchinJie GaoMaarten LöfflerAmir NayyeriBenjamin RaichelRik SarkarHaotian WangHao-Tsung YangPublished in: WAFR (2021)
Keyphrases
- multi robot
- approximation algorithms
- min max
- precedence constraints
- np hard
- scheduling problem
- path planning
- special case
- mobile robot
- search and rescue
- worst case
- multi robot exploration
- multi robot systems
- vertex cover
- resource allocation
- approximation ratio
- open shop
- robotic systems
- undirected graph
- set cover
- constant factor approximation
- uncertain environments
- randomized algorithms
- disjoint paths
- multi robot coordination
- coalitional game theory
- multiple robots
- constant factor
- strongly np hard
- image sequences
- combinatorial auctions
- robot teams
- linear programming
- branch and bound algorithm
- markov decision processes
- dynamic environments