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

• URL: http://arxiv.org/abs/2108.06789v1
• Date: Sun, 15 Aug 2021 18:28:07 GMT
• Title: Augmenting GRIPS with Heuristic Sampling for Planning Feasible Trajectories of a Car-Like Robot
• Authors: Brian Angulo, Konstantin Yakovlev, Ivan Radionov
• Abstract summary: 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 samples waypoints along the bottleneck parts of the geometric paths.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 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.

Related papers

• Finding Transformer Circuits with Edge Pruning [71.12127707678961]
  We propose Edge Pruning as an effective and scalable solution to automated circuit discovery. Our method finds circuits in GPT-2 that use less than half the number of edges compared to circuits found by previous methods. Thanks to its efficiency, we scale Edge Pruning to CodeLlama-13B, a model over 100x the scale that prior methods operate on.
  arXiv  Detail & Related papers  (2024-06-24T16:40:54Z)
• Waypoint-Based Imitation Learning for Robotic Manipulation [56.4287610994102]
  Waypoint labeling is underspecified, and requires additional human supervision. We propose Automatic Waypoint Extraction (AWE) for imitation learning. AWE can increase the success rate of state-of-the-art algorithms by up to 25% in simulation and by 4-28% on real-world bimanual manipulation tasks.
  arXiv  Detail & Related papers  (2023-07-26T17:45:55Z)
• POA: Passable Obstacles Aware Path-planning Algorithm for Navigation of a Two-wheeled Robot in Highly Cluttered Environments [53.41594627336511]
  Passable Obstacles Aware (POA) planner is a novel navigation method for two-wheeled robots in a cluttered environment. Our algorithm allows two-wheeled robots to find a path through passable obstacles.
  arXiv  Detail & Related papers  (2023-07-16T19:44:27Z)
• Efficient Ground Vehicle Path Following in Game AI [77.34726150561087]
  This paper presents an efficient path following solution for ground vehicles tailored to game AI. The proposed path follower is evaluated through a variety of test scenarios in a first-person shooter game. We achieved a 70% decrease in the total number of stuck events compared to an existing path following solution.
  arXiv  Detail & Related papers  (2023-07-07T04:20:07Z)
• Search-Based Task and Motion Planning for Hybrid Systems: Agile Autonomous Vehicles [0.0]
  In vehicle dynamics we need to consider complex dynamics in a predictive manner. Many authors have devised rules to split circuits and employ drifting on some segments. This makes it a class of Task and Motion Planning (TAMP) problems, which are known to be hard to solve optimally in real-time. Here, we present a search-based method that effectively solves this problem and efficiently searches in a highly dimensional state space.
  arXiv  Detail & Related papers  (2023-01-25T02:18:40Z)
• Reducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks [10.698553177585973]
  We propose new learning-based methods for reducing collision checking to accelerate motion planning. We train graph neural networks (GNNs) that perform path exploration and path smoothing. Experimental results show that the learned components can significantly reduce collision checking and improve overall planning efficiency.
  arXiv  Detail & Related papers  (2022-10-17T09:02:04Z)
• Simultaneous Contact-Rich Grasping and Locomotion via Distributed Optimization Enabling Free-Climbing for Multi-Limbed Robots [60.06216976204385]
  We present an efficient motion planning framework for simultaneously solving locomotion, grasping, and contact problems. We demonstrate our proposed framework in the hardware experiments, showing that the multi-limbed robot is able to realize various motions including free-climbing at a slope angle 45deg with a much shorter planning time.
  arXiv  Detail & Related papers  (2022-07-04T13:52:10Z)
• Multi-Agent Path Planning based on MPC and DDPG [14.793341914236166]
  We propose a new algorithm combining Model Predictive Control (MPC) with Deep Deterministic Policy Gradient (DDPG) The DDPG with continuous action space is designed to provide learning and autonomous decision-making capability for robots. We employ Unity 3D to perform simulation experiments in highly uncertain environment such as aircraft carrier decks and squares.
  arXiv  Detail & Related papers  (2021-02-26T02:57:13Z)
• Robust Quadrupedal Locomotion on Sloped Terrains: A Linear Policy Approach [3.752600874088677]
  We use a linear policy for realizing end-foot trajectories in the quadruped robot, Stoch $2$. In particular, the parameters of the end-foot trajectories are shaped via a linear feedback policy that takes the torso orientation and the terrain slope as inputs. The resulting walking is robust to terrain slope variations and external pushes.
  arXiv  Detail & Related papers  (2020-10-30T16:02:08Z)
• AdamP: Slowing Down the Slowdown for Momentum Optimizers on Scale-invariant Weights [53.8489656709356]
  Normalization techniques are a boon for modern deep learning. It is often overlooked, however, that the additional introduction of momentum results in a rapid reduction in effective step sizes for scale-invariant weights. In this paper, we verify that the widely-adopted combination of the two ingredients lead to the premature decay of effective step sizes and sub-optimal model performances.
  arXiv  Detail & Related papers  (2020-06-15T08:35:15Z)
• New Fusion Algorithm provides an alternative approach to Robotic Path planning [0.0]
  This paper presents a new and efficient fusion algorithm for solving the path planning problem in a custom 2D environment. The new fusion algorithm is feasible and superior in smoothness performance and can satisfy as a time-efficient and cheaper alternative to conventional A* strategies of path planning.
  arXiv  Detail & Related papers  (2020-06-06T17:52:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.