Search-based construction of finite-state machines with real-valued actions: new representation model

Authors:
Igor Buzhinsky;Vladimir Ulyantsev;Fedor Tsarev;Anatoly Shalyto
Affiliations:
St. Petersburg National Research University of Information Technologies, Mechanics and Optics, St. Petersburg, Russian Fed.;St. Petersburg National Research University of Information Technologies, Mechanics and Optics, St. Petersburg, Russian Fed.;St. Petersburg National Research University of Information Technologies, Mechanics and Optics, St. Petersburg, Russian Fed.;St. Petersburg National Research University of Information Technologies, Mechanics and Optics, St. Petersburg, Russian Fed.
Venue:
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Year:
2013

Citing 5
Cited 0

On the development of reactive systems

Logics and models of concurrent systems
Modeling Reactive Systems with Statecharts: The Statemate Approach

Modeling Reactive Systems with Statecharts: The Statemate Approach
Logic Control and “Reactive” Systems: Algorithmization and Programming

Automation and Remote Control
Genetic algorithm for induction of finite automata with continuous and discrete output actions

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Learning finite-state machines with ant colony optimization

ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a search-based method for constructing finite-state machines (FSMs) with continuous (real-valued) output actions is improved. A more flexible FSM representation model is presented and compared with the previous one on the problem of unmanned aircraft control.