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

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 IEEE.

Cite

CITATION STYLE

APA

Berman, S., & Kumar, V. (2009). Abstractions and algorithms for assembly tasks with large numbers of robots and parts. In 2009 IEEE International Conference on Automation Science and Engineering, CASE 2009 (pp. 25–28). https://doi.org/10.1109/COASE.2009.5234096

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free