Long Time Sequential Task Learning From Unstructured Demonstrations

Learning from demonstration (LfD), which provides a natural way to transfer skills to robots, has been extensively researched for decades, and an army of methods and applications have been developed and investigated for learning an individual or low-level task. Nevertheless, learning long time seque...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access 2019, Vol.7, p.96240-96252
Hauptverfasser: Zhang, Huiwen, Liu, Yuwang, Zhou, Weijia
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 96252
container_issue
container_start_page 96240
container_title IEEE access
container_volume 7
creator Zhang, Huiwen
Liu, Yuwang
Zhou, Weijia
description Learning from demonstration (LfD), which provides a natural way to transfer skills to robots, has been extensively researched for decades, and an army of methods and applications have been developed and investigated for learning an individual or low-level task. Nevertheless, learning long time sequential tasks is still very difficult as it involves task segmentation and sub-task clustering under an extremely large demonstration variance. Besides, the representation problem should be considered when doing segmentation. This paper presents a new unified framework to solve the problems of segmentation, clustering, and representation in a sequential task. The segmentation algorithm segments unstructured demonstrations into movement primitives (MPs). Then, the MPs are automatically clustered and labeled so that they can be reused in other tasks. Finally, the representation model is leveraged to encode and generalize the learned MPs in new contexts. To achieve the first goal, a change-point detection algorithm based on Bayesian inference is leveraged. It can segment unstructured demonstrations online with minimum prior knowledge requirements. By following the Gaussian distributed assumption in the segmentation model, MPs are encoded by Gaussians or Gaussian mixture models. Thus, the clustering of MPs is formulated as a clustering over cluster (CoC) problem. The Kullback-Leibler divergence is used to measure similarities between MPs, through which the MPs with smaller distance are clustered into the same group. To replay and generalize the task in novel contexts, we use task-parameterized regression models such as the Gaussian mixture regression. We implemented our framework on a sequential open-and-place task. The experiments demonstrate that the segmentation accuracy of our framework can reach 94.3% and the recognition accuracy can reach 97.1%. Comparisons with the state-of-the-art algorithm also indicate that our framework is superior or comparable to their results.
doi_str_mv 10.1109/ACCESS.2019.2929107
format Article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_8770237</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8770237</ieee_id><doaj_id>oai_doaj_org_article_bc7d31c37ca140c3b59c86f8057808d2</doaj_id><sourcerecordid>2455637009</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3237-65919ab96213f524e3a0ccfa31980d2ffc6d1d13b3120c854ec254c483948c343</originalsourceid><addsrcrecordid>eNpNkE9vwiAYxsmyJTObn8BLk53rgLcUOJpON5MmO6hnQik1OFscrYd9--FqzLi8vH-eB94fQjOC54Rg-booiuVmM6eYyDmVVBLM79CEklymwCC__3d_RNO-P-B4RCwxPkFF6bt9snWtTTb2-2y7weljstX9V1JaHToXu6vg22TX9UM4m-EcbJ282dZfcj24GJ_RQ6OPvZ1e4xParZbb4iMtP9_XxaJMDVDgac4kkbqSOSXQMJpZ0NiYRgORAte0aUxek5pABYRiI1hmDWWZyQTITBjI4AmtR9_a64M6Bdfq8KO8duqv4MNe6TA4c7SqMrwGYoAbTTJsoGLSiLwRmHGBRU2j18vodQo-rt0P6uDPoYvfVzRjLAeOsYxTME6Z4Ps-2Ob2KsHqAl-N8NUFvrrCj6rZqHLW2ptCcI4jBvgFDlF-UA</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2455637009</pqid></control><display><type>article</type><title>Long Time Sequential Task Learning From Unstructured Demonstrations</title><source>IEEE Open Access Journals</source><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Zhang, Huiwen ; Liu, Yuwang ; Zhou, Weijia</creator><creatorcontrib>Zhang, Huiwen ; Liu, Yuwang ; Zhou, Weijia</creatorcontrib><description>Learning from demonstration (LfD), which provides a natural way to transfer skills to robots, has been extensively researched for decades, and an army of methods and applications have been developed and investigated for learning an individual or low-level task. Nevertheless, learning long time sequential tasks is still very difficult as it involves task segmentation and sub-task clustering under an extremely large demonstration variance. Besides, the representation problem should be considered when doing segmentation. This paper presents a new unified framework to solve the problems of segmentation, clustering, and representation in a sequential task. The segmentation algorithm segments unstructured demonstrations into movement primitives (MPs). Then, the MPs are automatically clustered and labeled so that they can be reused in other tasks. Finally, the representation model is leveraged to encode and generalize the learned MPs in new contexts. To achieve the first goal, a change-point detection algorithm based on Bayesian inference is leveraged. It can segment unstructured demonstrations online with minimum prior knowledge requirements. By following the Gaussian distributed assumption in the segmentation model, MPs are encoded by Gaussians or Gaussian mixture models. Thus, the clustering of MPs is formulated as a clustering over cluster (CoC) problem. The Kullback-Leibler divergence is used to measure similarities between MPs, through which the MPs with smaller distance are clustered into the same group. To replay and generalize the task in novel contexts, we use task-parameterized regression models such as the Gaussian mixture regression. We implemented our framework on a sequential open-and-place task. The experiments demonstrate that the segmentation accuracy of our framework can reach 94.3% and the recognition accuracy can reach 97.1%. Comparisons with the state-of-the-art algorithm also indicate that our framework is superior or comparable to their results.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2019.2929107</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Algorithms ; Bayes methods ; Bayesian analysis ; Bayesian segmentation ; Clustering ; Clustering algorithms ; Encoding ; Hidden Markov models ; imitation learning ; KL divergence ; Learning ; mixture model ; movement primitives ; Probabilistic models ; Regression models ; Representations ; Robots ; Segmentation ; Segments ; Statistical inference ; Task analysis ; Trajectory</subject><ispartof>IEEE access, 2019, Vol.7, p.96240-96252</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3237-65919ab96213f524e3a0ccfa31980d2ffc6d1d13b3120c854ec254c483948c343</citedby><cites>FETCH-LOGICAL-c3237-65919ab96213f524e3a0ccfa31980d2ffc6d1d13b3120c854ec254c483948c343</cites><orcidid>0000-0003-1770-4760</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8770237$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,864,2102,4024,27633,27923,27924,27925,54933</link.rule.ids></links><search><creatorcontrib>Zhang, Huiwen</creatorcontrib><creatorcontrib>Liu, Yuwang</creatorcontrib><creatorcontrib>Zhou, Weijia</creatorcontrib><title>Long Time Sequential Task Learning From Unstructured Demonstrations</title><title>IEEE access</title><addtitle>Access</addtitle><description>Learning from demonstration (LfD), which provides a natural way to transfer skills to robots, has been extensively researched for decades, and an army of methods and applications have been developed and investigated for learning an individual or low-level task. Nevertheless, learning long time sequential tasks is still very difficult as it involves task segmentation and sub-task clustering under an extremely large demonstration variance. Besides, the representation problem should be considered when doing segmentation. This paper presents a new unified framework to solve the problems of segmentation, clustering, and representation in a sequential task. The segmentation algorithm segments unstructured demonstrations into movement primitives (MPs). Then, the MPs are automatically clustered and labeled so that they can be reused in other tasks. Finally, the representation model is leveraged to encode and generalize the learned MPs in new contexts. To achieve the first goal, a change-point detection algorithm based on Bayesian inference is leveraged. It can segment unstructured demonstrations online with minimum prior knowledge requirements. By following the Gaussian distributed assumption in the segmentation model, MPs are encoded by Gaussians or Gaussian mixture models. Thus, the clustering of MPs is formulated as a clustering over cluster (CoC) problem. The Kullback-Leibler divergence is used to measure similarities between MPs, through which the MPs with smaller distance are clustered into the same group. To replay and generalize the task in novel contexts, we use task-parameterized regression models such as the Gaussian mixture regression. We implemented our framework on a sequential open-and-place task. The experiments demonstrate that the segmentation accuracy of our framework can reach 94.3% and the recognition accuracy can reach 97.1%. Comparisons with the state-of-the-art algorithm also indicate that our framework is superior or comparable to their results.</description><subject>Algorithms</subject><subject>Bayes methods</subject><subject>Bayesian analysis</subject><subject>Bayesian segmentation</subject><subject>Clustering</subject><subject>Clustering algorithms</subject><subject>Encoding</subject><subject>Hidden Markov models</subject><subject>imitation learning</subject><subject>KL divergence</subject><subject>Learning</subject><subject>mixture model</subject><subject>movement primitives</subject><subject>Probabilistic models</subject><subject>Regression models</subject><subject>Representations</subject><subject>Robots</subject><subject>Segmentation</subject><subject>Segments</subject><subject>Statistical inference</subject><subject>Task analysis</subject><subject>Trajectory</subject><issn>2169-3536</issn><issn>2169-3536</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><sourceid>DOA</sourceid><recordid>eNpNkE9vwiAYxsmyJTObn8BLk53rgLcUOJpON5MmO6hnQik1OFscrYd9--FqzLi8vH-eB94fQjOC54Rg-booiuVmM6eYyDmVVBLM79CEklymwCC__3d_RNO-P-B4RCwxPkFF6bt9snWtTTb2-2y7weljstX9V1JaHToXu6vg22TX9UM4m-EcbJ282dZfcj24GJ_RQ6OPvZ1e4xParZbb4iMtP9_XxaJMDVDgac4kkbqSOSXQMJpZ0NiYRgORAte0aUxek5pABYRiI1hmDWWZyQTITBjI4AmtR9_a64M6Bdfq8KO8duqv4MNe6TA4c7SqMrwGYoAbTTJsoGLSiLwRmHGBRU2j18vodQo-rt0P6uDPoYvfVzRjLAeOsYxTME6Z4Ps-2Ob2KsHqAl-N8NUFvrrCj6rZqHLW2ptCcI4jBvgFDlF-UA</recordid><startdate>2019</startdate><enddate>2019</enddate><creator>Zhang, Huiwen</creator><creator>Liu, Yuwang</creator><creator>Zhou, Weijia</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0003-1770-4760</orcidid></search><sort><creationdate>2019</creationdate><title>Long Time Sequential Task Learning From Unstructured Demonstrations</title><author>Zhang, Huiwen ; Liu, Yuwang ; Zhou, Weijia</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3237-65919ab96213f524e3a0ccfa31980d2ffc6d1d13b3120c854ec254c483948c343</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Bayes methods</topic><topic>Bayesian analysis</topic><topic>Bayesian segmentation</topic><topic>Clustering</topic><topic>Clustering algorithms</topic><topic>Encoding</topic><topic>Hidden Markov models</topic><topic>imitation learning</topic><topic>KL divergence</topic><topic>Learning</topic><topic>mixture model</topic><topic>movement primitives</topic><topic>Probabilistic models</topic><topic>Regression models</topic><topic>Representations</topic><topic>Robots</topic><topic>Segmentation</topic><topic>Segments</topic><topic>Statistical inference</topic><topic>Task analysis</topic><topic>Trajectory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Huiwen</creatorcontrib><creatorcontrib>Liu, Yuwang</creatorcontrib><creatorcontrib>Zhou, Weijia</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>IEEE access</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Huiwen</au><au>Liu, Yuwang</au><au>Zhou, Weijia</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Long Time Sequential Task Learning From Unstructured Demonstrations</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2019</date><risdate>2019</risdate><volume>7</volume><spage>96240</spage><epage>96252</epage><pages>96240-96252</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>Learning from demonstration (LfD), which provides a natural way to transfer skills to robots, has been extensively researched for decades, and an army of methods and applications have been developed and investigated for learning an individual or low-level task. Nevertheless, learning long time sequential tasks is still very difficult as it involves task segmentation and sub-task clustering under an extremely large demonstration variance. Besides, the representation problem should be considered when doing segmentation. This paper presents a new unified framework to solve the problems of segmentation, clustering, and representation in a sequential task. The segmentation algorithm segments unstructured demonstrations into movement primitives (MPs). Then, the MPs are automatically clustered and labeled so that they can be reused in other tasks. Finally, the representation model is leveraged to encode and generalize the learned MPs in new contexts. To achieve the first goal, a change-point detection algorithm based on Bayesian inference is leveraged. It can segment unstructured demonstrations online with minimum prior knowledge requirements. By following the Gaussian distributed assumption in the segmentation model, MPs are encoded by Gaussians or Gaussian mixture models. Thus, the clustering of MPs is formulated as a clustering over cluster (CoC) problem. The Kullback-Leibler divergence is used to measure similarities between MPs, through which the MPs with smaller distance are clustered into the same group. To replay and generalize the task in novel contexts, we use task-parameterized regression models such as the Gaussian mixture regression. We implemented our framework on a sequential open-and-place task. The experiments demonstrate that the segmentation accuracy of our framework can reach 94.3% and the recognition accuracy can reach 97.1%. Comparisons with the state-of-the-art algorithm also indicate that our framework is superior or comparable to their results.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2019.2929107</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0003-1770-4760</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2169-3536
ispartof IEEE access, 2019, Vol.7, p.96240-96252
issn 2169-3536
2169-3536
language eng
recordid cdi_ieee_primary_8770237
source IEEE Open Access Journals; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Algorithms
Bayes methods
Bayesian analysis
Bayesian segmentation
Clustering
Clustering algorithms
Encoding
Hidden Markov models
imitation learning
KL divergence
Learning
mixture model
movement primitives
Probabilistic models
Regression models
Representations
Robots
Segmentation
Segments
Statistical inference
Task analysis
Trajectory
title Long Time Sequential Task Learning From Unstructured Demonstrations
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T19%3A45%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Long%20Time%20Sequential%20Task%20Learning%20From%20Unstructured%20Demonstrations&rft.jtitle=IEEE%20access&rft.au=Zhang,%20Huiwen&rft.date=2019&rft.volume=7&rft.spage=96240&rft.epage=96252&rft.pages=96240-96252&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2019.2929107&rft_dat=%3Cproquest_ieee_%3E2455637009%3C/proquest_ieee_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2455637009&rft_id=info:pmid/&rft_ieee_id=8770237&rft_doaj_id=oai_doaj_org_article_bc7d31c37ca140c3b59c86f8057808d2&rfr_iscdi=true