[TITLE] Communication Constrained Task Allocation For Robotic Networks
[SPEAKER] Stephen Smith (MIT)
[PLACE] 32-G631
[TIME] 1:00PM - 2:30PM
[DATE] March 19th (Fri), 2010

[ABSTRACT]
In this talk I will discuss a task allocation problem in which each
robot has limited communication range and communication bandwidth.
The problem is to devise distributed algorithms that allow the robots
to divide a set of task locations among themselves and,
simultaneously, leads each robot to its unique task.  I will consider
two scenarios: 1) the robots have knowledge of every task location,
and 2) the robots are equipped with limited range sensors to search
for task locations.  I will present two algorithms for solving this
problem, and characterize their performance in terms of the worst-case
time to complete the allocation.  I will also present results for an
average-case performance metric, and I will discuss some connections
to my more recent work on dynamic vehicle routing.