30 documents found

Reliable simulation-based methods are essential for the verification and validation of automated driving. To meet this need, G is introduced – a metric that quantifies the simulation-to-reality gap by comparing outcomes of environment-perception system tests executed in real and simulation-based test…

This thesis is about algorithms that can be used to increase pedestrian safety in a world in which self-driving vehicles are gaining importance. One approach that is central to this thesis is off-board sensors that observe parts of the environment on behalf of vehicles to detect pedestrians. By vehicle-to-infrastructure…

In this paper, we propose a new model to describe vehicle dynamics in full braking situations with collision avoiding motions. By combining the equations of the classic Ackermann-Model with conditions that ensure a stable vehicle movement during simultaneous heavy braking and turning motions, we derive…

Diese Arbeit zeigt, wie Geodaten aus dem freien Projekt OpenStreetMap in mehreren Verarbeitungsschritten umgeformt und aufbereitet werden können, um auf ihrer Basis eine rechenzeiteffiziente Georeferenzierung durchzuführen. Zur Evaluierung wurde das dazu neu entwickelte System mit einem der bereits etablierten…

We discuss the design of Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying distance function is changed. Moreover, we report on some experiences made in using these applets in teaching and research.…

We present a new strategy for searching for a goal in a street. The strategy works in two phases. First it follows an angular bisector, then it uses circular arcs based only on one side of the street. A competitive factor of 1.514 is achieved which is remarkably close to the lower bound of v2. Secondly,…

Let D be a connected region inside a simple polygon, P. We define the angle hull of D, AH(D), to be the set of all points in P that can see two points of D at a right angle. We show that the perimeter of AH(D) cannot exceed in length the perimeter of D by more than a factor of 2. This upper bound is…

We present a strategy for searching for a goal in a street which achieves the competitive factor of √2, matching the previously known lower bound. This finally solves an interesting open problem in the area of competitive path planning many authors have been working on.