You are here
DYNAMIC TASK ALLOCATION IN MOBILE ROBOT SYSTEMS USING UTILITY FUNTIONS
- Date Issued:
- 2008
- Abstract/Description:
- We define a novel algorithm based on utility functions for dynamically allocating tasks to mobile robots in a multi-robot system. The algorithm attempts to maximize the performance of the mobile robot while minimizing inter-robot communications. The algorithm takes into consideration the proximity of the mobile robot to the task, the priority of the task, the capability required by the task, the capabilities of the mobile robot, and the rarity of the capability within the population of mobile robots. We evaluate the proposed algorithm in a simulation study and compare it to alternative approaches, including the contract net protocol, an approach based on the knapsack problem, and random task selection. We find that our algorithm outperforms the alternatives in most metrics measured including percent of tasks complete, distance traveled per completed task, fairness of execution, number of communications, and utility achieved.
Title: | DYNAMIC TASK ALLOCATION IN MOBILE ROBOT SYSTEMS USING UTILITY FUNTIONS. |
![]() ![]() |
---|---|---|
Name(s): |
Vander Weide, Scott, Author Bölöni, Ladislau, Committee Chair University of Central Florida, Degree Grantor |
|
Type of Resource: | text | |
Date Issued: | 2008 | |
Publisher: | University of Central Florida | |
Language(s): | English | |
Abstract/Description: | We define a novel algorithm based on utility functions for dynamically allocating tasks to mobile robots in a multi-robot system. The algorithm attempts to maximize the performance of the mobile robot while minimizing inter-robot communications. The algorithm takes into consideration the proximity of the mobile robot to the task, the priority of the task, the capability required by the task, the capabilities of the mobile robot, and the rarity of the capability within the population of mobile robots. We evaluate the proposed algorithm in a simulation study and compare it to alternative approaches, including the contract net protocol, an approach based on the knapsack problem, and random task selection. We find that our algorithm outperforms the alternatives in most metrics measured including percent of tasks complete, distance traveled per completed task, fairness of execution, number of communications, and utility achieved. | |
Identifier: | CFE0002274 (IID), ucf:47871 (fedora) | |
Note(s): |
2008-08-01 M.S.Cp.E. Engineering and Computer Science, School of Electrical Engineering and Computer Science Masters This record was generated from author submitted information. |
|
Subject(s): |
mobile robots task allocation utility function |
|
Persistent Link to This Record: | http://purl.flvc.org/ucf/fd/CFE0002274 | |
Restrictions on Access: | public | |
Host Institution: | UCF |