A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Resilient Assignment Using Redundant Robots on Transport Networks with Uncertain Travel Time
[article]
2019
arXiv
pre-print
This paper considers the problem of assigning multiple mobile robots to goals on transport networks with uncertain information about travel times. Our aim is to produce optimal assignments, such that the average waiting time at destinations is minimized. Since noisy travel time estimates result in sub-optimal assignments, we propose a method that offers resilience to uncertainty by making use of redundant robots. However, solving the redundant assignment problem optimally is strongly NP-hard.
arXiv:1804.04986v2
fatcat:bq22qevqdbbe3k7hd4wzojggpu