{"title":"Repetition sampling for efficiently planning similar constrained manipulation tasks","authors":"Peter Lehner, A. Albu-Schäffer","doi":"10.1109/IROS.2017.8206116","DOIUrl":null,"url":null,"abstract":"We present repetition sampling, a new adaptive strategy for sampling based planning, which extracts information from previous solutions to focus the search for a similar task on relevant configuration space. We show how to generate distributions for repetition sampling by learning Gaussian Mixture Models from prior solutions. We present how to bias a sampling based planner with the learned distribution to generate new paths for similar tasks. We illustrate our method in a simple maze which explains the generation of the distribution and how repetition sampling can generalize over different environments. We show how to apply repetition sampling to similar constrained manipulation tasks and present our results including significant speedup in execution time when compared to uniform sampling.","PeriodicalId":6658,"journal":{"name":"2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","volume":"39 1","pages":"2851-2856"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.2017.8206116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
Abstract
We present repetition sampling, a new adaptive strategy for sampling based planning, which extracts information from previous solutions to focus the search for a similar task on relevant configuration space. We show how to generate distributions for repetition sampling by learning Gaussian Mixture Models from prior solutions. We present how to bias a sampling based planner with the learned distribution to generate new paths for similar tasks. We illustrate our method in a simple maze which explains the generation of the distribution and how repetition sampling can generalize over different environments. We show how to apply repetition sampling to similar constrained manipulation tasks and present our results including significant speedup in execution time when compared to uniform sampling.