#### Filter Results:

#### Publication Year

2007

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

— In this paper, we present task allocation (assignment) algorithms for a multi-robot system where the tasks are divided into disjoint groups and there are precedence constraints between the task groups. Existing auction-based algorithms assume the task independence and hence can not be used directly to solve the class of multi-robot task assignment… (More)

— In this paper, we present provably-good algorithms for multi-robot task assignment, where each task has to be completed within its deadline. Each robot has a upper limit on the maximum number of tasks that it can perform due to its limited battery life, and each task takes the same amount of time to complete. Each robot has a different payoff (or cost)… (More)

— We present a provably-good distributed algorithm for generalized task assignment problem in the context of multi-robot systems, where robots cooperate to complete a set of given tasks. In multi-robot generalized assignment problem (MR-GAP), each robot has its own resource constraint (e.g., energy constraint), and needs to consume a certain amount of… (More)

— Digital microfluidic systems (DMFS) are an emerging class of lab-on-a-chip systems that manipulate individual droplets of chemicals on a planar array of electrodes. The biochemical analyses are performed by repeatedly moving, mixing, and splitting droplets on the electrodes. In this paper, we focus on minimizing the completion time of biochemical analyses… (More)

— Robotic swarms are distributed systems whose members interact via local control laws to achieve different behaviors. Practical missions may require a combination of different swarm behaviors, where these behavioral combinations are not known a priori but could arise dynamically due to changes in mission goals. Therefore, human interaction with the swarm… (More)

— In this paper, we present both centralized and distributed algorithms for aligning coordinate frames in multi-robot systems based on inter-robot relative position measurements. Robot orientations are not measured, but are computed by our algorithms. Our algorithms are robust to measurement error and are useful in applications where a group of robots need… (More)

— We study an online task assignment problem for multi-robot systems where robots can do multiple tasks during their mission and the tasks arrive dynamically in groups. Each robot can do at most one task from a group and the total number of tasks a robot can do is bounded by its limited battery life. There is a payoff for assigning each robot to a task and… (More)

—Prisoner's dilemma (PD) game has been used as a prototypical model for studying social choice situations with self-interested agents. Although in a single shot PD game, both players playing defect is a Nash equilibrium, in social settings, cooperation among self-interested agents is usually observed. This phenomenon of emergence of cooperation can be… (More)