• DocumentCode
    419069
  • Title

    Varying sample sizes for the co-evolution of heterogeneous agents

  • Author

    Parker, Gary B. ; Blumenthal, H. Joseph

  • Author_Institution
    Comput. Sci., Connecticut Coll., New London, CT, USA
  • Volume
    1
  • fYear
    2004
  • fDate
    19-23 June 2004
  • Firstpage
    766
  • Abstract
    The evolution of a heterogeneous team is a complex problem. Evolving teams if a single population can retard the GA´s ability to specialize emergent behavior, but co-evolution requires a system for evaluation at trial time. If two few combinations of partners are tested, the GA is unable to recognize fit agents; if too many agents are tested, the resultant computation time becomes excessive. We created a system based on punctuated anytime learning that only periodically tests samples of partner combinations to reduce computation time and tested a variety of sample sizes. In this paper, we present a successful method of varying the sample sizes, dependent on the level of fitness, using a box pushing task for comparison.
  • Keywords
    genetic algorithms; learning (artificial intelligence); multi-agent systems; agent coevolution; box pushing task; genetic algorithm; heterogeneous agents; heterogeneous teams; Biological cells; Collaboration; Computer science; Educational institutions; Employment; Humans; Intelligent agent; Robots; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation, 2004. CEC2004. Congress on
  • Print_ISBN
    0-7803-8515-2
  • Type

    conf

  • DOI
    10.1109/CEC.2004.1330936
  • Filename
    1330936