Abstractions and algorithms for assembly tasks with large numbers of robots and parts

Authors:
Spring Berman;Vijay Kumar
Affiliations:
GRASP Laboratory, University of Pennsylvania, Philadelphia, PA;GRASP Laboratory, University of Pennsylvania, Philadelphia, PA
Venue:
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Year:
2009

Citing 4
Cited 0

Analysis of Dynamic Task Allocation in Multi-Robot Systems

International Journal of Robotics Research
Optimized stochastic policies for task allocationin swarms of robots

IEEE Transactions on Robotics
Dynamics of self-assembling systems: Analogy with chemical kinetics

Artificial Life
Stochastic strategies for a swarm robotic assembly system

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a decentralized, scalable approach to designing a reconfigurable manufacturing system in which a swarm of robots assembles heterogeneous parts into target amounts of products. The sequence of part assemblies is determined by interactions between robots in a decentralized manner in real time. Our methodology is based on deriving a continuous abstraction of the system from chemical reaction models and formulating the strategy as a problem of selecting rates of assembly and disassembly. The rates are mapped onto probabilities that define stochastic control policies for individual robots, which then produce the desired aggregate performance. We illustrate our approach using a physics-based simulator with examples involving 15 robots and two types of final products.