Scheduling for multi-robot routing with blocking and enabling constraints

This paper considers the problem of servicing a set of locations by a fleet of robots so as to minimize overall makespan. Although motivated by a specific real-world, multi-robot drilling and fastening application, the problem also arises in a range of other multi-robot domains where service start t...

Full description

Saved in:
Bibliographic Details
Published in:Journal of scheduling 2021-06, Vol.24 (3), p.291-318
Main Authors: Mogali, Jayanth Krishna, Kinable, Joris, Smith, Stephen F., Rubinstein, Zachary B.
Format: Article
Language:English
Subjects:
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control
Optimization
Drilling
Heuristic
Job shops
Multiple robots
Operations Research/Decision Theory
Optimization
Precedence constraints
Robots
Supply Chain Management
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper considers the problem of servicing a set of locations by a fleet of robots so as to minimize overall makespan. Although motivated by a specific real-world, multi-robot drilling and fastening application, the problem also arises in a range of other multi-robot domains where service start times are subject to precedence constraints and robots must be routed in space and time to avoid collisions. We formalize this general problem and analyze its complexity. We develop a heuristic local search procedure for solving it and analyze its performance on a set of synthetically generated problem instances, some of which capture the specific structure of the motivating drilling and fastening application, and others that generalize to other application settings. We provide a differential analysis of our local search procedure and a comparison to other approaches to demonstrate the efficacy of the proposed heuristic.
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-021-00684-9