<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="client.xsl" type="text/xsl"?>
<article article-type="other">
<front>
<journal-meta>
<journal-id/>
<issn/>
<banner>
<!--<href>banner.jpg</href>-->
<size width="100%"/>
</banner>
</journal-meta>
<article-meta>
<title-group>
<article-title>Auction-based Multi-Robot Task Allocation in COMSTAR</article-title>
</title-group>

<author><a href="mailto:mhoeing@mail.unomaha.edu"><name>Matthew Hoeing</name></a></author>
<aff>Computer Science Department University of Nebraska, Omaha, NE 68182</aff>

<author><a href="mailto:pdasgupta@mail.unomaha.edu"><name>Prithviraj Dasgupta</name></a></author>
<aff>Computer Science Department University of Nebraska, Omaha, NE 68182</aff>

<author><a href="mailto:plamen@21csi.com"><name>Plamen Petrov</name></a></author>
<aff>21<sup>st</sup> Century Systems Inc. 6825 Pine Street, Suite 141, Omaha, NE 68127.</aff>

<author><a href="mailto:sohara@21csi.com"><name>Stephen O'Hara</name></a></author>
<aff>Computer Science Department University of Nebraska, Omaha, NE 68182</aff>
<aff>21<sup>st</sup> Century Systems Inc. 6825 Pine Street, Suite 141, Omaha, NE 68127.</aff>
</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>Over the past few years, swarm based systems have emerged
as an attractive paradigm for building large scale distributed
systems composed of numerous independent but coordinating units. In our previous work, we have developed a pro-toype system called COMSTAR (Cooperative Multi-agent
Systems for automatic TArget Recognition) using a swarm
of unmanned aerial vehicles(UAVs) that is capable of identifying targets in software simulations of reconnaissance operations. Experimental results from the simulations of the
COMSTAR system show that task selection among the UAVs
is a crucial operation that determines the overall efficiency
of the system. Previously described techniques for task selection among swarm units use a centralized server such
as a ground control station to coordinate the activities of
the swarm units. However, such systems are not truly distributed since the behavior of the swarm units is predominantly directed by the centralized server's task allocation
algorithm. In this paper we focus on the problem of distributed task selection in a swarmed system where each
swarm unit decides on the tasks it will execute by sharing
information and coordinating its actions with other swarm
units without the intervention of a centralized ground control station supervising its activities. Specifically, we build
our task selection algorithm on an auction-based algorithm
for task selection in robotic swarms described by Kalra <italic>et al</italic>.
We report experimental results in a simulated environment
with 18 robots and 20 tasks and compare the performance of
our auction-based algorithm with other heuristic-based task
selection strategies in multi-agent swarms. Our simulation
results show that the auction-based algorithm improves the
task completion times by 30 &#8211; 60% and reduces the communication overhead by as much as 90% with respect to other heuristic-based strategies maintaining similar performance
in load balancing.</p>


</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>IT-15-Hoeing</hpdf>
</fpdf>
</body>
</article>
