Abstract
This paper describes a new heuristic search optimisation algorithm capable of automatically generating programs in any language as solutions to a problem using an arbitrary BNF-based grammar. The approach maintains two populations of agents: the first, a set of partially generated programs that are built as a result of the agents traversing in parallel the entire search space of possible programs as determined by the grammar; and the second, a set of completely generated programs that are tested to see how they perform in the problem. Both populations are updated during each iteration by using a fitness function to prune out poorly performing agents. The effectiveness of the algorithm is evaluated on variations of the Santa Fe Trail problem. Experimental results show that the algorithm is capable of finding the optimal solution of 165 steps (i.e. the path itself as described by the three move, left turn and right turn operators without any conditional operator) whereas the best solutions found by Genetic Programming and Grammatical Evolution typically involve several hundred more steps. When using a grammar that omits the conditional operator, the algorithm again finds the optimal solution, unlike Grammatical Evolution which finds no solution at all.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Georgiou, L., Teahan, W.J.: Grammatical evolution and the Santa Fe Trail Problem. In: Proceedings of the International Conference on Evolutionary Computation (ICEC 2010), Valencia, Spain, pp. 10–19 (2010)
Headleand, C., Teahan, W.J.: Swarm based population seeding of grammatical evolution. Comput. Sci. Syst. Biol. 6, 132–135 (2013)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Koza, J.R., Keane, M.A., Streeter, M.J., Mydlowec, W., Yu, J., Lanza, G.: Genetic Programming IV: Routine Human-Competitive Machine Intelligence (v. 4). Springer, Heidelberg (2003)
O’Neill, M., Ryan, C.: Grammatical evolution. IEEE Trans. Evol. Comput. 5(4), 349–358 (2001)
Teahan, W.J.: Artificial Intelligence: Exercises I-Agents and Environments. Ventus Publishing Aps, Denmark (2010)
Urbano, P., Georgiou, L.: Improving grammatical evolution in Santa Fe Trail using novelty search. In: Proceedings of the European Conference on Artificial Life (ECAL 2013), Taormina, Italy, pp. 917–924 (2013)
Wilensky, U.: NetLogo. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL (1999). http://ccl.northwestern.edu/netlogo/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Teahan, W.J. (2018). A Grammar-Directed Heuristic Optimisation Algorithm and Comparisons with Grammatical Evolution on the Artificial Ant Problem. In: Lewis, P., Headleand, C., Battle, S., Ritsos, P. (eds) Artificial Life and Intelligent Agents. ALIA 2016. Communications in Computer and Information Science, vol 732. Springer, Cham. https://doi.org/10.1007/978-3-319-90418-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-90418-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-90417-7
Online ISBN: 978-3-319-90418-4
eBook Packages: Computer ScienceComputer Science (R0)