Heuristic reoptimization of time‐extended multi‐robot task allocation problems

Providing high quality solutions is crucial when solving NP-hard time-extendedmulti-robot task allocation (MRTA) problems. Reoptimization, that is, the concept of making use of a known solution to an optimization problem instance when the solution to a similar problem instance is sought, is a promising and rather new research field in this application domain. However, so far no approximative time-extended
MRTA solution approaches exist for which guarantees on the resulting solution’s quality can be given. We investigate the reoptimization problems of inserting as well as deleting a task to/from a time-extended MRTA problem instance. For both problems, we can give performance guarantees in the form of an upper bound of 2 on the resulting approximation ratio for all heuristics fulfilling a mild assumption. We furthermore introduce specific solution heuristics and prove that smaller and tight upper bounds on the approximation ratio can be given for these heuristics if only
temporal unconstrained tasks and homogeneous groups of robots are considered. A conclusory evaluation of the reoptimization heuristic demonstrates a near-to-optimal performance in application.