Augmenting GRIPS with Heuristic Sampling for Planning Feasible Trajectories of a Car-Like Robot
Brian Angulo, Konstantin Yakovlev, Ivan Radionov

TL;DR
This paper enhances the GRIPS algorithm for kinodynamic motion planning of car-like robots by adding heuristic waypoint sampling, significantly increasing success rates and reducing runtime.
Contribution
The authors introduce a heuristic sampling step to improve GRIPS, achieving higher success rates in generating feasible trajectories for car-like robots.
Findings
Success rate increased by up to 40%
Achieved over 90% success rate in experiments
Reduced runtime compared to original GRIPS
Abstract
Kinodynamic motion planning for non-holomonic mobile robots is a challenging problem that is lacking a universal solution. One of the computationally efficient ways to solve it is to build a geometric path first and then transform this path into a kinematically feasible one. Gradient-informed Path Smoothing (GRIPS) is a recently introduced method for such transformation. GRIPS iteratively deforms the path and adds/deletes the waypoints while trying to connect each consecutive pair of them via the provided steering function that respects the kinematic constraints. The algorithm is relatively fast but, unfortunately, does not provide any guarantees that it will succeed. In practice, it often fails to produce feasible trajectories for car-like robots with large turning radius. In this work, we introduce a range of modifications that are aimed at increasing the success rate of GRIPS for…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
