Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation

Ding, Hongli; Hamann, Heiko

Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation

Files

There are no files associated with this item.

Date

2014

Authors

Ding, Hongli

Hamann, Heiko

Publication type

Contribution to a conference collection

Publication status

Published

Published in

Swarm Intelligence : 9th International Conference, ANTS 2014, Proceedings / Dorigo, Marco; Birattari, Mauro; Hamann, Heiko et al. (ed.). - Cham : Springer, 2014. - (Lecture Notes in Computer Science, LNCS ; 8667). - pp. 262-269. - ISSN 0302-9743. - eISSN 1611-3349. - ISBN 978-3-319-09951-4

Abstract

Inspired by sorting behaviors of social insects, we are interested in sorting by robot swarms using only local information and hence achieving high degrees of robustness and scalability. In this work, we propose a gossip-based sorting method which allows two swarms of simple homogeneous autonomous robots to sort themselves in two not pre-assigned areas. Key feature of this method is the estimation of cluster sizes based on communication that allows to determine the local majority. In a series of simulation experiments, we show the effectiveness of the approach and investigate the influence of different swarm sizes.

Subject (DDC)

004 Computer Science

Keywords

Social Insect, Communication Range, Swarm Intelligence, White Area, Black Area

Conference

Swarm Intelligence : 9th International Conference, ANTS 2014, Sep 10, 2014 - Sep 12, 2014, Brussels, Belgium

Cite This

ISO 690

DING, Hongli, Heiko HAMANN, 2014. Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation. Swarm Intelligence : 9th International Conference, ANTS 2014. Brussels, Belgium, Sep 10, 2014 - Sep 12, 2014. In: DORIGO, Marco, ed., Mauro BIRATTARI, ed., Heiko HAMANN, ed. and others. Swarm Intelligence : 9th International Conference, ANTS 2014, Proceedings. Cham:Springer, pp. 262-269. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-09951-4. Available under: doi: 10.1007/978-3-319-09952-1_25

BibTex

@inproceedings{Ding2014Sorti-59896,
  year={2014},
  doi={10.1007/978-3-319-09952-1_25},
  title={Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation},
  number={8667},
  isbn={978-3-319-09951-4},
  issn={0302-9743},
  publisher={Springer},
  address={Cham},
  series={Lecture Notes in Computer Science, LNCS},
  booktitle={Swarm Intelligence : 9th International Conference, ANTS 2014, Proceedings},
  pages={262--269},
  editor={Dorigo, Marco and Birattari, Mauro and Hamann, Heiko},
  author={Ding, Hongli and Hamann, Heiko}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/59896">
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-01-23T13:48:12Z</dc:date>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:issued>2014</dcterms:issued>
    <dc:creator>Ding, Hongli</dc:creator>
    <dc:language>eng</dc:language>
    <dc:creator>Hamann, Heiko</dc:creator>
    <dc:contributor>Hamann, Heiko</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/59896"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Ding, Hongli</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:abstract xml:lang="eng">Inspired by sorting behaviors of social insects, we are interested in sorting by robot swarms using only local information and hence achieving high degrees of robustness and scalability. In this work, we propose a gossip-based sorting method which allows two swarms of simple homogeneous autonomous robots to sort themselves in two not pre-assigned areas. Key feature of this method is the estimation of cluster sizes based on communication that allows to determine the local majority. In a series of simulation experiments, we show the effectiveness of the approach and investigate the influence of different swarm sizes.</dcterms:abstract>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-01-23T13:48:12Z</dcterms:available>
    <dcterms:title>Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation</dcterms:title>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

No