Fast-reactive probabilistic motion planning for high-dimensional robots

• URL: http://arxiv.org/abs/2012.02118v1
• Date: Thu, 3 Dec 2020 17:51:07 GMT
• Title: Fast-reactive probabilistic motion planning for high-dimensional robots
• Authors: Siyu Dai, Andreas Hofmann and Brian C. Williams
• Abstract summary: p-Chekov is a fast-reactive motion planning system that can provide safety guarantees for high-dimensional robots suffering from process noises and observation noises. Comprehensive theoretical and empirical analysis shows that p-Chekov can effectively satisfy user-specified chance constraints over collision risk in practical robotic manipulation tasks.
• Score: 15.082715993594121
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many real-world robotic operations that involve high-dimensional humanoid robots require fast-reaction to plan disturbances and probabilistic guarantees over collision risks, whereas most probabilistic motion planning approaches developed for car-like robots can not be directly applied to high-dimensional robots. In this paper, we present probabilistic Chekov (p-Chekov), a fast-reactive motion planning system that can provide safety guarantees for high-dimensional robots suffering from process noises and observation noises. Leveraging recent advances in machine learning as well as our previous work in deterministic motion planning that integrated trajectory optimization into a sparse roadmap framework, p-Chekov demonstrates its superiority in terms of collision avoidance ability and planning speed in high-dimensional robotic motion planning tasks in complex environments without the convexification of obstacles. Comprehensive theoretical and empirical analysis provided in this paper shows that p-Chekov can effectively satisfy user-specified chance constraints over collision risk in practical robotic manipulation tasks.

Related papers

• Simultaneous Multi-Robot Motion Planning with Projected Diffusion Models [57.45019514036948]
  Simultaneous MRMP Diffusion (SMD) is a novel approach integrating constrained optimization into the diffusion sampling process to produce kinematically feasible trajectories. The paper introduces a comprehensive MRMP benchmark to evaluate trajectory planning algorithms across scenarios with varying robot densities, obstacle complexities, and motion constraints.
  arXiv  Detail & Related papers  (2025-02-05T20:51:28Z)
• Robotic World Model: A Neural Network Simulator for Robust Policy Optimization in Robotics [50.191655141020505]
  We introduce a novel framework for learning world models. By providing a scalable and robust framework, we pave the way for adaptive and efficient robotic systems in real-world applications.
  arXiv  Detail & Related papers  (2025-01-17T10:39:09Z)
• Monte Carlo Tree Search with Velocity Obstacles for safe and efficient motion planning in dynamic environments [49.30744329170107]
  We propose a novel approach for optimal online motion planning with minimal information about dynamic obstacles. The proposed methodology combines Monte Carlo Tree Search (MCTS), for online optimal planning via model simulations, with Velocity Obstacles (VO), for obstacle avoidance. We show the superiority of our methodology with respect to state-of-the-art planners, including Non-linear Model Predictive Control (NMPC), in terms of improved collision rate, computational and task performance.
  arXiv  Detail & Related papers  (2025-01-16T16:45:08Z)
• Exploring the Adversarial Vulnerabilities of Vision-Language-Action Models in Robotics [70.93622520400385]
  This paper systematically quantifies the robustness of VLA-based robotic systems. We introduce an untargeted position-aware attack objective that leverages spatial foundations to destabilize robotic actions. We also design an adversarial patch generation approach that places a small, colorful patch within the camera's view, effectively executing the attack in both digital and physical environments.
  arXiv  Detail & Related papers  (2024-11-18T01:52:20Z)
• Bridging the gap between Learning-to-plan, Motion Primitives and Safe Reinforcement Learning [20.158498233576143]
  Trajectory planning under kinodynamic constraints is fundamental for advanced robotics applications. Recent advances in kinodynamic planning demonstrate that learning-to-plan techniques can generate complex motions under intricate constraints. This paper addresses this limitation by combining learning-to-plan methods with reinforcement learning, resulting in a novel integration of black-box learning of motion primitives and optimization.
  arXiv  Detail & Related papers  (2024-08-26T07:44:53Z)
• Potential Based Diffusion Motion Planning [73.593988351275]
  We propose a new approach towards learning potential based motion planning. We train a neural network to capture and learn an easily optimizable potentials over motion planning trajectories. We demonstrate its inherent composability, enabling us to generalize to a multitude of different motion constraints.
  arXiv  Detail & Related papers  (2024-07-08T17:48:39Z)
• A GP-based Robust Motion Planning Framework for Agile Autonomous Robot Navigation and Recovery in Unknown Environments [6.859965454961918]
  We propose a model for proactively detecting the risk of future motion planning failure. When the risk exceeds a certain threshold, a recovery behavior is triggered. Our framework is capable of both predicting planner failures and recovering the robot to states where planner success is likely.
  arXiv  Detail & Related papers  (2024-02-02T18:27:21Z)
• SHARP: Shielding-Aware Robust Planning for Safe and Efficient Human-Robot Interaction [5.804727815849655]
  " Shielding" control scheme overrides the robot's nominal plan with a safety fallback strategy when a safety-critical event is imminent. We propose a new shielding-based planning approach that allows the robot to plan efficiently by explicitly accounting for possible future shielding events.
  arXiv  Detail & Related papers  (2021-10-02T17:01:59Z)
• SABER: Data-Driven Motion Planner for Autonomously Navigating Heterogeneous Robots [112.2491765424719]
  We present an end-to-end online motion planning framework that uses a data-driven approach to navigate a heterogeneous robot team towards a global goal. We use model predictive control (SMPC) to calculate control inputs that satisfy robot dynamics, and consider uncertainty during obstacle avoidance with chance constraints. recurrent neural networks are used to provide a quick estimate of future state uncertainty considered in the SMPC finite-time horizon solution. A Deep Q-learning agent is employed to serve as a high-level path planner, providing the SMPC with target positions that move the robots towards a desired global goal.
  arXiv  Detail & Related papers  (2021-08-03T02:56:21Z)
• An advantage actor-critic algorithm for robotic motion planning in dense and dynamic scenarios [0.8594140167290099]
  In this paper, we modify existing advantage actor-critic algorithm and suit it to complex motion planning. It achieves higher success rate in motion planning with lesser processing time for robot to reach its goal.
  arXiv  Detail & Related papers  (2021-02-05T12:30:23Z)
• Predicting Sample Collision with Neural Networks [5.713670854553366]
  We present a framework to address the cost of expensive primitive operations in sampling-based motion planning. We evaluate our framework on multiple planning problems with a variety of robots in 2D and 3D workspaces.
  arXiv  Detail & Related papers  (2020-06-30T14:56:14Z)

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.