Jun Yu Li, Yiyao Zhu, Langcheng Huo, Yongquan Chen
{"title":"基于约束贝叶斯优化的安全控制软优先级的样本高效学习","authors":"Jun Yu Li, Yiyao Zhu, Langcheng Huo, Yongquan Chen","doi":"10.1109/IRC.2020.00069","DOIUrl":null,"url":null,"abstract":"A complex motion can be achieved by executing multiple tasks simultaneously, where the key is tuning the task priorities. Generally, task priorities are predefined manually. In order to generate task priorities automatically, different frameworks have been proposed. In this paper, we employed a black-box optimization method, i.e. a variant of constrained Bayesian optimization to learn the soft task priorities, guaranteeing that the robot motion is optimized with high efficiency and no constraints violations occur during the whole learning process.","PeriodicalId":232817,"journal":{"name":"2020 Fourth IEEE International Conference on Robotic Computing (IRC)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Sample-efficient learning of soft priorities for safe control with constrained Bayesian optimization\",\"authors\":\"Jun Yu Li, Yiyao Zhu, Langcheng Huo, Yongquan Chen\",\"doi\":\"10.1109/IRC.2020.00069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A complex motion can be achieved by executing multiple tasks simultaneously, where the key is tuning the task priorities. Generally, task priorities are predefined manually. In order to generate task priorities automatically, different frameworks have been proposed. In this paper, we employed a black-box optimization method, i.e. a variant of constrained Bayesian optimization to learn the soft task priorities, guaranteeing that the robot motion is optimized with high efficiency and no constraints violations occur during the whole learning process.\",\"PeriodicalId\":232817,\"journal\":{\"name\":\"2020 Fourth IEEE International Conference on Robotic Computing (IRC)\",\"volume\":\"107 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 Fourth IEEE International Conference on Robotic Computing (IRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IRC.2020.00069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Fourth IEEE International Conference on Robotic Computing (IRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRC.2020.00069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Sample-efficient learning of soft priorities for safe control with constrained Bayesian optimization
A complex motion can be achieved by executing multiple tasks simultaneously, where the key is tuning the task priorities. Generally, task priorities are predefined manually. In order to generate task priorities automatically, different frameworks have been proposed. In this paper, we employed a black-box optimization method, i.e. a variant of constrained Bayesian optimization to learn the soft task priorities, guaranteeing that the robot motion is optimized with high efficiency and no constraints violations occur during the whole learning process.