T. Haynes, R. Wainwright, und S. Sen. Technical Report, UTULSA-MCS-94-10. The University of Tulsa, Tulsa, OK, USA, (16 December 1994)
Zusammenfassung
The identification, design, and implementation of
strategies for cooperation is a central research issue
in the field of Distributed Artificial Intelligence
(DAI). We propose a novel approach to the construction
of cooperation strategies for a group of problem
solvers based on the Genetic Programming (GP) paradigm.
GP's are a class of adaptive algorithms used to evolve
solution structures that optimize a given evaluation
criterion. Our approach is based on designing a
representation for cooperation strategies that can be
manipulated by GPs. We present results from experiments
in the predator-prey domain, which has been extensively
studied as an easy-to-describe but difficult-to-solve
cooperation problem domain. They key aspect of our
approach is the minimal reliance on domain knowledge
and human intervention in the construction of good
cooperation strategies. Promising comparison results
with prior systems lend credence to the viability of
this approach.
%0 Report
%1 Hayes:1994:ecs
%A Haynes, Thomas
%A Wainwright, Roger
%A Sen, Sandip
%C Tulsa, OK, USA
%D 1994
%K algorithms, ccoperation genetic programming, strategies
%N UTULSA-MCS-94-10
%T Evolving Cooperation Strategies
%U http://www.mcs.utulsa.edu/~rogerw/papers/Haynes-icmas95.pdf
%X The identification, design, and implementation of
strategies for cooperation is a central research issue
in the field of Distributed Artificial Intelligence
(DAI). We propose a novel approach to the construction
of cooperation strategies for a group of problem
solvers based on the Genetic Programming (GP) paradigm.
GP's are a class of adaptive algorithms used to evolve
solution structures that optimize a given evaluation
criterion. Our approach is based on designing a
representation for cooperation strategies that can be
manipulated by GPs. We present results from experiments
in the predator-prey domain, which has been extensively
studied as an easy-to-describe but difficult-to-solve
cooperation problem domain. They key aspect of our
approach is the minimal reliance on domain knowledge
and human intervention in the construction of good
cooperation strategies. Promising comparison results
with prior systems lend credence to the viability of
this approach.
@techreport{Hayes:1994:ecs,
abstract = {The identification, design, and implementation of
strategies for cooperation is a central research issue
in the field of Distributed Artificial Intelligence
(DAI). We propose a novel approach to the construction
of cooperation strategies for a group of problem
solvers based on the Genetic Programming (GP) paradigm.
GP's are a class of adaptive algorithms used to evolve
solution structures that optimize a given evaluation
criterion. Our approach is based on designing a
representation for cooperation strategies that can be
manipulated by GPs. We present results from experiments
in the predator-prey domain, which has been extensively
studied as an easy-to-describe but difficult-to-solve
cooperation problem domain. They key aspect of our
approach is the minimal reliance on domain knowledge
and human intervention in the construction of good
cooperation strategies. Promising comparison results
with prior systems lend credence to the viability of
this approach.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Tulsa, OK, USA},
author = {Haynes, Thomas and Wainwright, Roger and Sen, Sandip},
biburl = {https://www.bibsonomy.org/bibtex/25918559adfac21304e9947811d269caf/brazovayeye},
institution = {The University of Tulsa},
interhash = {4a74b22710deb7de981d9ad592f5c8f2},
intrahash = {5918559adfac21304e9947811d269caf},
keywords = {algorithms, ccoperation genetic programming, strategies},
month = {16 December},
number = {UTULSA-MCS-94-10},
size = {9 pages},
timestamp = {2008-06-19T17:41:10.000+0200},
title = {Evolving Cooperation Strategies},
type = {Technical Report},
url = {http://www.mcs.utulsa.edu/~rogerw/papers/Haynes-icmas95.pdf},
year = 1994
}