.png){kind=icon}
Return
Spatio-temporal multi-robot routing
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2015.07.010.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we consider the problem of routing multiple robots to service spatially distributed requests at specified time instants. We show that such a routing problem can be formulated as a pure assignment problem. Additionally, we incorporate connectivity constraints into the problem by requiring that range-constrained robots ensure a connected information exchange network at all times. We discuss the feasibility aspects of such a spatio-temporal routing problem, and derive the minimum number of robots required to service the requests. Moreover, we explicitly construct the corresponding routes for the robots, with the total length traveled as the cost to be minimized. (C) 2015 Elsevier Ltd. All rights reserved,
Keywords:
Assignment problems
Autonomous mobile robots
Connectivity constraints
Optimization problems
Vehicle routing
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveOptimised thermally driven molecular stability of an SCO metal complex for TEC Seebeck generation enhancement.png)
RSC AdvancesOAAI
RSC AdvancesIF0
OAAIShareSaveShareSave
View more