通过改编组成期权序列:初步结果

Charles A. Meehan, Paul Rademacher, Mark Roberts, Laura M. Hiatt
{"title":"通过改编组成期权序列:初步结果","authors":"Charles A. Meehan, Paul Rademacher, Mark Roberts, Laura M. Hiatt","doi":"arxiv-2409.08195","DOIUrl":null,"url":null,"abstract":"Robot manipulation in real-world settings often requires adapting the robot's\nbehavior to the current situation, such as by changing the sequences in which\npolicies execute to achieve the desired task. Problematically, however, we show\nthat composing a novel sequence of five deep RL options to perform a\npick-and-place task is unlikely to successfully complete, even if their\ninitiation and termination conditions align. We propose a framework to\ndetermine whether sequences will succeed a priori, and examine three approaches\nthat adapt options to sequence successfully if they will not. Crucially, our\nadaptation methods consider the actual subset of points that the option is\ntrained from or where it ends: (1) trains the second option to start where the\nfirst ends; (2) trains the first option to reach the centroid of where the\nsecond starts; and (3) trains the first option to reach the median of where the\nsecond starts. Our results show that our framework and adaptation methods have\npromise in adapting options to work in novel sequences.","PeriodicalId":501031,"journal":{"name":"arXiv - CS - Robotics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Composing Option Sequences by Adaptation: Initial Results\",\"authors\":\"Charles A. Meehan, Paul Rademacher, Mark Roberts, Laura M. Hiatt\",\"doi\":\"arxiv-2409.08195\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Robot manipulation in real-world settings often requires adapting the robot's\\nbehavior to the current situation, such as by changing the sequences in which\\npolicies execute to achieve the desired task. Problematically, however, we show\\nthat composing a novel sequence of five deep RL options to perform a\\npick-and-place task is unlikely to successfully complete, even if their\\ninitiation and termination conditions align. We propose a framework to\\ndetermine whether sequences will succeed a priori, and examine three approaches\\nthat adapt options to sequence successfully if they will not. Crucially, our\\nadaptation methods consider the actual subset of points that the option is\\ntrained from or where it ends: (1) trains the second option to start where the\\nfirst ends; (2) trains the first option to reach the centroid of where the\\nsecond starts; and (3) trains the first option to reach the median of where the\\nsecond starts. Our results show that our framework and adaptation methods have\\npromise in adapting options to work in novel sequences.\",\"PeriodicalId\":501031,\"journal\":{\"name\":\"arXiv - CS - Robotics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Robotics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.08195\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Robotics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08195","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

现实世界中的机器人操纵往往需要根据当前情况调整机器人的行为,例如通过改变策略的执行顺序来完成所需的任务。然而,问题在于,我们发现即使五个深度 RL 选项的启动条件和终止条件一致,组成一个新的序列来执行 "点击-放置 "任务也不太可能成功完成。我们提出了一个先验地确定序列是否会成功的框架,并研究了在序列不会成功的情况下调整选项以成功完成序列的三种方法。最重要的是,我们的适应方法考虑了选项的实际起始点或终止点:(1)训练第二个选项从第一个选项的终止点开始;(2)训练第一个选项到达第二个选项起始点的中心点;(3)训练第一个选项到达第二个选项起始点的中位数。我们的研究结果表明,我们的框架和适应方法有望使选项适应新的序列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Composing Option Sequences by Adaptation: Initial Results
Robot manipulation in real-world settings often requires adapting the robot's behavior to the current situation, such as by changing the sequences in which policies execute to achieve the desired task. Problematically, however, we show that composing a novel sequence of five deep RL options to perform a pick-and-place task is unlikely to successfully complete, even if their initiation and termination conditions align. We propose a framework to determine whether sequences will succeed a priori, and examine three approaches that adapt options to sequence successfully if they will not. Crucially, our adaptation methods consider the actual subset of points that the option is trained from or where it ends: (1) trains the second option to start where the first ends; (2) trains the first option to reach the centroid of where the second starts; and (3) trains the first option to reach the median of where the second starts. Our results show that our framework and adaptation methods have promise in adapting options to work in novel sequences.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信