Hara,A., and Nagao,T., Emergence of Cooperative Behavior using ADG; Automatically Defined Groups, in Proc. of the Genetic and Evolutionary Computation Conference (GECCO99), Morgan Kaufmann, 1999  Home/Search   Document Not in Database   Summary   Related Articles   Check

....problem and an escape problem. 1 Introduction Recently intelligent agents and multi agent systems have attracted much interest in Distributed Artificial Intelligence (DAI) GP and its variants have been applied to the multi agent learning (see [Haynes et al..95] Luke et al..96] Iba96] Hara et al..99] for example) However, in the multi agent application of GP, the computational burden is often problematic. This is because the number of GP trees required for the multiagent task becomes larger with the number of agents. For instance, in the heterogeneous breeding strategy (see Section 2 for ....

....as a circle in Fig.1. If the nearest agent is out of its scope, then the Nearest Agent terminal returns a zero vector. It is also the case with the if obstacle function. There have been di#erent breeding strategies proposed for the multi agent learning by GP (see [Luke et al..96] Iba96] and [Hara et al..99] for details) This paper uses the co evolutionary breeding strategy, in which GP individuals are divided into a set of agent type subpopulations (see Fig.2) Breeding is performed in the same way as in a distributed GP. As generations proceed, some individuals are expected to perform specialized ....

Hara,A., and Nagao,T., Emergence of Cooperative Behavior using ADG; Automatically Defined Groups, in Proc. of the Genetic and Evolutionary Computation Conference (GECCO99), Morgan Kaufmann, 1999

....navigation problem and an escape problem. 1 Introduction Recently intelligent agents and multi agent systems have attracted much interest in Distributed Artificial Intelligence (DAI) GP and its variants have been applied to the multi agent learning (see [Haynes et al..95] Luke et al..96] Iba96] Hara et al..99] for example) However, in the multi agent application of GP, the computational burden is often problematic. This is because the number of GP trees required for the multi agent task becomes larger with the number of agents. For instance, in the heterogeneous breeding strategy (see Section 2 for ....

....Else evaluate the third argument. agent is out of its scope, then the Nearest Agent terminal returns a zero vector. It is also the case with the if obstacle function. There have been di#erent breeding strategies proposed for the multi agent learning by GP (see [Luke et al..96] Iba96] and [Hara et al..99] for details) This paper uses the co evolutionary breeding strategy, in which GP individuals are divided into a set of agent type subpopulations (see Fig.2) Breeding is performed in the same way as in a distributed GP. As generations proceed, some individuals are expected to perform specialized ....

Hara,A., and Nagao,T., Emergence of Cooperative Behavior using ADG; Automatically Defined Groups, in Proc. of the Genetic and Evolutionary Computation Conference (GECCO99), Morgan Kaufmann, 1999

....problem and an escape problem. 1 Introduction Recently intelligent agents and multi agent systems have attracted much interest in Distributed Artificial Intelligence (DAI) GP and its variants have been applied to the multi agent learning (see [Haynes et al..95] Luke et al..96] Iba96] Hara et al..99] for example) However, in the multi agent application of GP, the computational burden is often problematic. This is because the number of GP trees required for the multi agent task becomes larger with the number of agents. For instance, in the heterogeneous breeding strategy (see Section 2 for ....

....as a circle in Fig.1. If the nearest agent is out of its scope, then the Nearest Agent terminal returns a zero vector. It is also the case with the if obstacle function. There have been di#erent breeding strategies proposed for the multi agent learning by GP (see [Luke et al..96] Iba96] and [Hara et al..99] for details) This paper uses the co evolutionary breeding strategy, in which GP individuals are divided into a set of agent type subpopulations (see Fig.2) Breeding is performed in the same way as in a distributed GP. As generations proceed, some individuals are expected to perform specialized ....

Hara,A., and Nagao,T., Emergence of Cooperative Behavior using ADG; Automatically Defined Groups, in Proc. of the Genetic and Evolutionary Computation Conference (GECCO99), Morgan Kaufmann, 1999

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC