mlsanityData to 7 Oct 2026

Augmenting GRIPS with Heuristic Sampling for Planning Feasible Trajectories of a Car-Like Robot

arXiv 2108.06789 ↗First posted 15 Aug 2021cs.RO cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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 car-like robots. The main enhancement is adding the additional step that heuristically samples waypoints along the bottleneck parts of the geometric paths (such as sharp turns). The results of the experimental evaluation provide a clear evidence that the success rate of the suggested algorithm is up to 40% higher compared to the original GRIPS and hits the bar of 90%, while its runtime is lower.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 4 of its 21 references that are in the map. First posted on arXiv 15 Aug 2021.

Builds on

4 of 21 references.

References · 4

  1. 2014Theta*: Any-Angle Path Planning on Gridscited by 26
  2. 2020Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniquescited by 10
  3. 2018Sampling-based optimal kinodynamic planning with motion primitivescited by 5
  4. 2019An NMPC Approach using Convex Inner Approximations for Online Motion Planning with Guaranteed Collision Avoidancecited by 3

Built on by

Not cited yet.