A hot method for synthesising cool controllers

Husien, I, Berthier, N and Schewe, S
(2017) A hot method for synthesising cool controllers. .

[img] Text
spin17main-mainid35-p-999d6c1-32247M-final.pdf - Submitted Version

Download (851kB)


© 2017 Association for Computing Machinery. Several general search techniques such as genetic programming and simulated annealing have recently been investigated for synthesising programs from specifications of desired objective behaviours. In this context, these techniques explore the space of all candidate programs by performing local changes to candidates selected by means of a measure of their fitness w.r.t. the desired objectives. Previous performance results advocated the use of simulated annealing over genetic programming for such problems. In this paper, we investigate the application of these techniques for the computation of deterministic strategies solving symbolic Discrete Controller Synthesis (DCS) problems, where a model of the system to control is given along with desired objective behaviours. We experimentally confirm that relative performance results are similar to program synthesis, and give a complexity analysis of our simulated annealing algorithm for symbolic DCS.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Depositing User: Symplectic Admin
Date Deposited: 12 Jul 2017 08:28
Last Modified: 31 Oct 2018 08:10
DOI: 10.1145/3092282.3092299
URI: http://livrepository.liverpool.ac.uk/id/eprint/3008410
Repository Staff Access