{"title":"使用布谷鸟搜索和softmax启发式方法进化马里奥代理","authors":"Erek R. Speed","doi":"10.1109/ICEGIC.2010.5716893","DOIUrl":null,"url":null,"abstract":"This paper presents a method for evolving an agent which can successfully play a level of Super Mario Brothers as implemented on the MarioAI Benchmark. The Mario search space is extremely large, making finding reasonable solutions intractable for ordinary agents. The recently introduced evolutionary algorithm, cuckoo search is especially well suited toward searching such large spaces when it employs the use of Le´vy flights. Unfortunately, these Le´vy flights cannot be applied to non numerical problems such as Mario. We present a modification of the algorithm which uses the Le´vy distribution to effect appropriate change in a much wider set of problems, including Mario. To further optimize the search of Mario's problem space, a softmax heuristic is presented to focus on areas with likely solutions.","PeriodicalId":229345,"journal":{"name":"2010 2nd International IEEE Consumer Electronics Society's Games Innovations Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Evolving a Mario agent using cuckoo search and softmax heuristics\",\"authors\":\"Erek R. Speed\",\"doi\":\"10.1109/ICEGIC.2010.5716893\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a method for evolving an agent which can successfully play a level of Super Mario Brothers as implemented on the MarioAI Benchmark. The Mario search space is extremely large, making finding reasonable solutions intractable for ordinary agents. The recently introduced evolutionary algorithm, cuckoo search is especially well suited toward searching such large spaces when it employs the use of Le´vy flights. Unfortunately, these Le´vy flights cannot be applied to non numerical problems such as Mario. We present a modification of the algorithm which uses the Le´vy distribution to effect appropriate change in a much wider set of problems, including Mario. To further optimize the search of Mario's problem space, a softmax heuristic is presented to focus on areas with likely solutions.\",\"PeriodicalId\":229345,\"journal\":{\"name\":\"2010 2nd International IEEE Consumer Electronics Society's Games Innovations Conference\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International IEEE Consumer Electronics Society's Games Innovations Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEGIC.2010.5716893\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International IEEE Consumer Electronics Society's Games Innovations Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEGIC.2010.5716893","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evolving a Mario agent using cuckoo search and softmax heuristics
This paper presents a method for evolving an agent which can successfully play a level of Super Mario Brothers as implemented on the MarioAI Benchmark. The Mario search space is extremely large, making finding reasonable solutions intractable for ordinary agents. The recently introduced evolutionary algorithm, cuckoo search is especially well suited toward searching such large spaces when it employs the use of Le´vy flights. Unfortunately, these Le´vy flights cannot be applied to non numerical problems such as Mario. We present a modification of the algorithm which uses the Le´vy distribution to effect appropriate change in a much wider set of problems, including Mario. To further optimize the search of Mario's problem space, a softmax heuristic is presented to focus on areas with likely solutions.