Recruiting robots perform stochastic diffusion search

Bishop, Mark (J. M.); Meyer, K. de and Nasuto, S.J.. 2018. Recruiting robots perform stochastic diffusion search. International Robotics & Automation Journal, 4(2), pp. 143-144. ISSN 2574-8092 [Article]

[img]
Preview
Text
recrut.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial.

Download (106kB) | Preview
[img]
Preview
Text
IRATJ-04-00111.pdf - Published Version
Available under License Creative Commons Attribution.

Download (423kB) | Preview

Abstract or Description

A Letter to Nature demonstrated that a simple ant-inspired ‘tandem calling’ recruitment mechanism improved task performance in a group of robots. In these experiments a group of robots attempt to locate ‘food’ and return it to base. On its return a successful robot tries to recruit another to help exploit its find. As a result a population of robots rapidly expands to exploit the resource, resulting in greater foraging efficacy. In this note we observe that the type of recruitment and information sharing mechanism employed by the robots is one instance of a general class of Swarm Intelligence parallel search and optimisation methods, known as Stochastic Diffusion Search (SDS).

Item Type:

Article

Identification Number (DOI):

https://doi.org/10.15406/iratj.2018.04.00111

Departments, Centres and Research Units:

Computing

Dates:

DateEvent
26 April 2018Published

Item ID:

25151

Date Deposited:

04 Dec 2018 16:56

Last Modified:

29 Apr 2020 17:00

Peer Reviewed:

Yes, this version has been peer-reviewed.

URI:

https://research.gold.ac.uk/id/eprint/25151

View statistics for this item...

Edit Record Edit Record (login required)