Fast Lane-Level Intersection Estimation using Markov Chain Monte Carlo Sampling and B-Spline Refinement

07/14/2020
by   Annika Meyer, et al.
0

Estimating the current scene and understanding the potential maneuvers are essential capabilities of automated vehicles. Most approaches rely heavily on the correctness of maps, but neglect the possibility of outdated information. We present an approach that is able to estimate lanes without relying on any map prior. The estimation is based solely on the trajectories of other traffic participants and is thereby able to incorporate complex environments. In particular, we are able to estimate the scene in the presence of heavy traffic and occlusions. The algorithm first estimates a coarse lane-level intersection model by Markov chain Monte Carlo sampling and refines it later by aligning the lane course with the measurements using a non-linear least squares formulation. We model the lanes as 1D cubic B-splines and can achieve error rates of less than 10cm within real-time.

READ FULL TEXT

page 1

page 6

research
06/06/2019

Anytime Lane-Level Intersection Estimation Based on Trajectories

Estimating and understanding the current scene is an inevitable capabili...
research
06/04/2021

Estimating parking occupancy using smart meter transaction data

The excessive search for parking, known as cruising, generates pollution...
research
04/11/2020

Construction and Random Generation of Hypergraphs with Prescribed Degree and Dimension Sequences

We propose algorithms for construction and random generation of hypergra...
research
05/05/2007

MIMO detection employing Markov Chain Monte Carlo

We propose a soft-output detection scheme for Multiple-Input-Multiple-Ou...
research
04/08/2018

Accelerating MCMC Algorithms

Markov chain Monte Carlo algorithms are used to simulate from complex st...
research
02/27/2021

Time-Varying Coefficient Model Estimation Through Radial Basis Functions

In this paper we estimate the dynamic parameters of a time-varying coeff...
research
07/28/2021

Recursive Estimation of a Failure Probability for a Lipschitz Function

Let g : Ω = [0, 1] d → R denote a Lipschitz function that can be evaluat...

Please sign up or login with your details

Forgot password? Click here to reset