Repository logoOPUS - Online Publications of University Stuttgart
de / en
Log In
New user? Click here to register.Have you forgotten your password?
Communities & Collections
All of DSpace
  1. Home
  2. Browse by Author

Browsing by Author "Weitbrecht, Felix"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Results Per Page
  • Sort Options
  • Thumbnail Image
    ItemOpen Access
    Monte Carlo localization in dynamic environments based on an automotive Lidar sensor cocoon
    (2017) Weitbrecht, Felix
    Autonomous driving and driver assistance systems require accurate information about the vehicle and its surroundings to perform tasks such as robust path planning. An occupancy grid map can provide such information, but it too requires precise information about the vehicle’s location. We present an approach to Monte Carlo Localization on an occupancy grid map based on an automotive lidar sensor cocoon providing 360° measurements around the vehicle using five Valeo SCALA sensors. Standard MCL is enhanced through an alternative particle weighting function and separate alpha filters are used to incorporate odometry measurements. Additionally, scan point sampling is introduced into the particle weighting function to select scan points most representative of pose estimation quality. Compared to paths reconstructed from only the vehicle’s odometry signals, the mean squared error in heading angle and position is reduced by 93-97% and 86-96%, respectively. Investigated scenarios include urban roads, factory roads, elevated country roads and highways.
  • Thumbnail Image
    ItemOpen Access
    On the number of Delaunay Triangles occurring in all contiguous subsequences
    (2020) Weitbrecht, Felix
    Given an ordered sequence of points P = {p1, p2, ..., pn}, we consider all contiguous subsequences Pi,j := {pi, ..., pj} of P and the set T of distinct Delaunay triangles within their Delaunay triangulations. For arbitrary point sets and orderings, we give an O(n^2) bound on |T|. Furthermore, for arbitrary point sets in uniformly random order, we give two proofs of a Θ(n log n) bound on E[|T|].
OPUS
  • About OPUS
  • Publish with OPUS
  • Legal information
DSpace
  • Cookie settings
  • Privacy policy
  • Send Feedback
University Stuttgart
  • University Stuttgart
  • University Library Stuttgart