Global reconfiguration of a team of networked mobile robots among obstacles

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

Abstract

This paper presents a full system demonstration of dynamic sensor-based reconfiguration of a networked robot team. Robots sense obstacles in their environment locally and dynamically adapt their global geometric configuration to conform to an abstract goal shape. We present a novel two-layer planning and control algorithm for team reconfiguration that is decentralised and assumes local (neighbour-toneighbour) communication only. The approach is designed to be resource-efficient and we show experiments using a team of nine mobile robots with modest computation, communication and sensing. The robots use acoustic beacons for localisation and can sense obstacles in their local neighbourhood using IR sensors. Our results demonstrate globally specified reconfiguration from local information in a real robot network, and highlight limitations of standardmesh networks in implementing decentralised algorithms.

Cite

CITATION STYLE

APA

Fitch, R., Alempijevic, A., & Peynot, T. (2016). Global reconfiguration of a team of networked mobile robots among obstacles. In Advances in Intelligent Systems and Computing (Vol. 302, pp. 639–656). Springer Verlag. https://doi.org/10.1007/978-3-319-08338-4_47

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