期刊
INTEGRATED COMPUTER-AIDED ENGINEERING
卷 25, 期 2, 页码 111-135出版社
IOS PRESS
DOI: 10.3233/ICA-180563
关键词
Robotic surface finishing; parameter optimization; constraint satisfaction problem; optimization under black; box-constraints
类别
资金
- National Science Foundation [1634431]
- Directorate For Engineering
- Div Of Civil, Mechanical, & Manufact Inn [1634431] Funding Source: National Science Foundation
In this paper, we have presented a method to identify optimal trajectory parameters in process applications like robotic finishing, while minimizing the required number of physical experiments. Our method optimizes the task objective and meets the task performance constraints. The algorithm makes decisions based on the uncertainty in the surrogate models of task performances or black-box constraints. The method intelligently samples the parameter space to select a point for evaluation from the sampled set by determining its probability to be optimum within the set. The iterative method rapidly converges to the optimal point with a small number of experiments. We have proved that our method will converge faster than any other method in the expected sense. We have considered synthetic test problems to benchmark our method against other methods. We have validated our approach through physical experiments of robotic scrubbing and sanding. This algorithm is general enough to be applicable to mathematical constraint satisfaction problems where the objective function is known and the constraint functions are unknown.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据