arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.14787cs.ROcs.CVcs.LG

Unsupervised Path Regression Networks

University of Cambridge(剑桥大学);Imperial College London(帝国理工学院)

Michal Pándy, Daniel Lenton, Ronald Clark

英文摘要:

We demonstrate that challenging shortest path problems can be solved via direct spline regression from a neural network, trained in an unsupervised manner (i.e. without requiring ground truth optimal paths for training). To achieve this, we derive a geometry-dependent optimal cost function whose minima guarantees collision-free solutions. Our method beats state-of-the-art supervised learning baselines for shortest path planning, with a much more scalable training pipeline, and a significant speedup in inference time.

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

↑