arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.13552cs.RO
收藏

Dispertio:基于安全确定性采样的运动规划的最优采样

Dispertio: Optimal Sampling for Safe Deterministic Sampling-Based Motion Planning

RWTH Aachen(亚琛工业大学);German Aerospace Center (DLR)(德国航空航天中心);Robert Bosch GmbH, Corporate Research(罗伯特·博世有限公司企业研究院);KTH Stockholm(瑞典皇家理工学院)

Luigi Palmieri, Leonard Bruns, Michael Meurer, Kai Oliver Arras

摘要:

机器人技术的一个关键挑战是在杂乱的环境中有效地生成最佳的机器人运动,并保证安全。最近,确定性的最佳采样为基础的运动规划已被证明实现良好的性能,为此,特别是在规划效率,最终解决方案的成本,质量保证以及非概率的完整性。然而它们的应用仍然限于相对简单的系统(即,线性、完整、欧几里得状态空间)。在这项工作中,我们将这种技术扩展到对称和最佳无漂移系统的类提出分散,离线分散优化技术计算采样集,知道差分约束,采样为基础的机器人运动规划。我们证明了该方法,当结合PRM*,是确定性完成,并保留渐近最优性。此外,在我们的实验中,我们表明,建议的确定性抽样技术优于几个基线和替代方法的规划效率和解决方案的成本。

英文摘要:

A key challenge in robotics is the efficient generation of optimal robot motion with safety guarantees in cluttered environments. Recently, deterministic optimal sampling-based motion planners have been shown to achieve good performance towards this end, in particular in terms of planning efficiency, final solution cost, quality guarantees as well as non-probabilistic completeness. Yet their application is still limited to relatively simple systems (i.e., linear, holonomic, Euclidean state spaces). In this work, we extend this technique to the class of symmetric and optimal driftless systems by presenting Dispertio, an offline dispersion optimization technique for computing sampling sets, aware of differential constraints, for sampling-based robot motion planning. We prove that the approach, when combined with PRM*, is deterministically complete and retains asymptotic optimality. Furthermore, in our experiments we show that the proposed deterministic sampling technique outperforms several baselines and alternative methods in terms of planning efficiency and solution cost.

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

↑