Back to search

Central Florida

Dynamic Task Allocation In Mobile Robot Systems Using Utility Funtions

Abstract

dc:description.abstract

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.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Vander Weide, Scott
Contributors dc:contributor
  • Boloni, Ladislau

Subjects

dc:subject × 5

Rights

Language dc:language
English

Identifiers

dc:identifier.*
Identifier
CFE0002274

Chain of custody

source
Harvested from
Central Florida
Base URL
stars.library.ucf.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Vander Weide, Scott. Dynamic Task Allocation In Mobile Robot Systems Using Utility Funtions. https://stars.library.ucf.edu/etd/3495