Safe and Efficient Path Planning Under Uncertainty via Deep Collision Probability Fields

Estimating collision probabilities between robots and environmental obstacles or other moving agents is crucial to ensure safety during path planning. This is an important building block of modern planning algorithms in many application scenarios such as autonomous driving, where noisy sensors perceive obstacles. While many approaches exist, they either provide too conservative estimates of the collision probabilities or are computationally intensive due to their sampling-based nature. To deal with these issues, we introduce Deep Collision Probability Fields, a neural-based approach for computing collision probabilities of arbitrary objects with arbitrary unimodal uncertainty distributions. Our approach relegates the computationally intensive estimation of collision probabilities via sampling at the training step, allowing for fast neural network inference of the constraints during planning. In extensive experiments, we show that Deep Collision Probability Fields can produce reasonably accurate collision probabilities (up to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$10^{-3}$</tex-math></inline-formula>) for planning and that our approach can be easily plugged into standard path planning approaches to plan safe paths on 2-D maps containing uncertain static and dynamic obstacles.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2024-09-10
DOI
https://doi.org/10.1109/lra.2024.3457208
Citations
3
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.75

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Safe and Efficient Path Planning Under Uncertainty via Deep Collision Probability Fields

Davide Tateo, Felix Herrmann, Jacopo Banfi, Georgia Chalvatzaki et al.
3 citations
IEEE Robotics and Automation Letters
Robotic Path Planning Algorithms
0.75
article

Safe and Efficient Path Planning Under Uncertainty via Deep Collision Probability Fields

Davide Tateo, Felix Herrmann, Jacopo Banfi, Georgia Chalvatzaki, Jan Peters, Sebastian Zach
article en
3 citations

Abstract

Estimating collision probabilities between robots and environmental obstacles or other moving agents is crucial to ensure safety during path planning. This is an important building block of modern planning algorithms in many application scenarios such as autonomous driving, where noisy sensors perceive obstacles. While many approaches exist, they either provide too conservative estimates of the collision probabilities or are computationally intensive due to their sampling-based nature. To deal with these issues, we introduce Deep Collision Probability Fields, a neural-based approach for computing collision probabilities of arbitrary objects with arbitrary unimodal uncertainty distributions. Our approach relegates the computationally intensive estimation of collision probabilities via sampling at the training step, allowing for fast neural network inference of the constraints during planning. In extensive experiments, we show that Deep Collision Probability Fields can produce reasonably accurate collision probabilities (up to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$10^{-3}$</tex-math></inline-formula>) for planning and that our approach can be easily plugged into standard path planning approaches to plan safe paths on 2-D maps containing uncertain static and dynamic obstacles.

IEEE Robotics and Automation LettersVol. 9(11)
Technische Universität Darmstadt (DE), Massachusetts Institute of Technology (US)
Bundesministerium für Bildung und Forschung
Climate action, Sustainable cities and communities
Openalex Percentile: Top 28%
Robotic Path Planning Algorithms
0.75
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Safe and Efficient Path Planning Under Uncertainty via Deep Collision Probability Fields — Davide Tateo, Felix Herrmann, et al. · IEEE Robotics and Automation Letters (2024) | TGRS Research Map | TGRS