Task Allocation using a Team of Robots

Haris Aziz, Arindam Pal, Ali Pourmiri, Fahimeh Ramezani, Brendan Sims
7/20/2022
cs.ROcs.AIcs.DM

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

Task allocation using a team or coalition of robots is one of the most important problems in robotics, computer science, operational research, and artificial intelligence. In recent work, research has focused on handling complex objectives and feasibility constraints amongst other variations of the multi-robot task allocation problem. There are many examples of important research progress in these directions. We present a general formulation of the task allocation problem that generalizes several versions that are well-studied. Our formulation includes the states of robots, tasks, and the surrounding environment in which they operate. We describe how the problem can vary depending on the feasibility constraints, objective functions, and the level of dynamically changing information. In addition, we discuss existing solution approaches for the problem including optimization-based approaches, and market-based approaches.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{aziz2022task,
  title  = {Task Allocation using a Team of Robots},
  author = {Haris Aziz and Arindam Pal and Ali Pourmiri and Fahimeh Ramezani and Brendan Sims},
  year   = {2022},
  eprint = {2207.09650},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.09650v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.09650.svg)](https://codeofpaper.com/paper/2207.09650)

Discussion