Learning Finite-State Machines with Ant Colony Optimization

  • Daniil Chivilikhin
  • Vladimir Ulyantsev
Conference paper

DOI: 10.1007/978-3-642-32650-9_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7461)
Cite this paper as:
Chivilikhin D., Ulyantsev V. (2012) Learning Finite-State Machines with Ant Colony Optimization. In: Dorigo M. et al. (eds) Swarm Intelligence. ANTS 2012. Lecture Notes in Computer Science, vol 7461. Springer, Berlin, Heidelberg

Abstract

In this paper we present a new method of learning Finite- State Machines (FSM) with the specified value of a given fitness function, which is based on an Ant Colony Optimization algorithm (ACO) and a graph representation of the search space. The input data is a set of events, a set of actions and the number of states in the target FSM and the goal is to maximize the given fitness function, which is defined on the set of all FSMs with given parameters. Comparison of the new algorithm and a genetic algorithm (GA) on benchmark problems shows that the new algorithm either outperforms GA or works just as well.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Daniil Chivilikhin
    • 1
  • Vladimir Ulyantsev
    • 1
  1. 1.Mechanics and OpticsSaint-Petersburg National Research University of Information TechnologiesSaint-PetersburgRussia

Personalised recommendations