.png){kind=icon}
Return
Distributed Algorithms for Multirobot Task Assignment With Task Deadline Constraints
.png){kind=icon}
OA
AI
DOI：10.1109/TASE.2015.2438032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present distributed algorithms for multirobot task assignment where the tasks have to be completed within given deadlines. Each robot has a limited battery life and thus there is an upper limit on the amount of time that it has to perform tasks. Performing each task requires certain amount of time (called the task duration) and each robot can have different payoffs for the tasks. Our problem is to assign the tasks to the robots such that the total payoff is maximized while respecting the task deadline constraints and the robot's battery life constraints. Our problem is NP-hard since a special case of our problem is the classical generalized assignment problem (which is NP-hard). There are no known algorithms (distributed or centralized) for this problem with provably good guarantees of performance. We present a distributed algorithm for solving this problem and prove that our algorithm has an approximation ratio of 2. For the special case of constant task duration we present a distributed algorithm that is provably almost optimal. Our distributed algorithms are polynomial in the number of robots and the number of tasks. We also present simulation results to depict the performance of our algorithms. Note to Practitioners-In this paper, we present provably good multirobot task assignment algorithms, while considering practical constraints like task deadlines and limited battery life of robots. Such constraints are relevant in many applications including parts movement by robots in manufacturing, delivery of goods by unmanned vehicles, and search and rescue operations. Our solution is applicable to a group of heterogeneous robots with different suitability (i.e., payoffs) for different tasks. Our distributed approach is independent of the underlying robot communication network topology, and thus can be applied to a wide range of robot network deployments. Finally, our approach is easy to implement, has low communication requirements, and it is scalable, since its running time is linear in the number of robots and tasks.
Keywords:
Auction algorithms
distributed algorithms
generalized assignment
multi-agent coordination
multirobot task allocation
task deadline
Journal
IF:
6.4
Papers:
5.1K
Citations:
1.6W
Organization
Cited Papers
The Diagnostic Validity of Melancholic Major Depression in a Population-Based Sample of Female Twins
.png){kind=icon}
PREAI
ShareSave
ShareSaveShareSaveShareSave
View more