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

基于高斯过程推理的多同伦类在线运动规划

Online Motion Planning Over Multiple Homotopy Classes with Gaussian Process Inference

Georgia Institute of Technology(佐治亚理工学院)

Keshav Kolur, Sahit Chintalapudi, Byron Boots, Mustafa Mukadam

摘要:

在动态和不确定的环境中进行有效的规划是机器人技术的一个基本挑战。在轨迹优化的背景下,路径的可行性可以随着环境的演变而改变。因此,同时推理多个可能的路径可能是有益的。我们建立在以前的工作,认为基于图形的轨迹,同时在多个同伦类中找到解决方案。具体来说,我们将以前的工作扩展到在线设置,其中图的不可达(在时间上)部分被修剪,其余的图在每个时间步被重新优化。当机器人在图中最有希望的路径上移动时,修剪和重新优化允许我们保留候选路径,这些路径在未来随着环境的变化可能变得更加可行,基本上使机器人能够在众多同伦类之间动态切换。我们将我们的方法与以前的工作相比,没有同伦切换功能,并在噪声测量和执行下的多个动态环境中的2D机器人仿真中的几个指标上显示出改进的性能。

英文摘要:

Efficient planning in dynamic and uncertain environments is a fundamental challenge in robotics. In the context of trajectory optimization, the feasibility of paths can change as the environment evolves. Therefore, it can be beneficial to reason about multiple possible paths simultaneously. We build on prior work that considers graph-based trajectories to find solutions in multiple homotopy classes concurrently. Specifically, we extend this previous work to an online setting where the unreachable (in time) part of the graph is pruned and the remaining graph is reoptimized at every time step. As the robot moves within the graph on the path that is most promising, the pruning and reoptimization allows us to retain candidate paths that may become more viable in the future as the environment changes, essentially enabling the robot to dynamically switch between numerous homotopy classes. We compare our approach against prior work without the homotopy switching capability and show improved performance across several metrics in simulation with a 2D robot in multiple dynamic environments under noisy measurements and execution.

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

↑