Abstract
In this work we establish a simple yet effective strategy, based on intermittent diffusion, for enabling a group of robots to accomplish complex tasks, shape formation and assembly. We demonstrate the feasibility of this approach and rigorously prove collision avoidance and convergence properties of the proposed algorithms.
Original language | English (US) |
---|---|
Article number | 13 |
Journal | Journal of Scientific Computing |
Volume | 90 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2022 |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Numerical Analysis
- General Engineering
- Computational Mathematics
- Computational Theory and Mathematics
- Applied Mathematics
Keywords
- Intermittent diffusion
- Multi-agent systems
- Optimal transport
- Path planning