{"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}
引用次数: 25
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.