arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1805.01079cs.RO
收藏

连续占用地图中的函数路径优化探索

Functional Path Optimisation for Exploration in Continuous Occupancy Maps

The School of Information Technologies, University of Sydney(悉尼大学信息技术学院)

Gilad Francis, Lionel Ott, Fabio Ramos

摘要:

自主探索是一项复杂的任务,机器人在未知环境中移动,目标是绘制地图。此类过程的期望输出是一系列路径,可以有效且安全地最大限度地减少生成地图的不确定性。然而,优化整个空间的可能路径是计算上棘手的。因此,大多数探索方法通过优化一个更简单的问题来放松一般问题,例如找到单个下一个最佳视图。在这项工作中,我们制定的探索作为一个变分问题,使我们能够直接优化的轨迹空间使用功能梯度方法,搜索下一个最佳路径(NBP)。我们利用最近推出的希尔伯特映射设计一个基于信息的功能,可以计算在封闭的形式。所得到的轨迹是连续的并且最大化安全性以及互信息。在实验中,我们验证了该方法的能力,找到平滑和安全的路径,并比较这些结果与其他探索方法。

英文摘要:

Autonomous exploration is a complex task where the robot moves through an unknown environment with the goal of mapping it. The desired output of such a process is a sequence of paths that efficiently and safely minimise the uncertainty of the resulting map. However, optimising over the entire space of possible paths is computationally intractable. Therefore, most exploration methods relax the general problem by optimising a simpler one, for example finding the single next best view. In this work, we formulate exploration as a variational problem which allows us to directly optimise in the space of trajectories using functional gradient methods, searching for the Next Best Path (NBP). We take advantage of the recently introduced Hilbert maps to devise an information-based functional that can be computed in closed-form. The resulting trajectories are continuous and maximise safety as well as mutual information. In experiments we verify the ability of the proposed method to find smooth and safe paths and compare these results with other exploration methods.

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

↑