Results 1 
5 of
5
Sequent Calculus and Data Fusion
, 2001
"... We present a formal method for data fusion, based on possibilistic logic. The method has been applied to a realworld problem of noisy sensordata fusion: the position estimation of an autonomous mobile robot navigating in an approximately and partially known office environment using a topological m ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We present a formal method for data fusion, based on possibilistic logic. The method has been applied to a realworld problem of noisy sensordata fusion: the position estimation of an autonomous mobile robot navigating in an approximately and partially known office environment using a topological map. Each place in the map is characterized by a set of logical formulae axiomatizing both symbolic knowledge and uncertain information from the sensors. At each time instant during navigation, the necessity for each place is calculated using a function generated by a proof system based on sequent calculus. Several test runs using a real robot have shown the adequacy of the approach in interpreting and disambiguating the information coming from independent perceptual sources, in combination with symbolic knowledge.
LogicBased Algorithms for Data Interpretation With Application to Robotics
, 1998
"... We present a formal method, based on possibilistic logic, to fuse uncertain sensory information. The basic concepts underlying the approach are summarized and discussed. The method has been applied to a realworld problem of noisy sensordata fusion: the position estimation of an autonomous mobile r ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We present a formal method, based on possibilistic logic, to fuse uncertain sensory information. The basic concepts underlying the approach are summarized and discussed. The method has been applied to a realworld problem of noisy sensordata fusion: the position estimation of an autonomous mobile robot navigating in an approximately and partially known o#ce environment, using a topological map. Each place in the map is characterized by a set of logical formulae axiomatizing both abstract knowledge and uncertain information from the sensors. At each time instant during navigation, the necessity value for each place is calculated using a purely syntactical method, based on sequent calculus. Several test runs on a real robot have evidenced the adequacy of the approach in interpreting and disambiguating the information coming from independent perceptual sources, in combination with abstract knowledge. Keywords: Reasoning with Uncertainty, Possibilistic Logic, Sequent Calculus, Sensor Fus...
Abstract Sequent calculus and data fusion
"... We present a formal method for data fusion, based on possibilistic logic. The method has been applied to a realworld problem of noisy sensordata fusion: the position estimation of an autonomous mobile robot navigating in an approximately and partially known office environment using a topological m ..."
Abstract
 Add to MetaCart
(Show Context)
We present a formal method for data fusion, based on possibilistic logic. The method has been applied to a realworld problem of noisy sensordata fusion: the position estimation of an autonomous mobile robot navigating in an approximately and partially known office environment using a topological map. Each place in the map is characterized by a set of logical formulae axiomatizing both symbolic knowledge and uncertain information from the sensors. At each time instant during navigation, the necessity for each place is calculated using a function generated by a proof system based on sequent calculus. Several test runs using a real robot have shown the adequacy of the approach in interpreting and disambiguating the information coming from independent perceptual sources, in combination with symbolic knowledge.
FiniteState Models with Multiplicities: Symbolic Representation and Reasoning
, 2001
"... It is useful to add to the descriptiveness of finitestate models by placing weights, or multiplicities, on the transition. There is considerable ad hoc work in the formal verification community on temporal logics for properties of such systems, largely for probabilistic multiplicities; also, there ..."
Abstract
 Add to MetaCart
It is useful to add to the descriptiveness of finitestate models by placing weights, or multiplicities, on the transition. There is considerable ad hoc work in the formal verification community on temporal logics for properties of such systems, largely for probabilistic multiplicities; also, there is a branch of automata theory dealing with transition multiplicities in a very general algebraic setting, but it has not, to date, been concerned with verification. This thesis