Ants meeting algorithms

Asaf Shiloni, Alon Levy, Ariel Feiner, Meir Kalech

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ants may need to get together; however, they may not know the locations of other ants. Hence, we focus on an ant variant of the rendezvous problem, in which two ants are to be brought to the same location in finite time. We introduce two algorithms that solve this problem for two ants by simulating a bidirectional search in different environment settings. An algorithm for an environment with no obstacles and a general algorithm that handles all types of obstacles. We provide detailed discussion on the different attributes, size of pheromone required, and the performance of these algorithms.

Original languageEnglish
Title of host publication9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages567-574
Number of pages8
ISBN (Print)9781617387715
StatePublished - 1 Jan 2010
Event9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010 - Toronto, ON, Canada
Duration: 10 May 2010 → …

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume1
ISSN (Print)1548-8403
ISSN (Electronic)1558-2914

Conference

Conference9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010
Country/TerritoryCanada
CityToronto, ON
Period10/05/10 → …

Keywords

  • Distributed problem solving
  • Mobile agents. Formal models

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Ants meeting algorithms'. Together they form a unique fingerprint.

Cite this