arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.01000cs.LGstat.ML

机器人导航的鲁棒策略搜索

Robust Policy Search for Robot Navigation

Instituto de Investigacion en Ingenieria de Aragon (I3A)(阿拉贡工程研究所);University of Zaragoza(萨拉戈萨大学)

Javier Garcia-Barcos, Ruben Martinez-Cantin

AI总结:

本研究针对不确定环境下机器人导航的策略搜索问题,结合鲁棒优化与统计鲁棒性,通过改进的unscented Bayesian optimization和自适应代理模型及Boltzmann selection方法,提升了策略的安全性与收敛性能。

摘要:

复杂的机器人导航与控制问题可以被构建为策略搜索问题。然而,在不确定环境中的交互式学习可能代价高昂,需要使用数据高效的方法。贝叶斯优化是一种高效的非线性优化方法,它通过精心选择查询来收集关于最优位置的信息。这是通过编码过去信息的代理模型和用于查询选择的采集函数来实现的。贝叶斯优化对输入数据或先验假设中的不确定性非常敏感。在本研究中,我们结合了鲁棒优化和统计鲁棒性,展示了这两种鲁棒性是协同的。对于鲁棒优化,我们使用改进版的unscented Bayesian optimization,在存在策略不确定性时提供安全且可重复的策略。我们还提供了新的理论见解。对于统计鲁棒性,我们使用自适应代理模型,并引入Boltzmann selection作为一种随机采集方法,即使在代理建模存在误差时也能保证收敛并提升性能。我们在多个优化基准和机器人任务中展示了结果。

英文摘要:

Complex robot navigation and control problems can be framed as policy search problems. However, interactive learning in uncertain environments can be expensive, requiring the use of data-efficient methods. Bayesian optimization is an efficient nonlinear optimization method where queries are carefully selected to gather information about the optimum location. This is achieved by a surrogate model, which encodes past information, and the acquisition function for query selection. Bayesian optimization can be very sensitive to uncertainty in the input data or prior assumptions. In this work, we incorporate both robust optimization and statistical robustness, showing that both types of robustness are synergistic. For robust optimization we use an improved version of unscented Bayesian optimization which provides safe and repeatable policies in the presence of policy uncertainty. We also provide new theoretical insights. For statistical robustness, we use an adaptive surrogate model and we introduce the Boltzmann selection as a stochastic acquisition method to have convergence guarantees and improved performance even with surrogate modeling errors. We present results in several optimization benchmarks and robot tasks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑