IDEAS home Printed from https://ideas.repec.org/a/wly/apsmbi/v32y2016i2p209-227.html
   My bibliography  Save this article

A random forest application to contact‐state classification for robot programming by human demonstration

Author

Listed:
  • S. Cabras
  • M. E. Castellanos
  • E. Staffetti

Abstract

This paper addresses the non‐parametric estimation of the stochastic process related to the classification problem that arises in robot programming by demonstration of compliant motion tasks. Robot programming by demonstration is a robot programming paradigm in which a human operator demonstrates the task to be performed by the robot. In such demonstration, several observable variables, such as velocities and forces can be modeled, non‐parametrically, in order to classify the current state of a contact between an object manipulated by the robot and the environment in which it operates. Essential actions in compliant motion tasks are the contacts that take place, and therefore, it is important to understand the sequence of contact states made during a demonstration, called contact classification. We propose a contact classification algorithm based on the random forest algorithm. The main advantage of this approach is that it does not depend on the geometric model of the objects involved in the demonstration. Moreover, it does not rely on the kinestatic model of the contact interactions. The comparison with state‐of‐the‐art contact classifiers shows that random forest classifier is more accurate. Copyright © 2015 John Wiley & Sons, Ltd.

Suggested Citation

  • S. Cabras & M. E. Castellanos & E. Staffetti, 2016. "A random forest application to contact‐state classification for robot programming by human demonstration," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 32(2), pages 209-227, March.
  • Handle: RePEc:wly:apsmbi:v:32:y:2016:i:2:p:209-227
    DOI: 10.1002/asmb.2145
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asmb.2145
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asmb.2145?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:apsmbi:v:32:y:2016:i:2:p:209-227. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1526-4025 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.