Person:
Essa, Irfan

Permanent Link
https://hdl.handle.net/1853/71242
Associated Organization(s)
Organizational Unit
ORCID
ArchiveSpace Name Record

Filters

2012 1
1
1
1
1
Reset filters

Settings
search.filters.applied.f.isSeriesOfPublicationTitle: Humanoid Robotics Laboratory Technical Report Series ×

Publication Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Algorithms for Linguistic Robot Policy Inference from Demonstration of Assembly Tasks
    (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.