z-logo
open-access-imgOpen Access
A Bayesian framework for robotic programming
Author(s) -
Olivier Lebeltel,
Julien Diard,
Pierre Bessìère,
Emmanuel Mazer
Publication year - 2001
Publication title -
aip conference proceedings
Language(s) - English
Resource type - Conference proceedings
SCImago Journal Rank - 0.177
H-Index - 75
eISSN - 1551-7616
pISSN - 0094-243X
DOI - 10.1063/1.1381923
Subject(s) - computer science , artificial intelligence , inference , bayesian inference , bayesian probability , principle of maximum entropy , inductive programming , formalism (music) , machine learning , logic programming , robot , programming paradigm , programming language , art , musical , visual arts
We propose an original method for programming robots based on bayesian inference and learning. This method formally deals with problems of uncertainty and incomplete information that are inherent to the field. Indeed, the principal difficulties of robot programming comes from the unavoidable incompleteness of the models used. We present the formalism for describing a robotic task as well as the resolution methods. This formalism is inspired by the theory of probability, suggested by the physicist E. T. Jaynes: “Probability as Logic” [1]. Learning and maximum entropy principle translate incompleteness into uncertainty. Bayesian inference offers a formal framework for reasoning with this uncertainty. The main contribution of this paper is the definition of a generic system of robotic programming and its experimental application. We illustrate it by programming a surveillance task with a mobile robot: the Khepera. In order to do this, we use generic programming resources called “descriptions”. We show how to...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom