Felix Weitbrecht — accepted AI-conference papers

2025

Fast and Stronger Lower Bounds for Planar Euclidean Shortest Paths

Stefan Funke, Daniel Koch, Claudius Proissl, Christian Staib, Felix Weitbrecht

IJCAI 2025

We consider the problem of quickly providing strong lower bounds for the planar Euclidean shortest path (ESP) problem. Such lower bounds are crucial for guiding the search in A* type approaches or for proving quality guarantees for algorithms that compute approximate solutions. Our contributions are

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

Scalable Ultrafast Almost-optimal Euclidean Shortest Paths

Stefan Funke, Daniel Koch, Claudius Proissl, Axel Schneewind, Armin Weiß, Felix Weitbrecht

IJCAI 2024poster

We consider the problem of computing high-quality Euclidean shortest paths amidst obstacles on a large scale. By transferring and adapting speed-up techniques from the road network setting, we are able to compute source target paths for problem instances with several million obstacle vertices within…

Cited by 1 Source ↗PDF ↗Scholar ↗