IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004 2004
DOI: 10.1109/robot.2004.1307145
|View full text |Cite
|
Sign up to set email alerts
|

Using a sensor network for distributed multi-robot task allocation

Abstract: Abstract-We present a Multi Field Distributed In-network Task Allocation (DINTA-MF) algorithm for online multi-robot task allocation (OMRTA) where tasks are allocated explicitly to robots by a pre-deployed, static sensor network. The idea of DINTA-MF is to compute several assignment fields in the sensor network and then distributively assign fields to different robots. Experimental results with a simulated alarm scenario show that our approach is able to compute solutions to the OMRTA problem in a distributed … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2005
2005
2019
2019

Publication Types

Select...
6
2
2

Relationship

2
8

Authors

Journals

citations
Cited by 44 publications
(21 citation statements)
references
References 18 publications
0
21
0
Order By: Relevance
“…WSNs can extend the perception of mobile robots by providing environment information, and thus can reduce the complexity of coordinating multiple robots. Batalin et al [3] studied a multi-robot task allocation (MRTA) problem [28], and proposed a Multi Field Distributed In-network Task Allocation (DINTA-MF) algorithm using a pre-deployed static sensor network. In DINTA-MF, the idea is that the WSN computes several assignment fields in the WSN, which then distributes them to different robots using a greedy policy.…”
Section: Mobile Robot Controlmentioning
confidence: 99%
“…WSNs can extend the perception of mobile robots by providing environment information, and thus can reduce the complexity of coordinating multiple robots. Batalin et al [3] studied a multi-robot task allocation (MRTA) problem [28], and proposed a Multi Field Distributed In-network Task Allocation (DINTA-MF) algorithm using a pre-deployed static sensor network. In DINTA-MF, the idea is that the WSN computes several assignment fields in the WSN, which then distributes them to different robots using a greedy policy.…”
Section: Mobile Robot Controlmentioning
confidence: 99%
“…Yet, Stage has a presence at the major research conferences and on university course web pages that suggests it is widely used and useful. For example, at least one paper using Stage for multi-robot simulations has appeared at ICRA, the main annual robotics meeting, every year since its debut in 2001 (Ye et al 2001;Fredslund and Matarić 2002;Batalin and Sukhatme 2003;Shell and Matarić 2004;Batalin and Sukhatme 2004;Lin and Zheng 2005;Batalin and Sukhatme 2005;Chang et al 2006;Busch et al 2007). Only the first of these papers is by an author of Stage.…”
Section: Evidence Of Stage Impactmentioning
confidence: 99%
“…It has also been shown [7] that without domain knowledge about the problem there is no solution that is better than the one provided by greedy algorithms. Following the model in [9], we think of task assignment occurring in decision epochs. A decision epoch is a period of time during which only the tasks which have arrived since the end of the previous epoch are considered for assignment.…”
Section: Task Allocation Algorithmsmentioning
confidence: 99%