TL;DR
The paper presents the BOW Planner, a scalable Bayesian optimization-based motion planning algorithm that efficiently generates safe, near-optimal trajectories in complex environments, outperforming existing methods in speed and reliability.
Contribution
It introduces a novel constrained Bayesian optimization approach focused on planning windows, enabling rapid, safe motion planning with theoretical guarantees and practical effectiveness.
Findings
Substantial reduction in computation times compared to existing methods.
High sample efficiency and safety-aware optimization demonstrated in real-world tests.
Theoretical convergence to near-optimal solutions confirmed.
Abstract
This paper introduces the BOW Planner, a scalable motion planning algorithm designed to navigate robots through complex environments using constrained Bayesian optimization (CBO). Unlike traditional methods, which often struggle with kinodynamic constraints such as velocity and acceleration limits, the BOW Planner excels by concentrating on a planning window of reachable velocities and employing CBO to sample control inputs efficiently. This approach enables the planner to manage high-dimensional objective functions and stringent safety constraints with minimal sampling, ensuring rapid and secure trajectory generation. Theoretical analysis confirms the algorithm's asymptotic convergence to near-optimal solutions, while extensive evaluations in cluttered and constrained settings reveal substantial improvements in computation times, trajectory lengths, and solution times compared to…
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.
