Simultaneous Planning of Grasp and Motion using Sample Regions and Gradient-Based Optimization

Takayuki Murooka, A. I. Károly, Felix von Drigalski, Yoshihisa Ijiri
{"title":"Simultaneous Planning of Grasp and Motion using Sample Regions and Gradient-Based Optimization","authors":"Takayuki Murooka, A. I. Károly, Felix von Drigalski, Yoshihisa Ijiri","doi":"10.1109/CASE48305.2020.9217027","DOIUrl":null,"url":null,"abstract":"Motion planning is an essential component of robotic systems. Gradient-based planning has been proposed to produce smooth paths under constraints for manipulation tasks such as picking and placing objects. However, it does not deal well with discontinuities, which occur in many manipulation problems, e.g. when deciding whether to pick an object from the side or from the top. Sampling-based planning is robust against such discontinuities, but often produces paths with unnecessary motions that require heavy post-processing. In this paper, we propose a novel method to solve a complete manipulation task using gradient-based optimization while preserving the advantages of sampling-based planning. By dividing the surface of the object into regions where the grasp pose can be extracted quasi-continuously, we define multiple optimization problems in parallel, which are evaluated independently. As our method generates the motion path and grasp plan for the entire task, constraints that arise from each moment of the task are propagated automatically to the optimization of the entire task, facilitating the setup. We show the effectiveness of the proposed method in simulation and with a real robot.","PeriodicalId":212181,"journal":{"name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASE48305.2020.9217027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Motion planning is an essential component of robotic systems. Gradient-based planning has been proposed to produce smooth paths under constraints for manipulation tasks such as picking and placing objects. However, it does not deal well with discontinuities, which occur in many manipulation problems, e.g. when deciding whether to pick an object from the side or from the top. Sampling-based planning is robust against such discontinuities, but often produces paths with unnecessary motions that require heavy post-processing. In this paper, we propose a novel method to solve a complete manipulation task using gradient-based optimization while preserving the advantages of sampling-based planning. By dividing the surface of the object into regions where the grasp pose can be extracted quasi-continuously, we define multiple optimization problems in parallel, which are evaluated independently. As our method generates the motion path and grasp plan for the entire task, constraints that arise from each moment of the task are propagated automatically to the optimization of the entire task, facilitating the setup. We show the effectiveness of the proposed method in simulation and with a real robot.
基于样本区域和梯度优化的抓取和运动同步规划
运动规划是机器人系统的重要组成部分。提出了基于梯度的规划,以在诸如拾取和放置物体等操作任务的约束下生成平滑路径。然而,它不能很好地处理在许多操作问题中出现的不连续,例如,当决定是从侧面还是从顶部拾取物体时。基于采样的规划对于这种不连续性是健壮的,但通常会产生带有不必要运动的路径,需要大量的后处理。在本文中,我们提出了一种新的方法来解决一个完整的操作任务,使用基于梯度的优化,同时保留了基于采样的规划的优点。通过将目标表面划分为可准连续提取抓取姿态的区域,我们并行定义了多个优化问题,这些优化问题独立评估。当我们的方法生成整个任务的运动路径和抓取计划时,从任务的每个时刻产生的约束会自动传播到整个任务的优化中,从而便于设置。通过仿真和一个真实的机器人验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信