TY - JOUR
T1 - Optimal symbolic controllers determinization for BDD storage⁎
AU - Zapreev, Ivan S.
AU - Verdier, Cees
AU - Mazo, Manuel
PY - 2018
Y1 - 2018
N2 - Controller synthesis techniques based on symbolic abstractions appeal by producing correct-by-design controllers, under intricate behavioural constraints. Yet, being relations between abstract states and inputs, such controllers are immense in size, which makes them futile for embedded platforms. Control-synthesis tools such as PESSOA, SCOTS, and CoSyMA tackle the problem by storing controllers as binary decision diagrams (BDDs). However, due to redundantly keeping multiple inputs per-state, the resulting controllers are still too large. In this work, we first show that choosing an optimal controller determinization is an NP-complete problem. Further, we consider the previously known controller determinization technique and discuss its weaknesses. We suggest several new approaches to the problem, based on greedy algorithms, symbolic regression, and (muli-terminal) BDDs. Finally, we empirically compare the techniques and show that some of the new algorithms can produce up to ≈ 85% smaller controllers than those obtained with the previous technique.
AB - Controller synthesis techniques based on symbolic abstractions appeal by producing correct-by-design controllers, under intricate behavioural constraints. Yet, being relations between abstract states and inputs, such controllers are immense in size, which makes them futile for embedded platforms. Control-synthesis tools such as PESSOA, SCOTS, and CoSyMA tackle the problem by storing controllers as binary decision diagrams (BDDs). However, due to redundantly keeping multiple inputs per-state, the resulting controllers are still too large. In this work, we first show that choosing an optimal controller determinization is an NP-complete problem. Further, we consider the previously known controller determinization technique and discuss its weaknesses. We suggest several new approaches to the problem, based on greedy algorithms, symbolic regression, and (muli-terminal) BDDs. Finally, we empirically compare the techniques and show that some of the new algorithms can produce up to ≈ 85% smaller controllers than those obtained with the previous technique.
KW - control law
KW - data compression
KW - determinism
KW - embedded systems
KW - genetic algorithms
UR - http://www.scopus.com/inward/record.url?scp=85052645634&partnerID=8YFLogxK
U2 - 10.1016/j.ifacol.2018.08.001
DO - 10.1016/j.ifacol.2018.08.001
M3 - Conference article
AN - SCOPUS:85052645634
SN - 2405-8963
VL - 51
SP - 1
EP - 6
JO - IFAC-PapersOnline
JF - IFAC-PapersOnline
IS - 16
ER -