Nested Sampling Approach to Set-membership Estimation
Author(s) -
Radoslav Paulen,
Lucian Gomoescu,
Benoît Chachuat
Publication year - 2020
Publication title -
ifac-papersonline
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 72
eISSN - 2405-8971
pISSN - 2405-8963
DOI - 10.1016/j.ifacol.2020.12.555
Subject(s) - curse of dimensionality , set (abstract data type) , sampling (signal processing) , computer science , monte carlo method , bayesian probability , algorithm , mathematical optimization , importance sampling , mathematics , artificial intelligence , statistics , filter (signal processing) , computer vision , programming language
This paper is concerned with set-membership estimation in nonlinear dynamic systems. The problem entails characterizing the set of all possible parameter values such that given predicted outputs match their corresponding measurements within prescribed error bounds. Most existing methods to tackle this problem rely on outer-approximation techniques, which perform poorly when the parameter host set is large due to the curse of dimensionality. An adaptation of nested sampling—a Monte Carlo technique introduced to compute Bayesian evidence—is presented herein. The nested sampling algorithm leverages efficient strategies from Bayesian statistics for generating an inner-approximation of the desired parameter set. Several case studies are presented to demonstrate the approach.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom