Abstract
Evolutionary Programming (EP) has been used to solve a large variety of problems. This technique uses concepts of Darwin’s theory to evolve finite state machines (FSMs). However, most works develop tailor-made EP frameworks to solve specific problems. These frameworks generally require significant modifications in their kernel to be adapted to other domains. To easy reuse and to allow modularity, modular FSMs were introduced. They are fundamental to get more generic EP frameworks. In this paper, we introduce the framework Splinter, capable of evolving modular FSMs. It can be easily configured to solve different problems. We illustrate this by presenting results from the use of Splinter for two problems: the artificial ant problem and the sequence of characters. The results validate the Splinter implementation and show that the modularity benefits do not decrease the performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angeline, P.J., Pollack, J.: Evolutionary module acquisition. In: Proceedings of the Sec. Annual Conference on Evolutionary Programming, pp. 154–163 (1993)
Báck, T., Urich, H., Schwefel, H.P.: Evolutionary Computation: Comments on the History and Current State. IEEE Trans. on Software Engineering 17(6), 3–17 (1991)
Chellapila, K., Czarnecki, D.: A Preliminary Investigation into Evolving Modular Finite States Machines. In: Proceedings of the Congress on Evolutionary Computation- CEC 1999, July 6-9, vol. 2, pp. 1349–1356. IEEE Press, Los Alamitos (1999)
Darwin, C.: On the Origin of Species by Means of Natural Selection or the Preservation of Favored Races in the Struggle for Life, Murray, London-UK (1859)
Fogel, D.B.: Evolutionary Computation - Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway (1995)
Fogel, L.J.: On the Organization of Intellect, Ph.D. Dissertation, UCLA-USA 1964
In: Proceedings of Genetic and Evolutionary Computation Conference, New York-USA 2002, Chicago-USA 2003
Jefferson, D., et al.: Evolution of a Theme in Artificial Life: The Genesys: Tracker System, Tech. Report, Univ. California, Los Angeles, CA (1991)
Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (1994)
Ladd, S.R.: libevocosm - C++ Tools for Evolutionary Software (February, 2004), http://www.coyotegulch.com/docs/evocosm
Michalewicz, Z., Michalewicz, M.: Evolutionary Computation Techniques and Their Applications. In: IEEE International Conf. on Intelligent Processing Systems (1997)
Rodrigues, E., Pozo, A.R.T.: Grammar-Guided Genetic Programming and Automatically Defined Functions. In: Brazilian Symposium on Artificial Intelligence, SBIA-2002, Porto de Galinhas, Recife,
Rosca, J.P., Ballard, D.H.: Discovery of Sub-routines in Genetic Programming. In: Advances in Genetic Programming, pp. 177–201. MIT Press, Cambridge (1996)
Shehady, R.K., Siewiorek, D.P.: A Method to Automate User Interface Testing Using Variable Finite State Machines. In: Proc. of International Symposium on Fault- Tolerant Computing FTCS 1997, Seattle, Washington, USA, June 25-27 (1997)
Wang, C.-J., Liu, M.T.: Axiomatic Test Sequence Generation for Extended Finite State Machines. In: Proc. International Conference on Distributed Computing Systems, June 9-12, pp. 252–259 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Acras, R.N., Vergilio, S.R. (2004). Splinter: A Generic Framework for Evolving Modular Finite State Machines. In: Bazzan, A.L.C., Labidi, S. (eds) Advances in Artificial Intelligence – SBIA 2004. SBIA 2004. Lecture Notes in Computer Science(), vol 3171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28645-5_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-28645-5_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23237-7
Online ISBN: 978-3-540-28645-5
eBook Packages: Springer Book Archive