Parking a car using Bayesian Programming

Abstract

The kinematic constraints on a car limits the movements that it can follow, and this difficulty also makes planning a path a challenging problem. More precisely, the parallel parking problem has been widely addressed in the literature, but these approaches rely on more traditional methods using control laws, motion planners or artificial intelligence. There have been recently much interest in the robotics domain on using probabilistic approaches. In this paper, we propose an original formulation and resolution of the parking problem using Bayesian Robot Programming.