Search

Your search keyword '"Emmanuel Mazer"' showing total 24 results
Start Over Author "Emmanuel Mazer" Topic 020201 artificial intelligence & image processing
24 results on '"Emmanuel Mazer"'

1. Cognitive Computation

Author

Raphaël Laurent, Mohamad Othman Abdallah, Jorge Lobo, Emmanuel Mazer, Marvin Faix, and Ronan Le Hy

Subjects
Computer science, business.industry, Computation, Cognition, 02 engineering and technology, Machine learning, computer.software_genre, Bayesian inference, 020202 computer hardware & architecture, Bayesian statistics, Relevance vector machine, Frequentist inference, 0202 electrical engineering, electronic engineering, information engineering, Fiducial inference, 020201 artificial intelligence & image processing, Artificial intelligence, business, computer
Abstract

Probabilistic programming allows artificial systems to better operate with uncertainty, and stochastic arithmetic provides a way to carry out approximate computations with few resources. As such, both are plausible models for natural cognition. The authors' work on the automatic design of probabilistic machines computing soft inferences, with an arithmetic based on stochastic bitstreams, allowed to develop the following compilation toolchain: given a high-level description of some general problem, formalized as a Bayesian Program, the toolchain automatically builds a low-level description of an electronic circuit computing the corresponding probabilistic inference. This circuit can then be implemented and tested on reconfigurable logic. This paper describes two circuits as validating examples. The first one implements a Bayesian filter solving the problem of Pseudo Noise sequence acquisition in telecommunications. The second one implements decision making in a sensorimotor system: it allows a simple robot to avoid obstacles using Bayesian sensor fusion.

Published
2017
Full Text
View/download PDF

2. Cognitive Computation

Author

Marvin Faix, Emmanuel Mazer, Raphaël Laurent, Mohamad Othman Abdallah, Ronan Le Hy, and Jorge Lobo

Subjects
0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 02 engineering and technology, 020202 computer hardware & architecture
Abstract

Probabilistic programming allows artificial systems to better operate with uncertainty, and stochastic arithmetic provides a way to carry out approximate computations with few resources. As such, both are plausible models for natural cognition. The authors' work on the automatic design of probabilistic machines computing soft inferences, with an arithmetic based on stochastic bitstreams, allowed to develop the following compilation toolchain: given a high-level description of some general problem, formalized as a Bayesian Program, the toolchain automatically builds a low-level description of an electronic circuit computing the corresponding probabilistic inference. This circuit can then be implemented and tested on reconfigurable logic. This paper describes two circuits as validating examples. The first one implements a Bayesian filter solving the problem of Pseudo Noise sequence acquisition in telecommunications. The second one implements decision making in a sensorimotor system: it allows a simple robot to avoid obstacles using Bayesian sensor fusion.

Published
2020
Full Text
View/download PDF

3. Bayesian time-domain multiple sound source localization for a stochastic machine

Author

Emmanuel Mazer, Laurent Girin, Marvin Faix, Raphael Frisch, Jacques Droulez, Techniques of Informatics and Microelectronics for integrated systems Architecture (TIMA), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Interaction située avec les objets et environnements intelligents (PERVASIVE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Institut des Systèmes Intelligents et de Robotique (ISIR), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), CRISSP (GIPSA-CRISSP), Département Parole et Cognition (GIPSA-DPC), Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-GIPSA Pôle Parole et Cognition (GIPSA-PPC), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Techniques de l'Informatique et de la Microélectronique pour l'Architecture des systèmes intégrés (TIMA), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), GIPSA - Cognitive Robotics, Interactive Systems, & Speech Processing (GIPSA-CRISSP), Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Grenoble Images Parole Signal Automatique (GIPSA-lab ), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])

Subjects
[INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], Signal processing, Computer science, Bayesian probability, 020206 networking & telecommunications, Statistical model, specific hardware, 02 engineering and technology, Acoustic source localization, Bayesian stochastic machine, time-domain processing, Bayesian inference, Robustness (computer science), [INFO.INFO-SD]Computer Science [cs]/Sound [cs.SD], 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Multiple sound source localization, Time domain, Algorithm, ComputingMilieux_MISCELLANEOUS
Abstract

We propose a time-domain multiple sound source localization (SSL) method based on Bayesian inference. This method is specifically designed to run on the stochastic machines (SM) that we are currently developing to perform efficient low-level sensor signal processing with ultra-low power consumption. The proposed SSL method is divided into two main parts. First, a probabilistic model is run on 50 very short time frames (3. 75ms each) of multichannel recorded signals. Second, the results obtained on the different frames are fused to obtain a final localization map. Using the system in a supervised way allows to extract estimated source locations by selecting as many maxima as there are sources in the room. We explain how this method is implemented on a SM. Experiments are presented to illustrate the performance and robustness of the resulting system.

Published
2019
Full Text
View/download PDF

4. A cognitive stochastic machine based on Bayesian inference: a behavioral analysis

Author

Marvin Faix, Laurent Fesquet, Augustin Lux, Raphael Frisch, Emmanuel Mazer, Techniques de l'Informatique et de la Microélectronique pour l'Architecture des systèmes intégrés (TIMA), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Interaction située avec les objets et environnements intelligents (PERVASIVE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), ANR-11-LABX-0025,PERSYVAL-lab,Systemes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011), Techniques of Informatics and Microelectronics for integrated systems Architecture (TIMA), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), and ANR-11-LABX-0025-01,PERSYVAL-lab,Systèmes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011)

Subjects
Optimal design, [INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], Stochastic computing, Computer science, Stochastic process, Computation, Bayesian probability, Probabilistic logic, 02 engineering and technology, Sensor fusion, Bayesian inference, 030507 speech-language pathology & audiology, 03 medical and health sciences, [INFO.INFO-SD]Computer Science [cs]/Sound [cs.SD], 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 0305 other medical science, Algorithm
Abstract

International audience; Bayesian models and stochastic computing form a promising paradigm for non-conventional, bio-inspired computation architectures. In particular, they are able to handle uncertainty and promise low power consumption. In this paper we study the application of such an architecture, the Sliced Bayesian Machine (SlicedBM) to a real-world problem, Sound Source Localization (SSL) for robots. We present an analysis of the quality of results and of computing time according to several parameters: sensor precision, result threshold, internal word length. Furthermore, we show that sensor data precision does not heavily influence the computation. On the opposite, the precision of the probability values plays an important role on result quality. This parameter also determines the circuit size. We also show that the higher the re-sampling threshold (RT), the better the distribution computed by the machine. Our results make it possible to choose optimal design parameters for a circuit along several trade-offs, and according to a given sensor fusion application.

Published
2018

5. A Bayesian stochastic machine for sound source localization

Author

Laurent Girin, Raphaël Laurent, Pierre Bessière, Laurent Fesquet, Raphael Frisch, Emmanuel Mazer, Augustin Lux, Jacques Droulez, Marvin Faix, Techniques de l'Informatique et de la Microélectronique pour l'Architecture des systèmes intégrés (TIMA), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Interaction située avec les objets et environnements intelligents (PERVASIVE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Probayes [Montbonnot], GIPSA - Cognitive Robotics, Interactive Systems, & Speech Processing (GIPSA-CRISSP), Département Parole et Cognition (GIPSA-DPC), Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Interpretation and Modelling of Images and Videos (PERCEPTION ), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Institut des Systèmes Intelligents et de Robotique (ISIR), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), ANR-11-LABX-0025,PERSYVAL-lab,Systemes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011), Techniques of Informatics and Microelectronics for integrated systems Architecture (TIMA), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), CRISSP (GIPSA-CRISSP), Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-GIPSA Pôle Parole et Cognition (GIPSA-PPC), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Interpretation and Modelling of Images and Videos (PERCEPTION), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut National Polytechnique de Grenoble (INPG), and ANR-11-LABX-0025-01,PERSYVAL-lab,Systèmes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011)

Subjects
[INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], Stochastic computing, Computer science, Stochastic process, Posterior probability, Bayesian probability, 02 engineering and technology, Acoustic source localization, Bayesian inference, 030507 speech-language pathology & audiology, 03 medical and health sciences, [INFO.INFO-SD]Computer Science [cs]/Sound [cs.SD], 0202 electrical engineering, electronic engineering, information engineering, Probability distribution, 020201 artificial intelligence & image processing, 0305 other medical science, Likelihood function, Algorithm
Abstract

International audience; Compared to conventional processors, stochastic computing architectures have strong potential to speed up computation time and to reduce power consumption. We present such an architecture, called Bayesian Machine (BM), dedicated to solving Bayesian inference problems. Given a set of noisy signals provided by low-level sensors, a BM estimates the posterior probability distribution of an unknown target information. In the present study, a BM is used to solve a sound source localization (SSL) problem: the BM computes the probability distribution of the position of a sound source given acoustic signals captured by a set of microphones. Assuming free field wave propagation (no reverberations), we express the SSL problem as the maximization of a likelihood function fed with audio features provided by the time-frequency (TF) analysis of the captured audio waves. The proposed BM uses bitwise parallel sampling to fuse the resulting multi-channel information. As the number of channels to fuse is large, the standard BM architecture encounters the so-called " time dilution problem " (long delays are necessary to obtain valid samples). We tackle this problem by using max-normalization of the distributions combined with a periodic re-sampling of the bit streams after processing a reasonably small subset of evidences. Finally, we compare the localization performance of the proposed machine with the results obtained using a standard version of the machine. The re-sampling leads to an impressive acceleration factor of 10³ in the computation.

Published
2017

6. Exact and approximate inference in ProBT

Author

Linda Smail, Pierre Bessière, Juan-Manuel Ahuactzin, Emmanuel Mazer, Kamel Mekhnacha, Geometry and Probability for Motion and Action (E-MOTION), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)

Subjects
[SCCO.COMP]Cognitive science/Computer science, Inference, 02 engineering and technology, Machine learning, computer.software_genre, 01 natural sciences, Artificial Intelligence, Frequentist inference, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Point estimation, Inference engine, Rule of inference, ComputingMilieux_MISCELLANEOUS, Mathematics, 010308 nuclear & particles physics, business.industry, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], Bayesian statistics, Approximate inference, Fiducial inference, 020201 artificial intelligence & image processing, Artificial intelligence, business, Algorithm, computer, Software
Abstract

We present a unifying framework for exact and approximate inference in Bayesian networks. This framework is used in "ProBT", a general purpose inference engine for probabilistic reasoning and incremental model construction. This paper is not intended to present ProB T but to describe its underlying algorithms mainly the "Successive Restrictions Algorithm " (SRA) for exact inference, and the "Monte Carlo Simultaneous Estimation and Maximization" (MCSEM) algorithm for approximate inference problems. The main idea of ProBT is to use "probability expressions " that can be "exact" or "approximate" as basic bricks to build more complex models incrementally.

Published
2007
Full Text
View/download PDF

7. The design and implementation of a Bayesian CAD modeler for robotic applications

Author

Pierre Bessière, Kamel Mekhnacha, Emmanuel Mazer, Laboratoire Leibniz (Leibniz - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Automatic Programming and Decisional Systems in Robotics (SHARP), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
0209 industrial biotechnology, Mathematical optimization, geometric constraints, Computer science, Generalization, Monte Carlo method, Bayesian probability, Bayesian reasoning, [SCCO.COMP]Cognitive science/Computer science, CAD, 02 engineering and technology, Bayesian inference, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 020901 industrial engineering & automation, 0202 electrical engineering, electronic engineering, information engineering, business.industry, Monte Carlo methods, Robotics, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Computer Science Applications, Human-Computer Interaction, Constraint (information theory), Hardware and Architecture, Control and Systems Engineering, Probability distribution, 020201 artificial intelligence & image processing, Artificial intelligence, business, Software
Abstract

International audience; We present a Bayesian CAD modeler for robotic applications. We address the problem of taking into account the propagation of geometric uncertainties when solving inverse geometric problems. The proposed method may be seen as a generalization of constraint-based approaches in which we explicitly model geometric uncertainties. Using our methodology, a geometric constraint is expressed as a probability distribution on the system parameters and the sensor measurements, instead of a simple equality or inequality. To solve geometric problems in this framework, we propose an original resolution method able to adapt to problem complexity. Using two examples, we show how to apply our approach by providing simulation results using our modeler.

Published
2001
Full Text
View/download PDF

8. Manipulation Planning for Redundant Robots: A Practical Approach

Author

Kamal Gupta, Emmanuel Mazer, and Juan-Manuel Ahuactzin

Subjects
0209 industrial biotechnology, Applied Mathematics, Mechanical Engineering, Degrees of freedom, Motion (geometry), 02 engineering and technology, Set (abstract data type), 020901 industrial engineering & automation, Artificial Intelligence, Control theory, Modeling and Simulation, 0202 electrical engineering, electronic engineering, information engineering, Robot, 020201 artificial intelligence & image processing, Configuration space, Electrical and Electronic Engineering, Software, Mathematics
Abstract

An emerging paradigm in solving the classical motion- planning problem (among static obstacles) is to capture the connectivity of the configuration space using a finite (but pos sibly large) set of landmarks (or nodes) in it. In this paper, we extend this paradigm to manipulation-planning problem, where the goal is to plan the motion of a robot so that it can move a given object from an initial configuration to a final configuration while avoiding collisions with the static obstacles and other movable objects in the environment. Our specific approach adapts Adriadne's clew algorithm, which has been shown effective for classical motion-planning prob lems (Mazer et al. 1994; Ahuactzin 1994). In our approach, landmarks are placed in lower dimensional submanifolds of the composite configuration space. These landmarks repre sent stable grasps that are reachable from the initial con figuration. From each new landmark, the planner attempts to reach the goal configuration by executing a local plan ner, again in a lower (but different) dimensional submani fold of the composite configuration space. The approach is probabilistically resolution complete, does not assume that a closed-form inverse-kinematics solution for the manipulator is available, and is particularly suitable for redundant manip ulators. We also demonstrate that our approach is practical for realistic problems in three-dimensional environments with manipulator arms having fairly large numbers of degrees of freedom. We have experimented with this approach for a 7- DOF manipulator in 3-D environments with one movable ob ject, and computation times range between a few minutes and a few tens of minutes-in our experiments, between 3 min to 15 min, depending on the task difficulty.

Published
1998
Full Text
View/download PDF

9. Bayesian Programming

Author

Pierre Bessière, Emmanuel Mazer, Juan Manuel Ahuactzin-Larios, Kamel Mekhnacha, Geometry and Probability for Motion and Action (E-MOTION), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Physiologie de la Perception et de l'Action (LPPA), Collège de France (CdF (institution))-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), Institut d'Informatique et de Mathématiques Appliquées de Grenoble (IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Probayes [Montbonnot], Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Grenoble (INPG)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Grenoble (INPG)-Inria Grenoble - Rhône-Alpes, Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], 03 medical and health sciences, 0302 clinical medicine, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], 0202 electrical engineering, electronic engineering, information engineering, [SCCO.COMP]Cognitive science/Computer science, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], 020201 artificial intelligence & image processing, 02 engineering and technology, 030217 neurology & neurosurgery, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

International audience; Features Presents a new modeling methodology and inference algorithms for Bayesian programming Explains how to build efficient Bayesian models Addresses controversies, historical notes, epistemological debates, and tricky technical questions in a dedicated chapter separate from the main text Encourages further research on new programming languages and specialized hardware for computing large-scale Bayesian inference problems Offers an online Python package for running and modifying the Python program examples in the book Summary Probability as an Alternative to Boolean Logic While logic is the mathematical foundation of rational reasoning and the fundamental principle of computing, it is restricted to problems where information is both complete and certain. However, many real-world problems, from financial investments to email filtering, are incomplete or uncertain in nature. Probability theory and Bayesian computing together provide an alternative framework to deal with incomplete and uncertain data. Decision-Making Tools and Methods for Incomplete and Uncertain Data Emphasizing probability as an alternative to Boolean logic, Bayesian Programming covers new methods to build probabilistic programs for real-world applications. Written by the team who designed and implemented an efficient probabilistic inference engine to interpret Bayesian programs, the book offers many Python examples that are also available on a supplementary website together with an interpreter that allows readers to experiment with this new approach to programming. Principles and Modeling Only requiring a basic foundation in mathematics, the first two parts of the book present a new methodology for building subjective probabilistic models. The authors introduce the principles of Bayesian programming and discuss good practices for probabilistic modeling. Numerous simple examples highlight the application of Bayesian modeling in different fields. Formalism and Algorithms The third part synthesizes existing work on Bayesian inference algorithms since an efficient Bayesian inference engine is needed to automate the probabilistic calculus in Bayesian programs. Many bibliographic references are included for readers who would like more details on the formalism of Bayesian programming, the main probabilistic models, general purpose algorithms for Bayesian inference, and learning problems. FAQs Along with a glossary, the fourth part contains answers to frequently asked questions. The authors compare Bayesian programming and possibility theories, discuss the computational complexity of Bayesian inference, cover the irreducibility of incompleteness, and address the subjectivist versus objectivist epistemology of probability. The First Steps toward a Bayesian Computer A new modeling methodology, new inference algorithms, new programming languages, and new hardware are all needed to create a complete Bayesian computing framework. Focusing on the methodology and algorithms, this book describes the first steps toward reaching that goal. It encourages readers to explore emerging areas, such as bio-inspired computing, and develop new programming languages and hardware architectures.

Published
2013

10. Corruption risk analysis using semi-supervised naïve Bayes classifiers

Author

Remis Balaniuk, Pierre Bessière, Emmanuel Mazer, Paulo Roberto Cobbe, Mestrado em Gestão do Conhecimento e da Tecnologia da Informação (UCB/MGCTI), Universidade Católica de Brasília=Catholic University of Brasília (UCB), Laboratoire de Physiologie de la Perception et de l'Action (LPPA), Collège de France (CdF (institution))-Centre National de la Recherche Scientifique (CNRS), Geometry and Probability for Motion and Action (E-MOTION), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Universidade Católica de Brasília, and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)

Subjects
Risk analysis, Government, Actuarial science, General Computer Science, Corruption, Computer science, media_common.quotation_subject, General Engineering, Probabilistic logic, [SCCO.COMP]Cognitive science/Computer science, ComputingMilieux_LEGALASPECTSOFCOMPUTING, 02 engineering and technology, Audit, 16. Peace & justice, Computer security, computer.software_genre, Naive Bayes classifier, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Risk assessment, computer, media_common
Abstract

International audience; In this paper, we consider the application of a naïve Bayes model for the evaluation of corruption risk associated with government agencies. This model applies probabilistic classifiers to support a generic risk assessment model, allowing for more efficient and effective use of resources for the detection of corruption in government transactions, and assisting audit agencies in becoming more proactive regarding corruption detection and prevention.

Published
2013
Full Text
View/download PDF

11. The Ariadne's Clew Algorithm

Author

Juan-Manuel Ahuactzin, Pierre Bessière, Emmanuel Mazer, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA), Institut National Polytechnique de Grenoble (INPG), Automatic Programming and Decisional Systems in Robotics (SHARP), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Grenoble (INPG)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Grenoble (INPG)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), Institut d'Informatique et de Mathématiques Appliquées de Grenoble (IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Leibniz (Leibniz - IMAG), Laboratoire de Génie Informatique (LGI - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-IMAG, Laboratoire de Génie Informatique - LAboratoire de SCiences COgnitives (IMAG-LGI / LASCO3), IMAG, Bessiere, Pierre, Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, Université Joseph Fourier - Grenoble 1 (UJF)-IMAG-Centre National de la Recherche Scientifique (CNRS), Departamento de Ingeniería En Sistemas Computacionales, Universidad de las Américas, and Laugier, Christian

Subjects
[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, 0209 industrial biotechnology, Optimization problem, Computer science, Computer Science - Artificial Intelligence, [SCCO.COMP]Cognitive science/Computer science, 02 engineering and technology, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 020901 industrial engineering & automation, Artificial Intelligence, [SCCO.COMP] Cognitive science/Computer science, 0202 electrical engineering, electronic engineering, information engineering, Six degrees of freedom, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], Motion planning, Representation (mathematics), ComputingMilieux_MISCELLANEOUS, Degrees of freedom, [INFO.INFO-RB] Computer Science [cs]/Robotics [cs.RO], Artificial Intelligence (cs.AI), Obstacle, Path (graph theory), Robot, 020201 artificial intelligence & image processing, Algorithm
Abstract

http://www.jair.org/papers/paper468.html; International audience; We present a new approach to path planning, called the Ariadne's clew algorithm. It is designed to find paths in high-dimensional continuous spaces and applies to robots with many degrees of freedom in static, as well as dynamic environments --- ones where obstacles may move. The Ariadne's clew algorithm comprises two sub-algorithms, called SEARCH and EXPLORE, applied in an interleaved manner. EXPLORE builds a representation of the accessible space while SEARCH looks for the target. Both are posed as optimization problems. We describe a real implementation of the algorithm to plan paths for a six degrees of freedom arm in a dynamic environment where another six degrees of freedom arm is used as a moving obstacle. Experimental results show that a path is found in about one second without any pre-processing.

Published
2011
Full Text
View/download PDF

12. Bayesian Approach to Action Selection and Attention Focusing

Author

Emmanuel Mazer, Pierre Bessière, Carla Koike, Geometry and Probability for Motion and Action (E-MOTION), Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), and Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)

Subjects
0209 industrial biotechnology, Computer science, business.industry, Bayesian probability, [SCCO.COMP]Cognitive science/Computer science, Mobile robot, 02 engineering and technology, Machine learning, computer.software_genre, Action selection, Motor model, 020901 industrial engineering & automation, Joint probability distribution, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], 020201 artificial intelligence & image processing, Artificial intelligence, business, computer
Published
2008
Full Text
View/download PDF

13. Merging probabilistic models of navigation: the Bayesian Map and the Superposition operator

Author

Pierre Bessière, Julien Diard, Emmanuel Mazer, Geometry and Probability for Motion and Action (E-MOTION), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Superposition operator, 0209 industrial biotechnology, Computer science, business.industry, Bayesian probability, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Probabilistic logic, Mobile robot, 02 engineering and technology, Machine learning, computer.software_genre, Mobile robot navigation, Formalism (philosophy of mathematics), 020901 industrial engineering & automation, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Artificial intelligence, business, Algorithm, computer
Abstract

voir basilic : http://emotion.inrialpes.fr/bibemotion/2005/DBM05/; International audience; This paper deals with the probabilistic modeling of space, in the context of mobile robot navigation. We define a formalism called the Bayesian Map, which allows incremental building of models, thanks to the Superposition operator, which is a formally well-defined operator. Firstly, we present a syntactic version of this operator, and secondly, a version where the previously obtained model is enriched by experimental learning. In the resulting map, locations are the conjunction of underlying possible locations, which allows for more precise localization and more complex tasks. A theoretical example validates the concept, and hints at its usefulness for realistic robotic scenarios.

Published
2005

14. Hierarchies of probabilistic models of navigation: the Bayesian Map and the Abstraction operator

Author

Julien Diard, Emmanuel Mazer, Pierre Bessière, Geometry and Probability for Motion and Action (E-MOTION), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
0209 industrial biotechnology, Hierarchy, business.industry, Computer science, Divergence-from-randomness model, Bayesian probability, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Probabilistic logic, Statistical model, 02 engineering and technology, 020901 industrial engineering & automation, Probabilistic CTL, 0202 electrical engineering, electronic engineering, information engineering, Probability distribution, 020201 artificial intelligence & image processing, Bayesian programming, Artificial intelligence, business, Probabilistic relevance model
Abstract

voir basilic : http://emotion.inrialpes.fr/bibemotion/2004/DBM04/ address: New Orleans, LA (US); This paper presents a new method for probabilistic modeling of space, called the Bayesian Map formalism. It offers a generalization of some common approaches found in the literature, as it does not constrain the dependency structure of the probabilistic model. The formalism allows incremental building of hierarchies of models, by the use of the Abstraction operator. In the resulting hierarchy, localization in the high level model is based on probabilistic competition of the lower level models. Experimental results validate the concept, and hint at its usefulness for large scale scenarios.

Published
2004

15. A theoretical comparison of probabilistic and biomimetic models of mobile robot navigation

Author

Pierre Bessière, Julien Diard, Emmanuel Mazer, Geometry and Probability for Motion and Action (E-MOTION), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
0209 industrial biotechnology, Engineering, business.industry, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Probabilistic logic, Inference, Mobile robot, 02 engineering and technology, Bayesian inference, Mobile robot navigation, Computer Science::Robotics, 020901 industrial engineering & automation, Probabilistic method, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Bayesian programming, Artificial intelligence, Motion planning, business
Abstract

voir basilic : http://emotion.inrialpes.fr/bibemotion/2004/DBM04a/ address: New Orleans, LA (US); This paper deals with the domain of space modeling for mobile robotics. It offers a comparison of probabilistic and biomimetic models of navigation. Both approaches are shown to be quite complementary: while the probabilistic methods exploit sound theoretical grounds, they lack the modularity and, as a consequence, flexibility, of their biomimetic counterparts. We propose a new formalism, called the Bayesian Map formalism, that attempts to bridge the gap between the two domains: it is based on Bayesian modeling and inference for defining the building blocks, and uses operators for building hierarchies of models.

Published
2004

16. Bayesian Robot Programming

Author

Pierre Bessière, Julien Diard, Olivier Lebeltel, Emmanuel Mazer, Geometry and Probability for Motion and Action (E-MOTION), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
0209 industrial biotechnology, Iterative and incremental development, business.industry, Computer science, Probabilistic logic, [SCCO.COMP]Cognitive science/Computer science, Robotics, 02 engineering and technology, Bayesian inference, Sensor fusion, Machine learning, computer.software_genre, Robot learning, 020901 industrial engineering & automation, Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, Robot, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], 020201 artificial intelligence & image processing, Artificial intelligence, business, computer, Functional reactive programming
Abstract

International audience; We propose a new method to program robots based on Bayesian inference and learning. It is called BRP for Bayesian Robot Programming. The capacities of this programming method are demonstrated through a succession of increasingly complex experiments. Starting from the learning of simple reactive behaviors, we present instances of behavior combinations, sensor fusion, hierarchical behavior composition, situation recognition and temporal sequencing. This series of experiments comprises the steps in the incremental development of a complex robot program. The advantages and drawbacks of BRP are discussed along with these different experiments and summed up as a conclusion. These different robotics programs may be seen as an illustration of probabilistic programming applicable whenever one must deal with problems based on uncertain or incomplete knowledge. The scope of possible applications is obviously much broader than robotics.

Published
2004
Full Text
View/download PDF

17. Programmation bayésienne des robots

Author

Olivier Lebeltel, Pierre Bessière, Emmanuel Mazer, Julien Diard, Geometry and Probability for Motion and Action (E-MOTION), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
0209 industrial biotechnology, 020901 industrial engineering & automation, programmation des robots, Artificial Intelligence, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 02 engineering and technology, robotique autonome, inférence bayésienne, Software
Abstract

voir basilic : http://emotion.inrialpes.fr/bibemotion/2004/LBDM04a/; Cet article propose une mthode originale de programmation des robots fonde sur linfrence et lapprentissage baysien. Cette mthode traite formellement des problmes dincertitude et dincompltude inhrents au domaine considr. La principale difficult de la programmation des robots vient de linvitable incompltude des modles utiliss. Nous exposons le formalisme de description dune tche robotique ainsi que les mthodes de rsolution. Nous lillustrons en utilisant ce systme pour programmer une application de surveillance pour un robot mobile : le Khepera. Pour cela, nous utilisons des ressources gnriques de programmation appeles descriptions . Nous montrons comment dfinir et utiliser de manire incrmentale ces ressources (comportements ractifs, fusion capteur, reconnaissance de situations et squences de comportements) dans un cadre systmatique et unifi

Published
2004

18. Multi-sensor data fusion using Bayesian programming: An automotive application

Author

Emmanuel Mazer, Pierre Bessière, T. Fraichard, Christophe Coué, Automatic Programming and Decisional Systems in Robotics (SHARP), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), and French programme La Route Automatisée (http://www.lara.prd.fr) - European project IST-1999-12224 'Sensing of Car Environment at Low Speed Driving' (http://www.carsense.org)

Subjects
0209 industrial biotechnology, Computer science, business.industry, Bayesian probability, Probabilistic logic, Automotive industry, [SCCO.COMP]Cognitive science/Computer science, Advanced driver assistance systems, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Sensor fusion, Machine learning, computer.software_genre, Robot control, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 020901 industrial engineering & automation, Robustness (computer science), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Bayesian programming, Computer vision, Artificial intelligence, business, computer
Abstract

International audience; A prerequisite to the design of future Advanced Driver Assistance Systems for cars is a sensing system providing all the information required for high-level driving assistance tasks. Carsense is a European project whose purpose is to develop such a new sensing system. It will combine different sensors (laser, radar and video) and will rely on the fusion of the information coming from these sensors in order to achieve better accuracy, robustness and an increase of the information content. This paper demonstrates the interest of using probabilistic reasoning techniques to address this challenging multi-sensor data fusion problem. The approach used is called Bayesian Programming. It is a general approach based on an implementation of the Bayesian theory. It was introduced first to design robot control programs but its scope of application is much broader and it can be used whenever one has to deal with problems involving uncertain or incomplete knowledge.

Published
2003
Full Text
View/download PDF

19. A Bayesian framework for geometric uncertainties handling

Author

Emmanuel Mazer, Pierre Bessière, Kamel Mekhnacha, Laboratoire Leibniz (Leibniz - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Automatic Programming and Decisional Systems in Robotics (SHARP), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Mathematical optimization, Robot kinematics, Generalization, 05 social sciences, Bayesian probability, Monte Carlo method, [SCCO.COMP]Cognitive science/Computer science, CAD, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 02 engineering and technology, Inverse problem, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Constraint (information theory), 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, Probability distribution, 020201 artificial intelligence & image processing, 050207 economics, Mathematics
Abstract

International audience; We present a Bayesian CAD modeler for robotic applications. We describe the methodology we use to represent and handle uncertainties using probability distributions on the system parameters and sensor measurements. We address the problem of the propagation of geometric uncertainties and how to take this propagation into account when solving inverse problems. The proposed approach may be seen as a generalization of constraint-based approaches where we express a constraint as a probability distribution instead of a simple equality or inequality. We also describe appropriate numerical algorithms used to apply this methodology. Using an example, we show how to apply our approach by providing simulation results using the implemented CAD modeler.

Published
2001
Full Text
View/download PDF

20. Fast direct and inverse model acquisition by function decomposition

Author

R. Balaniuk, Emmanuel Mazer, Pierre Bessière, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA), Institut National Polytechnique de Grenoble (INPG), Automatic Programming and Decisional Systems in Robotics (SHARP), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Generalized inverse, [SCCO.COMP]Cognitive science/Computer science, 02 engineering and technology, Machine learning, computer.software_genre, Functional decomposition, Electronic mail, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Data acquisition, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], ComputingMilieux_MISCELLANEOUS, 050205 econometrics, Mathematics, business.industry, 05 social sciences, Robotics, Function (mathematics), Inverse problem, 020201 artificial intelligence & image processing, Artificial intelligence, Multidimensional systems, business, computer, Algorithm
Abstract

A computational approach to direct and generalized inverse model acquisition is presented. The approach is based on a proposed method to direct model acquisition from partial information. The method decomposes a hyper-space function in one variable functions, simplifying the learning problem. The acquired direct model is then implemented in a tree-like structure that can be used in the inverse sense without additional learning effort. The authors' approach is able to acquire complete models in hyper-spaces requiring only selected data focused in one-dimension sub-spaces, strongly reducing the data acquisition effort. The authors' approach is particularly interesting for applications in robotics. The acquisition of direct models in robotics frequently takes place in high dimension phase spaces. When traditional approximation methods are used, enormous data bases, containing the examples to be interpolated, are required.

Published
1995

21. Parallel Motion Planning with the Ariadne's Clew Algorithm

Author

Emmanuel Mazer, El-Ghazali Talbi, T. Chatroux, Juan-Manuel Ahuactzin, Pierre Bessière, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA), Institut National Polytechnique de Grenoble (INPG), and Bessiere, Pierre

Subjects
[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], 0209 industrial biotechnology, Time path, [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], Computer science, [SCCO.COMP]Cognitive science/Computer science, Mobile robot, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Planner, law.invention, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 020901 industrial engineering & automation, law, [SCCO.COMP] Cognitive science/Computer science, Parallel motion, Genetic algorithm, 0202 electrical engineering, electronic engineering, information engineering, Six degrees of freedom, 020201 artificial intelligence & image processing, Configuration space, computer, Algorithm, Robotic arm, computer.programming_language
Abstract

We describe an implementation of a real time path planner for a robot arm with six degrees of freedom moving among dynamical obstacles. The planner is based on a novel technique called the Ariadne's Clew Algorithm. A brief description of this algorithm and parallel implementation of it are presented. Finally we analyze experiments made with this planner.

Published
1993

22. The Ariadne's clew algorithm: Global planning with local methods

Author

Juan-Manuel Ahuactzin, Emmanuel Mazer, Pierre Bessière, El-Ghazali Talbi, Bessiere, Pierre, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA), Institut National Polytechnique de Grenoble (INPG), EEC ESPRIT projects SUPERNODE II & PAPAGENA - CONACYT (Mexico), Laboratoire de Génie Informatique (LGI - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-IMAG, Departamento de Ingeniería En Sistemas Computacionales, Universidad de las Américas, A.K. Peters, K. Goldberg, D. Halperin, J.C. Latombe & R. Wilson, and K. Goldberg, D. Halperin, J.C. Latombe & R. Wilson

Subjects
[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], 0209 industrial biotechnology, [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], Computer science, [INFO.INFO-RB] Computer Science [cs]/Robotics [cs.RO], Parallel manipulator, [SCCO.COMP]Cognitive science/Computer science, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Robot control, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 020901 industrial engineering & automation, Search algorithm, [SCCO.COMP] Cognitive science/Computer science, Genetic algorithm, Path (graph theory), 0202 electrical engineering, electronic engineering, information engineering, Robot, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], 020201 artificial intelligence & image processing, Motion planning, Massively parallel, Algorithm
Abstract

The goal of the work described in this paper is to build a path planner able to drive a robot in a dynamic environment where the obstacles are moving. In order to do so, we propose a method, called "Ariadne's clew algorithm", to build a global path planner based on the combination of two local planning algorithms: an EXPLORE algorithm and a SEARCH algorithm. The purpose of the EXPLORE algorithm is to collect information about the environment with an increasingly fine resolution by placing landmarks in the searched space. The goal of the SEARCH algorithm is to opportunistically check if the target can be easily reached from any given placed landmark. The Ariadne's clew algorithm is shown to be very fast in most cases allowing planning in dynamic environments. Hence, it is shown to be complete, which means that it is sure to find a path when one exists. Finally, we describe a massively parallel implementation of this algorithm.

Published
1993

23. Using Bayesian programming for multi-sensor multi-target tracking in automotive applications

Author

Pierre Bessière, Emmanuel Mazer, T. Fraichard, C. Coue, Geometry and Probability for Motion and Action (E-MOTION), Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble (GRAVIR - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), and French programme 'La Route Automatisée' (http://www.lara.prd.fr) - European project IST-1999-12224 'Sensing of Car Environment at Low Speed Driving' (http://www.carsense.org)

Subjects
Bayesian reasonning, 0209 industrial biotechnology, Engineering, business.industry, Bayesian probability, multi-sensor target tracking, Probabilistic logic, Automotive industry, [SCCO.COMP]Cognitive science/Computer science, Control engineering, Advanced driver assistance systems, 02 engineering and technology, Machine learning, computer.software_genre, Sensor fusion, Robot control, 020901 industrial engineering & automation, Robustness (computer science), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Bayesian programming, Artificial intelligence, business, computer, data-fusion
Abstract

International audience; A prerequisite to the design of future Advanced Driver Assistance Systems for cars is a sensing system providing all the information required for high-level driving assistance tasks. Carsense is a European project whose purpose is to develop such a new sensing system. It will combine different sensors (laser, radar and video) and will rely on the fusion of the information coming from these sensors in order to achieve better accuracy, robustness and an increase of the information content. This paper demonstrates the interest of using probabilistic reasoning techniques to address this challenging multi-sensor data fusion problem. The approach used is called Bayesian Programming. It is a general approach based on an implementation of the Bayesian theory. It was introduced first to design robot control programs but its scope of application is much broader and it can be used whenever one has to deal with problems involving uncertain or incomplete knowledge.

24. Using genetic algorithms for robot motion planning

Author

Pierre Bessière, Emmanuel Mazer, Juan-Manuel Ahuactzin, El-Ghazali Talbi, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA), Institut National Polytechnique de Grenoble (INPG), Laboratoire de Génie Informatique (LGI - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-IMAG, CNRS, Consejo Nacional de Ciencia y Tecnologia (Mexico), projet ESPRIT 'Supernode 2', and Bessiere, Pierre

Subjects
[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], 0209 industrial biotechnology, Mathematical optimization, Optimization problem, Holonomic, Computer science, [INFO.INFO-RB] Computer Science [cs]/Robotics [cs.RO], Parallel algorithm, parallel algorithms, [SCCO.COMP]Cognitive science/Computer science, Mobile robot, robot motion planning, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 02 engineering and technology, Kinematics, genetic algorithms, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 020901 industrial engineering & automation, [SCCO.COMP] Cognitive science/Computer science, Genetic algorithm, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], Robot, 020201 artificial intelligence & image processing, Motion planning
Abstract

We present an ongoing research work on robot motion planning using genetic algorithms. Our goal is to use this technique to build fast motion planners for robot with six or more degree of freedom. After a short review of the existing methods, we will introduce the genetic algorithms by showing how they can be used to solve the invers kinematic problem. In the second part of the paper, we show that the path planning problem can be expressed as an optimization problem and thus solved with a genetic algorithm. We illustrate the approach by building a path planner for a planar arm with two degree of freedom, then we demonstrate the validity of the method by planning paths for an holonomic mobile robot. Finally we describe an implementation of the selected genetic algorithm on a massively parallel machine and show that fast planning response is made possible by using this approach.

Catalog

Books, media, physical & digital resources
See catalog results