Cargando…
Dynamic Obstacle Avoidance Using Bayesian Occupancy Filter and Approximate Inference
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...
Autores principales: | , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Molecular Diversity Preservation International (MDPI)
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3658723/ https://www.ncbi.nlm.nih.gov/pubmed/23529117 http://dx.doi.org/10.3390/s130302929 |
_version_ | 1782270319888695296 |
---|---|
author | Llamazares, Ángel Ivan, Vladimir Molinos, Eduardo Ocaña, Manuel Vijayakumar, Sethu |
author_facet | Llamazares, Ángel Ivan, Vladimir Molinos, Eduardo Ocaña, Manuel Vijayakumar, Sethu |
author_sort | Llamazares, Ángel |
collection | PubMed |
description | 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. |
format | Online Article Text |
id | pubmed-3658723 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2013 |
publisher | Molecular Diversity Preservation International (MDPI) |
record_format | MEDLINE/PubMed |
spelling | pubmed-36587232013-05-30 Dynamic Obstacle Avoidance Using Bayesian Occupancy Filter and Approximate Inference Llamazares, Ángel Ivan, Vladimir Molinos, Eduardo Ocaña, Manuel Vijayakumar, Sethu Sensors (Basel) Article 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. Molecular Diversity Preservation International (MDPI) 2013-03-01 /pmc/articles/PMC3658723/ /pubmed/23529117 http://dx.doi.org/10.3390/s130302929 Text en © 2013 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/). |
spellingShingle | Article Llamazares, Ángel Ivan, Vladimir Molinos, Eduardo Ocaña, Manuel Vijayakumar, Sethu Dynamic Obstacle Avoidance Using Bayesian Occupancy Filter and Approximate Inference |
title | Dynamic Obstacle Avoidance Using Bayesian Occupancy Filter and Approximate Inference |
title_full | Dynamic Obstacle Avoidance Using Bayesian Occupancy Filter and Approximate Inference |
title_fullStr | Dynamic Obstacle Avoidance Using Bayesian Occupancy Filter and Approximate Inference |
title_full_unstemmed | Dynamic Obstacle Avoidance Using Bayesian Occupancy Filter and Approximate Inference |
title_short | Dynamic Obstacle Avoidance Using Bayesian Occupancy Filter and Approximate Inference |
title_sort | dynamic obstacle avoidance using bayesian occupancy filter and approximate inference |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3658723/ https://www.ncbi.nlm.nih.gov/pubmed/23529117 http://dx.doi.org/10.3390/s130302929 |
work_keys_str_mv | AT llamazaresangel dynamicobstacleavoidanceusingbayesianoccupancyfilterandapproximateinference AT ivanvladimir dynamicobstacleavoidanceusingbayesianoccupancyfilterandapproximateinference AT molinoseduardo dynamicobstacleavoidanceusingbayesianoccupancyfilterandapproximateinference AT ocanamanuel dynamicobstacleavoidanceusingbayesianoccupancyfilterandapproximateinference AT vijayakumarsethu dynamicobstacleavoidanceusingbayesianoccupancyfilterandapproximateinference |