Dynamic obstacle avoidance using Bayesian occupancy filter and approximate inference

18Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

Abstract

The goal of this paper is to solve the problem of dynamic obstacle avoidance for a mobile platform by using the stochastic optimal control framework to compute paths that are optimal in terms of safety and energy efficiency under constraints. We propose a three-dimensional extension of the Bayesian Occupancy Filter (BOF) (Coué et al. Int. J. Rob. Res. 2006, 25, 19-30) to deal with the noise in the sensor data, improving the perception stage. We reduce the computational cost of the perception stage by estimating the velocity of each obstacle using optical flow tracking and blob filtering. While several obstacle avoidance systems have been presented in the literature addressing safety and optimality of the robot motion separately, we have applied the approximate inference framework to this problem to combine multiple goals, constraints and priors in a structured way. It is important to remark that the problem involves obstacles that can be moving, therefore classical techniques based on reactive control are not optimal from the point of view of energy consumption. Some experimental results, including comparisons against classical algorithms that highlight the advantages are presented. © 2013 by the authors; licensee MDPI, Basel, Switzerland.

Cite

CITATION STYLE

APA

Llamazares, Á., Ivan, V., Molinos, E., Ocaña, M., & Vijayakumar, S. (2013). Dynamic obstacle avoidance using Bayesian occupancy filter and approximate inference. Sensors (Switzerland), 13(3), 2929–2944. https://doi.org/10.3390/s130302929

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free