面向机器人机械臂的完整安全路径规划

B. Lacevic, P. Rocco
{"title":"面向机器人机械臂的完整安全路径规划","authors":"B. Lacevic, P. Rocco","doi":"10.1109/IROS.2010.5650945","DOIUrl":null,"url":null,"abstract":"We propose a novel method of path planning for robotic manipulators that is based on the tree expansion via bubbles of free configuration space. The algorithm is designed to yield collision-free paths that also tend to minimize a certain danger criterion. This is achieved by embedding a suitably tailored heuristics within the algorithm. For that purpose we use a recently proposed safety assessment based on the concept of the danger field - an easily computable quantity that captures the complete kinematic behavior of the manipulator. Under the assumption that a systematic graph search technique dictates the tree growth, we prove the algorithm's completeness.","PeriodicalId":420658,"journal":{"name":"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Towards a complete safe path planning for robotic manipulators\",\"authors\":\"B. Lacevic, P. Rocco\",\"doi\":\"10.1109/IROS.2010.5650945\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a novel method of path planning for robotic manipulators that is based on the tree expansion via bubbles of free configuration space. The algorithm is designed to yield collision-free paths that also tend to minimize a certain danger criterion. This is achieved by embedding a suitably tailored heuristics within the algorithm. For that purpose we use a recently proposed safety assessment based on the concept of the danger field - an easily computable quantity that captures the complete kinematic behavior of the manipulator. Under the assumption that a systematic graph search technique dictates the tree growth, we prove the algorithm's completeness.\",\"PeriodicalId\":420658,\"journal\":{\"name\":\"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IROS.2010.5650945\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.2010.5650945","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

摘要

提出了一种基于自由位形空间气泡树展开的机器人路径规划新方法。该算法旨在产生无碰撞的路径,同时也倾向于最小化某个危险准则。这是通过在算法中嵌入适当定制的启发式来实现的。为此,我们使用了最近提出的基于危险场概念的安全评估-一个易于计算的量,可以捕获机械手的完整运动学行为。在假设系统图搜索技术决定树生长的前提下,我们证明了算法的完备性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards a complete safe path planning for robotic manipulators
We propose a novel method of path planning for robotic manipulators that is based on the tree expansion via bubbles of free configuration space. The algorithm is designed to yield collision-free paths that also tend to minimize a certain danger criterion. This is achieved by embedding a suitably tailored heuristics within the algorithm. For that purpose we use a recently proposed safety assessment based on the concept of the danger field - an easily computable quantity that captures the complete kinematic behavior of the manipulator. Under the assumption that a systematic graph search technique dictates the tree growth, we prove the algorithm's completeness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信