| 词条 | Santa Fe Trail problem |
| 释义 |
The Santa Fe Trail problem is a genetic programming exercise in which artificial ants search for food pellets according to a programmed set of instructions.[1][2] The layout of food pellets in the Santa Fe Trail problem has become a standard for comparing different genetic programming algorithms and solutions. One method for programming and testing algorithms on the Santa Fe Trail problem is by using the NetLogo application.[3] There is at least one case of a student creating a Lego robotic ant to solve the problem.[4] See also
References1. ^Koza, John R., Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA. 1992. pp. 147-155. Print. 2. ^The Artificial Ant Problem 3. ^NetLogo 4. ^Romero's Pilgrimage to Santa Fe: A Tale of Robot Evolution External links
2 : Genetic algorithms|Genetic programming |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。