A multimodal problem for competitive coevolution

  • Authors:
  • Philip Hingston;Tirtha Ranjeet;Chiou Peng Lam;Martin Masek

  • Affiliations:
  • Edith Cowan University, Mt Lawley, Western Australia;Edith Cowan University, Mt Lawley, Western Australia;Edith Cowan University, Mt Lawley, Western Australia;Edith Cowan University, Mt Lawley, Western Australia

  • Venue:
  • AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Coevolutionary algorithms are a special kind of evolutionary algorithm with advantages in solving certain specific kinds of problems. In particular, competitive coevolutionary algorithms can be used to study problems in which two sides compete against each other and must choose a suitable strategy. Often these problems are multimodal -- there is more than one strong strategy for each side. In this paper, we introduce a scalable multimodal test problem for competitive coevolution, and use it to investigate the effectiveness of some common coevolutionary algorithm enhancement techniques.