Algorithms for shaping a particle swarm with a shared input by exploiting non-slip wall contacts
| Autor: | Aaron T. Becker, Shiva Shahrokhi, Arun Mahadev |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
0209 industrial biotechnology
business.industry Computer science Computation ComputingMethodologies_MISCELLANEOUS Swarm behaviour Particle swarm optimization Robotics 02 engineering and technology Workspace Slip (materials science) 021001 nanoscience & nanotechnology Computer Science::Robotics 020901 industrial engineering & automation Obstacle Robot Artificial intelligence 0210 nano-technology business Algorithm |
| Zdroj: | IROS |
| DOI: | 10.1109/iros.2017.8206294 |
| Popis: | There are driving applications for large populations of tiny robots in robotics, biology, and chemistry. These robots often lack onboard computation, actuation, and communication. Instead, these “robots” are particles carrying some payload and the particle swarm is controlled by a shared control input such as a uniform magnetic gradient or electric field. In previous works, we showed that the 2D position of each particle in such a swarm is controllable if the workspace contains a single obstacle the size of one particle. Requiring a small, rigid obstacle suspended in the middle of the workspace is a strong constraint, especially in 3D. This paper relaxes that constraint, and provides position control algorithms that only require non-slip wall contact in 2D. Both in vivo and artificial environments often have such boundaries. We assume that particles in contact with the boundaries have zero velocity if the shared control input pushes the particle into the wall. This paper provides a shortest-path algorithm for positioning a two-particle swarm, and a generalization to positioning an n-particle swarm. Results are validated with simulations and a hardware demonstration. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|