ICRA 2011 Paper Abstract


Paper WeA112.5

Liu, Lantao (Texas A&M University), Fine, Benjamin (Texas A&M University), Shell, Dylan (Texas A&M University), Klappenecker, Andreas (Texas A&M University)

Approximate Characterization of Multi-Robot Swarm "Shapes" in Sublinear-Time

Scheduled for presentation during the Regular Sessions "Distributed Robot Systems II" (WeA112), Wednesday, May 11, 2011, 09:20−09:35, Room 5H

2011 IEEE International Conference on Robotics and Automation, May 9-13, 2011, Shanghai International Conference Center, Shanghai, China

This information is tentative and subject to change. Compiled on July 14, 2020

Keywords Distributed Robot Systems, Parallel Robots


Many envisioned applications of multi-robot swarms involve the detection, production or maintenance of global structures through only local means. This paper introduces a scalable, distributed algorithm to approximately characterize important global geometric and topological properties. For a given spatial arrangement of robots, the algorithm estimates the longest network (geodesic) distance in any direction as well as the average Euclidean distance only using locally sensed information. In so doing, the robots need only to communicate with and sense (range and bearing) nearby robots. The algorithm uses a greedy method to approximate both distance metrics via parallel one-way message traversals. We provide a bound for the number of such traversals, showing a global characterization is produced in a running time that is sublinear in the total number of robots. Along with this analysis, we conduct simulations with hundreds of robots to validate the algorithm.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2020 PaperCept, Inc.
Page generated 2020-07-14  14:57:53 PST  Terms of use