dtControl: decision tree learning algorithms for controller representation

By Pranav Ashok, Mathias Jackermeier, Pushpak Jagtap, Jan Křetínský, Maximilian Weininger, Majid Zamani. 2020

36 citations recorded by the source corpus.

Decision tree learning is a popular classification technique most commonly used in machine learning applications. Recent work has shown that decision trees can be used to represent provably-correct controllers concisely. Compared to representations using lookup tables or binary decision diagrams, decision trees are smaller and more explainable. We present dtControl, an easily extensible tool for representing memoryless controllers as decision trees. We give a comprehensive evaluation of various decision tree learning algorithms applied to 10 case studies arising out of correct-by-construction controller synthesis. These algorithms include two new techniques, one for using arbitrary linear binary classifiers in the decision tree learning, and one novel approach for determinizing controllers during the decision tree construction. In particular the latter turns out to be extremely efficient, yielding decision trees with a single-digit number of decision nodes on 5 of the case studies.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Control and Systems Engineering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Emmanuel Hebrard
  2. Peter James Stuckey
  3. C. Leckie
  4. Emir Demirovi'c
  5. Jeffrey Chan
  6. Anna Lukina
  7. James Bailey
  8. Kotagiri Ramamohanarao

In Computational Theory and Mathematics

  1. Jeffrey Chan
  2. Anna Lukina
  3. James Bailey
  4. Peter James Stuckey
  5. C. Leckie
  6. Kotagiri Ramamohanarao
  7. Emmanuel Hebrard
  8. Emir Demirovi'c

In Control and Systems Engineering

  1. Peter James Stuckey

Citations in the corpus