Predictive Collision Management for Time and Risk Dependent Path Planning
Carsten Hahn, Sebastian Feld, Hannes Schroter

TL;DR
This paper introduces PCMP, a graph-based path planning algorithm that predicts movements and considers time and risk to improve collision avoidance in autonomous agents, balancing safety and efficiency.
Contribution
The paper presents a novel predictive collision management approach integrating time-dependent graph search with risk sensitivity for better collision avoidance.
Findings
Risk-sensitive agents avoid 47.3% of collisions with minimal detour.
Risk-averse agents avoid 97.3% of collisions with significant detour.
The method effectively balances safety and path efficiency in simulations.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
