Patch Sorting: Multi-object Clustering Using Minimalist Robots

  • Authors:
  • Chris Melhuish;Matt Wilson;Ana Sendova-Franks

  • Affiliations:
  • -;-;-

  • Venue:
  • ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This study shows that a task as complicated as patch sorting can be accomplished with a 'minimalist' solution employing four simple rules. The solution is an extension of the object clustering research of Beckers et al. [1] and the object sorting research of Melhuish et al. [2]. Beckers et al. [1] used a very simple mechanism and achieved puck clustering in an arena with simple robots. Melhuish et al. [2] extended this technique to sort two objects, again using simple robots and a simple mechanism. The new mechanism reported in this paper, explores the sorting of any number of different objects into separate clusters. The method works by comparing two objects: the object the robot is carrying and, using a special antenna, the object with which the robot has collided. The results in this paper provide a demonstration of the success of this n-colour mechanism.