TL;DR
This paper introduces iPlanner, an innovative path planning method that combines differentiable cost maps and bi-level optimization to achieve faster, more robust, and generalizable planning without requiring labeled data.
Contribution
The paper proposes a novel Imperative Learning approach using differentiable cost maps and bi-level optimization, enabling efficient, generalizable path planning without demonstrations.
Findings
4x faster planning than classic methods
Robustness against localization noise
26-87% improvement in SPL performance
Abstract
The problem of path planning has been studied for years. Classic planning pipelines, including perception, mapping, and path searching, can result in latency and compounding errors between modules. While recent studies have demonstrated the effectiveness of end-to-end learning methods in achieving high planning efficiency, these methods often struggle to match the generalization abilities of classic approaches in handling different environments. Moreover, end-to-end training of policies often requires a large number of labeled data or training iterations to reach convergence. In this paper, we present a novel Imperative Learning (IL) approach. This approach leverages a differentiable cost map to provide implicit supervision during policy training, eliminating the need for demonstrations or labeled trajectories. Furthermore, the policy training adopts a Bi-Level Optimization (BLO)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
