Welcome to the InfoSci Platform
Reference Hub2
A Robust Scheme for Aggregating Quasi-Blind Robots in an Active Environment

A Robust Scheme for Aggregating Quasi-Blind Robots in an Active Environment

Nazim Fatès, Nikolaos Vlassopoulos
Copyright: © 2012 |Volume: 3 |Issue: 3 |Pages: 15
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781466614352|DOI: 10.4018/jsir.2012070105
Cite Article Cite Article

MLA

Fatès, Nazim, and Nikolaos Vlassopoulos. "A Robust Scheme for Aggregating Quasi-Blind Robots in an Active Environment." IJSIR vol.3, no.3 2012: pp.66-80. http://doi.org/10.4018/jsir.2012070105

APA

Fatès, N. & Vlassopoulos, N. (2012). A Robust Scheme for Aggregating Quasi-Blind Robots in an Active Environment. International Journal of Swarm Intelligence Research (IJSIR), 3(3), 66-80. http://doi.org/10.4018/jsir.2012070105

Chicago

Fatès, Nazim, and Nikolaos Vlassopoulos. "A Robust Scheme for Aggregating Quasi-Blind Robots in an Active Environment," International Journal of Swarm Intelligence Research (IJSIR) 3, no.3: 66-80. http://doi.org/10.4018/jsir.2012070105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The question of how to aggregate autonomous agents with limited abilities in the absence of centralized coordination is known as the Decentralized Gathering Problem. The authors present a bio-inspired aggregation scheme that solves this problem and study a first application of this scheme to a small team of robots. The robots (Alice and Khepera III) obey simple rules and have only a rudimentary perception of their environment. The collective behavior is based on stigmergic principles and uses an active environment to relay the communications between robots. This results in an aggregation process that shows good properties of robustness and that can in principle be extended to swarms of robots.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.