Solving partially observable problems by evolution and learning of finite state machines

DOI10.1007/3-540-45443-8_24MaRDI QIDQ4448809zbMATH OpenFDO

Authors Eduardo J. Sanchez, Andrés Pérez-Uribe, Bertrand Mesot

Publication date 18 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2210/22100267.htm, http://infoscience.epfl.ch/record/28695

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior
• Inducing finite state machines from training samples using ant colony optimization
• Advances in Artificial Intelligence – SBIA 2004
• An evolutionary algorithm for the synthesis of RAM-based FSMs
• Prediction of binary sequences by evolving finite state machines

Cited in

(7)

• Sparsity through evolutionary pruning prevents neuronal networks from overfitting
• Inducing finite state machines from training samples using ant colony optimization
• Evolving finite-state machine strategies for protecting resources
• Recomposable restricted finite state machines: definition and solution approaches
• Can we learn finite state machine robot controllers from interactive demonstration?
• The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior
• Advances in Artificial Intelligence – SBIA 2004

This page was built for publication: Solving partially observable problems by evolution and learning of finite state machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448809)