Predictive Collision Management for Time and Risk Dependent Path Planning

• URL: http://arxiv.org/abs/2011.13305v1
• Date: Thu, 26 Nov 2020 14:15:54 GMT
• Title: Predictive Collision Management for Time and Risk Dependent Path Planning
• Authors: Carsten Hahn, Sebastian Feld, Hannes Schroter
• Abstract summary: We propose an approach called "Predictive Collision Management Path Planning" (PCMP) PCMP is a graph-based algorithm with a focus on the time dimension consisting of three parts: movement prediction, integration of movement prediction into a time-dependent graph, and time and risk-dependent path planning. We evaluate the evasion behavior in different simulation scenarios and the results show that a risk-sensitive agent can avoid 47.3% of the collision scenarios while making a detour of 1.3%.
• Score: 1.516865739526702
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Autonomous agents such as self-driving cars or parcel robots need to recognize and avoid possible collisions with obstacles in order to move successfully in their environment. Humans, however, have learned to predict movements intuitively and to avoid obstacles in a forward-looking way. The task of collision avoidance can be divided into a global and a local level. Regarding the global level, we propose an approach called "Predictive Collision Management Path Planning" (PCMP). At the local level, solutions for collision avoidance are used that prevent an inevitable collision. Therefore, the aim of PCMP is to avoid unnecessary local collision scenarios using predictive collision management. PCMP is a graph-based algorithm with a focus on the time dimension consisting of three parts: (1) movement prediction, (2) integration of movement prediction into a time-dependent graph, and (3) time and risk-dependent path planning. The algorithm combines the search for a shortest path with the question: is the detour worth avoiding a possible collision scenario? We evaluate the evasion behavior in different simulation scenarios and the results show that a risk-sensitive agent can avoid 47.3% of the collision scenarios while making a detour of 1.3%. A risk-averse agent avoids up to 97.3% of the collision scenarios with a detour of 39.1%. Thus, an agent's evasive behavior can be controlled actively and risk-dependent using PCMP.

Related papers

• Safe and Efficient Path Planning under Uncertainty via Deep Collision Probability Fields [21.741354016294476]
  Estimating collision probabilities is crucial to ensure safety during path planning. Deep Collision Probability Fields is a neural-based approach for computing collision probabilities of arbitrary objects. Our approach relegates the computationally intensive estimation of collision probabilities via sampling at the training step.
  arXiv  Detail & Related papers  (2024-09-06T14:28:41Z)
• Edge-Assisted ML-Aided Uncertainty-Aware Vehicle Collision Avoidance at Urban Intersections [12.812518632907771]
  We present a novel framework that detects preemptively collisions at urban crossroads. We exploit the Multi-access Edge Computing platform of 5G networks.
  arXiv  Detail & Related papers  (2024-04-22T18:45:40Z)
• Language-Conditioned Path Planning [68.13248140217222]
  Language-Conditioned Collision Functions (LACO) learns a collision function using only a single-view image, language prompt, and robot configuration. LACO predicts collisions between the robot and the environment, enabling flexible, conditional path planning without the need for object annotations, point cloud data, or ground-truth object meshes. In both simulation and the real world, we demonstrate that LACO can facilitate complex, nuanced path plans that allow for interaction with objects that are safe to collide, rather than prohibiting any collision.
  arXiv  Detail & Related papers  (2023-08-31T17:56:13Z)
• iPLAN: Intent-Aware Planning in Heterogeneous Traffic via Distributed Multi-Agent Reinforcement Learning [57.24340061741223]
  We introduce a distributed multi-agent reinforcement learning (MARL) algorithm that can predict trajectories and intents in dense and heterogeneous traffic scenarios. Our approach for intent-aware planning, iPLAN, allows agents to infer nearby drivers' intents solely from their local observations.
  arXiv  Detail & Related papers  (2023-06-09T20:12:02Z)
• Traj-MAE: Masked Autoencoders for Trajectory Prediction [69.7885837428344]
  Trajectory prediction has been a crucial task in building a reliable autonomous driving system by anticipating possible dangers. We propose an efficient masked autoencoder for trajectory prediction (Traj-MAE) that better represents the complicated behaviors of agents in the driving environment. Our experimental results in both multi-agent and single-agent settings demonstrate that Traj-MAE achieves competitive results with state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-03-12T16:23:27Z)
• Learned Risk Metric Maps for Kinodynamic Systems [54.49871675894546]
  We present Learned Risk Metric Maps for real-time estimation of coherent risk metrics of high dimensional dynamical systems. LRMM models are simple to design and train, requiring only procedural generation of obstacle sets, state and control sampling, and supervised training of a function approximator.
  arXiv  Detail & Related papers  (2023-02-28T17:51:43Z)
• P4P: Conflict-Aware Motion Prediction for Planning in Autonomous Driving [28.948224519638913]
  We evaluate state-of-the-art predictors through novel conflict-related metrics. We propose a simple but effective alternative that combines a physics-based trajectory generator and a learning-based predictor. Our predictor, P4P, achieves superior performance over existing learning-based predictors in realistic interactive driving scenarios.
  arXiv  Detail & Related papers  (2022-11-03T07:51:40Z)
• Prediction-Based Reachability Analysis for Collision Risk Assessment on Highways [18.18842948832662]
  This paper introduces a prediction-based collision risk assessment approach on highways. We develop an acceleration prediction model, which provides multi-modal probabilistic acceleration distributions to propagate vehicle states. The proposed collision detection approach is agile and effective to identify the collision in cut-in crash events.
  arXiv  Detail & Related papers  (2022-05-03T07:58:02Z)
• Exact and Bounded Collision Probability for Motion Planning under Gaussian Uncertainty [1.3535770763481902]
  We present an approach for computing the collision probability under Gaussian distributed motion. The collision condition is formulated as the distance between ellipsoids. We provide a tight upper bound that can be computed much faster during online planning.
  arXiv  Detail & Related papers  (2021-10-12T20:45:18Z)
• Risk-Sensitive Sequential Action Control with Multi-Modal Human Trajectory Forecasting for Safe Crowd-Robot Interaction [55.569050872780224]
  We present an online framework for safe crowd-robot interaction based on risk-sensitive optimal control, wherein the risk is modeled by the entropic risk measure. Our modular approach decouples the crowd-robot interaction into learning-based prediction and model-based control. A simulation study and a real-world experiment show that the proposed framework can accomplish safe and efficient navigation while avoiding collisions with more than 50 humans in the scene.
  arXiv  Detail & Related papers  (2020-09-12T02:02:52Z)
• Risk-Averse MPC via Visual-Inertial Input and Recurrent Networks for Online Collision Avoidance [95.86944752753564]
  We propose an online path planning architecture that extends the model predictive control (MPC) formulation to consider future location uncertainties. Our algorithm combines an object detection pipeline with a recurrent neural network (RNN) which infers the covariance of state estimates. The robustness of our methods is validated on complex quadruped robot dynamics and can be generally applied to most robotic platforms.
  arXiv  Detail & Related papers  (2020-07-28T07:34:30Z)

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.