(Georgia Institute of Technology, 2012)
Dantam, Neil; Essa, Irfan; Stilman, Mike
We describe several algorithms used for the inference of linguistic robot policies from human
demonstration. First, tracking and match objects using the Hungarian Algorithm. Then, we convert Regular Expressions to Nondeterministic Finite Automata (NFA) using the McNaughton-Yamada-Thompson
Algorithm. Next, we use Subset Construction to convert to a Deterministic Finite Automaton. Finally, we
minimize finite automata using either Hopcroft's Algorithm or Brzozowski's Algorithm.