Generating a configuration space representation for assembly tasks from demonstration

J. R. Chen*, A. Zelinsky

*Corresponding author for this work

    Research output: Contribution to journalConference articlepeer-review

    1 Citation (Scopus)

    Abstract

    Removing suboptimal actions that can exist in a demonstration is s key problem to be solved in Robot Programming by Demonstration. In this paper we present the first step of an approach for solving this problem. We present how the Configuration Space (C-space) of a task can be derived from demonstration. A demonstration traces out paths on a number of C-surfaces in C-space. The idea is to use statistical regression analysis on data firm these paths to determine the unknown equation parameters of a C-surface. Experimental results show the validity of the approach. Accurate parameter estimates were obtained so long as a sufficiently rich set of demonstrated paths existed on the C-surface. The approach has the advantage that it tends to provide accurate parameter estimates for C-surfaces where they were most needed. That is, for C-surfaces (i) critical to task completion, and (ii) whose paths contained suboptimal actions.

    Original languageEnglish
    Pages (from-to)1530-1536
    Number of pages7
    JournalProceedings - IEEE International Conference on Robotics and Automation
    Volume2
    Publication statusPublished - 2001
    Event2001IEEE International Conference on Robotics and Automation (ICRA) - Seoul, Korea, Republic of
    Duration: 21 May 200126 May 2001

    Fingerprint

    Dive into the research topics of 'Generating a configuration space representation for assembly tasks from demonstration'. Together they form a unique fingerprint.

    Cite this