Robust propagation of probability boxes by interval predictor models
نویسندگان
چکیده
منابع مشابه
Interval predictor models: Identification and reliability
This paper addresses the problem of constructing reliable interval predictors directly from observed data. Differently from standard predictor models, interval predictors return a prediction interval as opposed to a single prediction value. We show that, in a stationary and independent observations framework, the reliability of themodel (that is, the probability that the future systemoutput fal...
متن کاملGuaranteed Mobile Robot Tracking Using Robust Interval Constraint Propagation
The paper presents an approach for localizing a mobile robot in a feature-based map using a 2D laser rangefinder and wheel odometry. As the presented approach is based on set membership methods, the localization result consists of sets instead of points, and is guaranteed to contain the true robot position as long as the sensor errors are absolutely bounded and a maximum number of measurement o...
متن کاملNew Results on the Identification of Interval Predictor Models
In this paper, the problem of identifying a predictor model for an unknown system is studied. Instead of standard models returning a prediction value as output, we consider models returning prediction intervals. Identification is performed according to some optimality criteria, and, thanks to this approach, we are able to provide, independently of the data generation mechanism, an exact evaluat...
متن کاملProbability Elicitation in Influence Diagram Modeling by Using Interval Probability
In decision modeling with influence diagrams, the most challenging task is probability elicitation from domain experts. It is usually very difficult for experts to directly assign precise probabilities to chance nodes. In this paper, we propose an approach to elicit probability effectively by using the concept of interval probability (IP). During the elicitation process, a group of experts assi...
متن کاملCorrectness of Local Probability Propagation in Graphical Models with Loops
Graphical models, such as Bayesian networks and Markov networks, represent joint distributions over a set of variables by means of a graph. When the graph is singly connected, local propagation rules of the sort proposed by Pearl (1988) are guaranteed to converge to the correct posterior probabilities. Recently a number of researchers have empirically demonstrated good performance of these same...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structural Safety
سال: 2020
ISSN: 0167-4730
DOI: 10.1016/j.strusafe.2019.101889