Title:
Algorithms for Linguistic Robot Policy Inference from Demonstration of Assembly Tasks
Algorithms for Linguistic Robot Policy Inference from Demonstration of Assembly Tasks
Author(s)
Dantam, Neil
Essa, Irfan
Stilman, Mike
Essa, Irfan
Stilman, Mike
Advisor(s)
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
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.
Sponsor
Date Issued
2012
Extent
Resource Type
Text
Resource Subtype
Technical Report