{"title":"具有不同状态数的紧急智能体的可进化性评价","authors":"M. Komann, D. Fey","doi":"10.1145/1569901.1570155","DOIUrl":null,"url":null,"abstract":"Emergence is an important and promising scientific topic today because it offers benefits that can not be achieved by classic means. But it is often challenging to control emergence and to find correct local rules that create desired global behavior. It especially becomes difficult if the search space representing the problem that has to be optimized is not continuous/linear. One solution to that problem is evolution. This paper shows that the use of Genetic Algorithms is feasible for such problems by the example of the Creatures' Exploration Problem in which agents shall visit all non-blocked cells in a grid. Different amounts of agents and states per agent are evolved and statistically compared. It shows that neither a single extension of agent capabilities nor sole increase of agent numbers provides the best performance. The results hint that a mixture of both should be used instead.","PeriodicalId":193093,"journal":{"name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Evaluating the evolvability of emergent agents with different numbers of states\",\"authors\":\"M. Komann, D. Fey\",\"doi\":\"10.1145/1569901.1570155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Emergence is an important and promising scientific topic today because it offers benefits that can not be achieved by classic means. But it is often challenging to control emergence and to find correct local rules that create desired global behavior. It especially becomes difficult if the search space representing the problem that has to be optimized is not continuous/linear. One solution to that problem is evolution. This paper shows that the use of Genetic Algorithms is feasible for such problems by the example of the Creatures' Exploration Problem in which agents shall visit all non-blocked cells in a grid. Different amounts of agents and states per agent are evolved and statistically compared. It shows that neither a single extension of agent capabilities nor sole increase of agent numbers provides the best performance. The results hint that a mixture of both should be used instead.\",\"PeriodicalId\":193093,\"journal\":{\"name\":\"Proceedings of the 11th Annual conference on Genetic and evolutionary computation\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 11th Annual conference on Genetic and evolutionary computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1569901.1570155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1569901.1570155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evaluating the evolvability of emergent agents with different numbers of states
Emergence is an important and promising scientific topic today because it offers benefits that can not be achieved by classic means. But it is often challenging to control emergence and to find correct local rules that create desired global behavior. It especially becomes difficult if the search space representing the problem that has to be optimized is not continuous/linear. One solution to that problem is evolution. This paper shows that the use of Genetic Algorithms is feasible for such problems by the example of the Creatures' Exploration Problem in which agents shall visit all non-blocked cells in a grid. Different amounts of agents and states per agent are evolved and statistically compared. It shows that neither a single extension of agent capabilities nor sole increase of agent numbers provides the best performance. The results hint that a mixture of both should be used instead.