Fast Multi-Contact Motion Planning Based on Best-Neighbor Search of Contact Sequences

Y. Tazaki
{"title":"Fast Multi-Contact Motion Planning Based on Best-Neighbor Search of Contact Sequences","authors":"Y. Tazaki","doi":"10.1109/Humanoids53995.2022.10000158","DOIUrl":null,"url":null,"abstract":"This paper presents a computationally efficient method for planning dynamic multi-contact motion. A low-dimensional dynamical model of a robot equipped with multiple contact points is developed, and a motion planning problem is formulated as a optimal control problem with continuous and discrete variables. An extension to the differential dynamic programming (DDP) framework enables efficient computation of optimal cost for a large number of locally modified contact sequences. Based on this finding, a novel algorithm for multi-contact motion planning is developed, and its performance is evaluated in simulations.","PeriodicalId":180816,"journal":{"name":"2022 IEEE-RAS 21st International Conference on Humanoid Robots (Humanoids)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE-RAS 21st International Conference on Humanoid Robots (Humanoids)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/Humanoids53995.2022.10000158","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper presents a computationally efficient method for planning dynamic multi-contact motion. A low-dimensional dynamical model of a robot equipped with multiple contact points is developed, and a motion planning problem is formulated as a optimal control problem with continuous and discrete variables. An extension to the differential dynamic programming (DDP) framework enables efficient computation of optimal cost for a large number of locally modified contact sequences. Based on this finding, a novel algorithm for multi-contact motion planning is developed, and its performance is evaluated in simulations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于接触序列最近邻搜索的快速多接触运动规划
本文提出了一种计算效率高的多接触动态运动规划方法。建立了具有多个接触点的机器人低维动力学模型,并将其运动规划问题化为具有连续变量和离散变量的最优控制问题。微分动态规划(DDP)框架的扩展使大量局部修改的接触序列的最优代价的有效计算。基于这一发现,提出了一种新的多接触运动规划算法,并通过仿真对其性能进行了评价。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Enabling Patient- and Teleoperator-led Robotic Physiotherapy via Strain Map Segmentation and Shared-authority Self-Contained Calibration of an Elastic Humanoid Upper Body Using Only a Head-Mounted RGB Camera Self-collision avoidance in bimanual teleoperation using CollisionIK: algorithm revision and usability experiment Bimanual Manipulation Workspace Analysis of Humanoid Robots with Object Specific Coupling Constraints A Dexterous, Adaptive, Affordable, Humanlike Robot Hand: Towards Prostheses with Dexterous Manipulation Capabilities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1